YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:55:42,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:55:42,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:55:42,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:55:42,163 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:55:42,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:55:42,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:55:42,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:55:42,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:55:42,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:55:42,170 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:55:42,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:55:42,171 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:55:42,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:55:42,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:55:42,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:55:42,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:55:42,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:55:42,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:55:42,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:55:42,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:55:42,181 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:55:42,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:55:42,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:55:42,184 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:55:42,185 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:55:42,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:55:42,186 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:55:42,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:55:42,187 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:55:42,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:55:42,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:55:42,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:55:42,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:55:42,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:55:42,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:55:42,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:55:42,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:55:42,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:55:42,192 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 08:55:42,207 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:55:42,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:55:42,208 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:55:42,208 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:55:42,208 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:55:42,208 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:55:42,209 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:55:42,209 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:55:42,209 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:55:42,209 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:55:42,209 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:55:42,209 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:55:42,210 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:55:42,210 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:55:42,210 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:55:42,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:55:42,210 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:55:42,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:55:42,211 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:55:42,211 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:55:42,211 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:55:42,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:55:42,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:55:42,211 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:55:42,212 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:55:42,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:55:42,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:55:42,212 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:55:42,212 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:55:42,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:55:42,250 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:55:42,254 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:55:42,255 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:55:42,256 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:55:42,256 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:55:42,326 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/56fb7488460d4b0792ca3e21d68f8ebd/FLAG38e2a6166 [2020-06-22 08:55:42,669 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:55:42,669 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:55:42,670 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:55:42,676 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/56fb7488460d4b0792ca3e21d68f8ebd/FLAG38e2a6166 [2020-06-22 08:55:43,072 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/56fb7488460d4b0792ca3e21d68f8ebd [2020-06-22 08:55:43,083 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:55:43,085 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:55:43,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:55:43,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:55:43,089 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:55:43,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a1d386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43, skipping insertion in model container [2020-06-22 08:55:43,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:55:43,117 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:55:43,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:55:43,340 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:55:43,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:55:43,371 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:55:43,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43 WrapperNode [2020-06-22 08:55:43,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:55:43,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:55:43,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:55:43,373 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:55:43,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:55:43,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:55:43,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:55:43,411 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:55:43,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:55:43,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:55:43,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:55:43,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:55:43,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:55:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:55:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:55:43,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:55:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:55:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:55:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:55:43,714 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:55:43,714 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 08:55:43,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:55:43 BoogieIcfgContainer [2020-06-22 08:55:43,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:55:43,717 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:55:43,717 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:55:43,719 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:55:43,720 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:55:43" (1/1) ... [2020-06-22 08:55:43,737 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 31 edges [2020-06-22 08:55:43,738 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:55:43,739 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:55:43,740 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:55:43,740 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:55:43,742 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:55:43,742 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:55:43,743 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:55:43,763 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:55:43,792 INFO L200 BlockEncoder]: SBE split 15 edges [2020-06-22 08:55:43,797 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 08:55:43,801 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:55:43,825 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 08:55:43,828 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 08:55:43,829 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:55:43,830 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:55:43,839 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 08:55:43,840 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:55:43,840 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:55:43,840 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:55:43,841 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:55:43,841 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:55:43,842 INFO L313 BlockEncoder]: Encoded RCFG 23 locations, 40 edges [2020-06-22 08:55:43,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:55:43 BasicIcfg [2020-06-22 08:55:43,843 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:55:43,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:55:43,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:55:43,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:55:43,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:55:43" (1/4) ... [2020-06-22 08:55:43,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3c9ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:55:43, skipping insertion in model container [2020-06-22 08:55:43,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (2/4) ... [2020-06-22 08:55:43,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3c9ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:55:43, skipping insertion in model container [2020-06-22 08:55:43,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:55:43" (3/4) ... [2020-06-22 08:55:43,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3c9ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:55:43, skipping insertion in model container [2020-06-22 08:55:43,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:55:43" (4/4) ... [2020-06-22 08:55:43,851 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:55:43,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:55:43,869 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 08:55:43,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 08:55:43,914 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:55:43,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:55:43,915 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:55:43,915 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:55:43,916 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:55:43,916 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:55:43,916 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:55:43,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:55:43,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:55:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-06-22 08:55:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 08:55:43,937 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:43,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 08:55:43,938 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:43,944 INFO L82 PathProgramCache]: Analyzing trace with hash 100877, now seen corresponding path program 1 times [2020-06-22 08:55:43,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:43,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:43,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:43,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:43,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:55:44,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:55:44,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:55:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:55:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,137 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-06-22 08:55:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,247 INFO L93 Difference]: Finished difference Result 23 states and 40 transitions. [2020-06-22 08:55:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 08:55:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,262 INFO L225 Difference]: With dead ends: 23 [2020-06-22 08:55:44,262 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 08:55:44,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 08:55:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 08:55:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 08:55:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2020-06-22 08:55:44,464 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 3 [2020-06-22 08:55:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,465 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-06-22 08:55:44,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:55:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2020-06-22 08:55:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 08:55:44,466 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:44,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 08:55:44,466 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:44,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,466 INFO L82 PathProgramCache]: Analyzing trace with hash 100874, now seen corresponding path program 1 times [2020-06-22 08:55:44,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:55:44,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:55:44,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:55:44,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:55:44,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,493 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 3 states. [2020-06-22 08:55:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,559 INFO L93 Difference]: Finished difference Result 19 states and 32 transitions. [2020-06-22 08:55:44,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 08:55:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,560 INFO L225 Difference]: With dead ends: 19 [2020-06-22 08:55:44,561 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 08:55:44,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 08:55:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-06-22 08:55:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 08:55:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2020-06-22 08:55:44,565 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 3 [2020-06-22 08:55:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,566 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-06-22 08:55:44,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:55:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2020-06-22 08:55:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:55:44,566 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:44,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:55:44,567 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:44,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash 3126137, now seen corresponding path program 1 times [2020-06-22 08:55:44,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:55:44,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:55:44,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:55:44,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:55:44,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:55:44,623 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. Second operand 4 states. [2020-06-22 08:55:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,673 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2020-06-22 08:55:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 08:55:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,674 INFO L225 Difference]: With dead ends: 15 [2020-06-22 08:55:44,674 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 08:55:44,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:55:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 08:55:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 08:55:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 08:55:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2020-06-22 08:55:44,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 4 [2020-06-22 08:55:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,678 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-06-22 08:55:44,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:55:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2020-06-22 08:55:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:55:44,678 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:44,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:55:44,679 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:44,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,679 INFO L82 PathProgramCache]: Analyzing trace with hash 3126139, now seen corresponding path program 1 times [2020-06-22 08:55:44,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:55:44,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:55:44,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:55:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:55:44,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,704 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand 3 states. [2020-06-22 08:55:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,726 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-06-22 08:55:44,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:55:44,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,727 INFO L225 Difference]: With dead ends: 15 [2020-06-22 08:55:44,727 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 08:55:44,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 08:55:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 08:55:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 08:55:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-06-22 08:55:44,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 4 [2020-06-22 08:55:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,731 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-06-22 08:55:44,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:55:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-06-22 08:55:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:55:44,731 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:55:44,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:55:44,731 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:55:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash 3126140, now seen corresponding path program 1 times [2020-06-22 08:55:44,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:55:44,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:55:44,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:55:44,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:55:44,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:55:44,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,768 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 3 states. [2020-06-22 08:55:44,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:55:44,806 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-06-22 08:55:44,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:55:44,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:55:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:55:44,807 INFO L225 Difference]: With dead ends: 12 [2020-06-22 08:55:44,807 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:55:44,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:55:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:55:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:55:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:55:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:55:44,809 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 08:55:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:55:44,809 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:55:44,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:55:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:55:44,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:55:44,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:55:44,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,859 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,859 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-06-22 08:55:44,860 INFO L444 ceAbstractionStarter]: At program point L7-2(lines 6 10) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) [2020-06-22 08:55:44,860 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 08:55:44,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 08:55:44,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:55:44,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 08:55:44,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 08:55:44,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 08:55:44,861 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,862 INFO L448 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,862 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2020-06-22 08:55:44,862 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-06-22 08:55:44,862 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:55:44,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:44,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:55:44 BasicIcfg [2020-06-22 08:55:44,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:55:44,882 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:55:44,882 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:55:44,885 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:55:44,886 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:55:43" (1/5) ... [2020-06-22 08:55:44,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa0cbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:55:44, skipping insertion in model container [2020-06-22 08:55:44,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:55:43" (2/5) ... [2020-06-22 08:55:44,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa0cbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:55:44, skipping insertion in model container [2020-06-22 08:55:44,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:55:43" (3/5) ... [2020-06-22 08:55:44,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa0cbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:55:44, skipping insertion in model container [2020-06-22 08:55:44,888 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:55:43" (4/5) ... [2020-06-22 08:55:44,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa0cbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:55:44, skipping insertion in model container [2020-06-22 08:55:44,888 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:55:44,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:55:44" (5/5) ... [2020-06-22 08:55:44,890 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:55:44,910 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:55:44,911 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:55:44,911 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:55:44,911 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:55:44,911 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:55:44,911 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:55:44,911 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:55:44,911 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:55:44,911 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:55:44,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-06-22 08:55:44,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 08:55:44,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:55:44,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:55:44,924 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 08:55:44,925 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:55:44,925 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:55:44,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-06-22 08:55:44,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 08:55:44,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:55:44,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:55:44,927 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 08:55:44,927 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:55:44,932 INFO L794 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue [71] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 16#L-1true [92] L-1-->L6: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5#L6true [59] L6-->L7-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~y~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 3#L7-2true [2020-06-22 08:55:44,933 INFO L796 eck$LassoCheckResult]: Loop: 3#L7-2true [126] L7-2-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (= 1 (select |v_#valid_31| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11))) InVars {#valid=|v_#valid_31|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{#valid=|v_#valid_31|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 11#L8true [68] L8-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9#L8-1true [65] L8-1-->L8-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_10| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= (select |v_#valid_12| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 7#L8-2true [124] L8-2-->L9: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_13)) (= |v_#memory_int_11| (store |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem3_6| (* (- 1) |v_ULTIMATE.start_main_#t~mem4_6|))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_18| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10)) InVars {#valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_18|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_6|} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_18|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 15#L9true [52] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_14| v_ULTIMATE.start_main_~y~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_14|, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 12#L9-1true [125] L9-1-->L7-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_12 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_16)) (= (select |v_#valid_30| v_ULTIMATE.start_main_~y~0.base_16) 1) (= |v_#memory_int_13| (store |v_#memory_int_14| v_ULTIMATE.start_main_~y~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~y~0.base_16) v_ULTIMATE.start_main_~y~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem5_6| 1)))) (<= 0 v_ULTIMATE.start_main_~y~0.offset_12)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_19|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_19|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem5] 3#L7-2true [2020-06-22 08:55:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash 100933, now seen corresponding path program 1 times [2020-06-22 08:55:44,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:44,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:44,975 INFO L82 PathProgramCache]: Analyzing trace with hash 264666155, now seen corresponding path program 1 times [2020-06-22 08:55:44,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:44,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:45,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1948271471, now seen corresponding path program 1 times [2020-06-22 08:55:45,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:55:45,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:55:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:45,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:55:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:55:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:45,267 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-06-22 08:55:45,350 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:55:45,352 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:55:45,352 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:55:45,352 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:55:45,352 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:55:45,352 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:55:45,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:55:45,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:55:45,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 08:55:45,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:55:45,353 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:55:45,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,544 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-06-22 08:55:45,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:55:45,898 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:55:45,904 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:55:45,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:55:45,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:45,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:55:45,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:45,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:45,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:45,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:55:45,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:55:45,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:45,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:55:45,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:45,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:45,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:45,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:45,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:45,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:45,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:45,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:55:45,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:45,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:45,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:45,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:45,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:45,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:45,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:45,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:55:45,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:45,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:45,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:45,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:45,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:45,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:45,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:55:45,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:55:45,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:55:45,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:55:45,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:55:45,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:55:45,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:55:45,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:55:46,010 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:55:46,031 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 08:55:46,032 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 08:55:46,034 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:55:46,036 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 08:55:46,036 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:55:46,037 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 - 1 >= 0] [2020-06-22 08:55:46,073 INFO L297 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2020-06-22 08:55:46,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:55:46,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:55:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:46,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 08:55:46,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:46,164 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 08:55:46,165 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,176 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:46,176 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,176 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2020-06-22 08:55:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:46,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 08:55:46,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:46,299 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2020-06-22 08:55:46,302 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,314 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:46,316 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,316 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:28 [2020-06-22 08:55:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:55:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:46,484 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:46,492 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:55:46,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 08:55:46,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:55:46,532 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2020-06-22 08:55:46,533 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,541 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:55:46,541 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:55:46,542 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2020-06-22 08:55:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:55:46,674 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:55:46,674 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-06-22 08:55:46,677 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2020-06-22 08:55:46,678 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states. Second operand 8 states. [2020-06-22 08:55:47,370 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states.. Second operand 8 states. Result 74 states and 128 transitions. Complement of second has 24 states. [2020-06-22 08:55:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 10 non-accepting loop states 2 accepting loop states [2020-06-22 08:55:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 08:55:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2020-06-22 08:55:47,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 101 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 08:55:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:47,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 101 transitions. Stem has 9 letters. Loop has 6 letters. [2020-06-22 08:55:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 101 transitions. Stem has 3 letters. Loop has 12 letters. [2020-06-22 08:55:47,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:55:47,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 128 transitions. [2020-06-22 08:55:47,388 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:55:47,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2020-06-22 08:55:47,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:55:47,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:55:47,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:55:47,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:55:47,390 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:55:47,391 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:55:47,391 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:55:47,391 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:55:47,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:55:47,391 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:55:47,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:55:47,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:55:47 BasicIcfg [2020-06-22 08:55:47,397 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:55:47,397 INFO L168 Benchmark]: Toolchain (without parser) took 4313.85 ms. Allocated memory was 514.9 MB in the beginning and 633.9 MB in the end (delta: 119.0 MB). Free memory was 439.3 MB in the beginning and 571.1 MB in the end (delta: -131.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:55:47,398 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 460.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:55:47,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.88 ms. Allocated memory was 514.9 MB in the beginning and 554.7 MB in the end (delta: 39.8 MB). Free memory was 439.3 MB in the beginning and 523.1 MB in the end (delta: -83.8 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:55:47,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.68 ms. Allocated memory is still 554.7 MB. Free memory was 523.1 MB in the beginning and 521.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-06-22 08:55:47,400 INFO L168 Benchmark]: Boogie Preprocessor took 22.13 ms. Allocated memory is still 554.7 MB. Free memory was 521.1 MB in the beginning and 519.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:55:47,400 INFO L168 Benchmark]: RCFGBuilder took 283.13 ms. Allocated memory is still 554.7 MB. Free memory was 519.7 MB in the beginning and 502.4 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:55:47,401 INFO L168 Benchmark]: BlockEncodingV2 took 126.08 ms. Allocated memory is still 554.7 MB. Free memory was 502.4 MB in the beginning and 494.3 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:55:47,401 INFO L168 Benchmark]: TraceAbstraction took 1037.32 ms. Allocated memory is still 554.7 MB. Free memory was 493.6 MB in the beginning and 417.2 MB in the end (delta: 76.4 MB). Peak memory consumption was 76.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:55:47,402 INFO L168 Benchmark]: BuchiAutomizer took 2515.39 ms. Allocated memory was 554.7 MB in the beginning and 633.9 MB in the end (delta: 79.2 MB). Free memory was 417.2 MB in the beginning and 571.1 MB in the end (delta: -153.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:55:47,406 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 31 edges - StatisticsResult: Encoded RCFG 23 locations, 40 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 460.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 286.88 ms. Allocated memory was 514.9 MB in the beginning and 554.7 MB in the end (delta: 39.8 MB). Free memory was 439.3 MB in the beginning and 523.1 MB in the end (delta: -83.8 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.68 ms. Allocated memory is still 554.7 MB. Free memory was 523.1 MB in the beginning and 521.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.13 ms. Allocated memory is still 554.7 MB. Free memory was 521.1 MB in the beginning and 519.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 283.13 ms. Allocated memory is still 554.7 MB. Free memory was 519.7 MB in the beginning and 502.4 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 126.08 ms. Allocated memory is still 554.7 MB. Free memory was 502.4 MB in the beginning and 494.3 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1037.32 ms. Allocated memory is still 554.7 MB. Free memory was 493.6 MB in the beginning and 417.2 MB in the end (delta: 76.4 MB). Peak memory consumption was 76.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2515.39 ms. Allocated memory was 554.7 MB in the beginning and 633.9 MB in the end (delta: 79.2 MB). Free memory was 417.2 MB in the beginning and 571.1 MB in the end (delta: -153.9 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant [2020-06-22 08:55:47,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:47,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:47,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:55:47,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid[y] == 1 && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[x]) && y == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 14 error locations. SAFE Result, 0.9s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 86 SDslu, 3 SDs, 0 SdLazy, 94 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1 SDtfs, 231 SDslu, 1 SDs, 0 SdLazy, 447 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp97 ukn59 mio100 lsp41 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 08:55:39.356 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 08:55:47.644 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check