/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:00:07,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:00:07,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:00:07,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:00:07,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:00:07,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:00:07,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:00:07,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:00:07,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:00:07,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:00:07,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:00:07,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:00:07,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:00:07,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:00:07,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:00:07,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:00:07,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:00:07,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:00:07,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:00:07,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:00:07,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:00:07,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:00:07,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:00:07,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:00:07,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:00:07,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:00:07,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:00:07,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:00:07,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:00:07,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:00:07,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:00:07,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:00:07,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:00:07,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:00:07,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:00:07,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:00:07,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:00:07,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:00:07,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:00:07,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:00:07,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:00:07,124 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:00:07,138 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:00:07,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:00:07,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:00:07,140 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:00:07,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:00:07,140 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:00:07,141 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:00:07,141 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:00:07,141 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:00:07,141 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:00:07,141 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:00:07,142 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:00:07,142 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:00:07,142 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:00:07,142 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:00:07,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:00:07,142 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:00:07,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:00:07,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:00:07,143 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:00:07,143 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:00:07,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:00:07,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:00:07,144 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:00:07,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:00:07,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:00:07,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:00:07,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:00:07,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:00:07,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:00:07,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:00:07,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:00:07,330 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:00:07,331 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:00:07,332 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:00:07,391 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_tSVDvg/tmp/0a466c8712a341d8a285b66743433504/FLAG0898ed523 [2020-07-01 13:00:07,749 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:00:07,749 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:00:07,750 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:00:07,757 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_tSVDvg/tmp/0a466c8712a341d8a285b66743433504/FLAG0898ed523 [2020-07-01 13:00:08,144 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_tSVDvg/tmp/0a466c8712a341d8a285b66743433504 [2020-07-01 13:00:08,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:00:08,157 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:00:08,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:00:08,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:00:08,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:00:08,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48624d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08, skipping insertion in model container [2020-07-01 13:00:08,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:00:08,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:00:08,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:00:08,422 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:00:08,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:00:08,454 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:00:08,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08 WrapperNode [2020-07-01 13:00:08,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:00:08,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:00:08,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:00:08,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:00:08,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:00:08,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:00:08,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:00:08,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:00:08,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:00:08,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:00:08,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:00:08,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:00:08,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (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-07-01 13:00:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:00:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:00:08,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:00:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:00:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:00:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:00:08,868 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:00:08,868 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 13:00:08,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:00:08 BoogieIcfgContainer [2020-07-01 13:00:08,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:00:08,873 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:00:08,873 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:00:08,876 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:00:08,876 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:00:08" (1/1) ... [2020-07-01 13:00:08,892 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 56 edges [2020-07-01 13:00:08,894 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:00:08,895 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:00:08,895 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:00:08,896 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:00:08,900 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:00:08,901 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:00:08,901 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:00:08,929 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:00:08,961 INFO L200 BlockEncoder]: SBE split 27 edges [2020-07-01 13:00:08,966 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:00:08,967 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:00:08,995 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 13:00:08,998 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 13:00:08,999 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:00:09,000 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:00:09,000 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:00:09,001 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:00:09,001 INFO L313 BlockEncoder]: Encoded RCFG 44 locations, 74 edges [2020-07-01 13:00:09,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:00:09 BasicIcfg [2020-07-01 13:00:09,002 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:00:09,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:00:09,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:00:09,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:00:09,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:00:08" (1/4) ... [2020-07-01 13:00:09,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f6da3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:00:09, skipping insertion in model container [2020-07-01 13:00:09,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (2/4) ... [2020-07-01 13:00:09,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f6da3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:00:09, skipping insertion in model container [2020-07-01 13:00:09,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:00:08" (3/4) ... [2020-07-01 13:00:09,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f6da3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:00:09, skipping insertion in model container [2020-07-01 13:00:09,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:00:09" (4/4) ... [2020-07-01 13:00:09,011 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:00:09,021 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:00:09,029 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-07-01 13:00:09,042 INFO L251 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-07-01 13:00:09,066 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:00:09,066 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:00:09,066 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:00:09,066 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:00:09,066 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:00:09,067 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:00:09,067 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:00:09,067 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:00:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-01 13:00:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:00:09,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:09,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:00:09,089 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:09,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash 134090, now seen corresponding path program 1 times [2020-07-01 13:00:09,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:09,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560637556] [2020-07-01 13:00:09,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:09,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560637556] [2020-07-01 13:00:09,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:09,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:09,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028202133] [2020-07-01 13:00:09,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:09,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:09,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:09,282 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-07-01 13:00:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:09,416 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2020-07-01 13:00:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:09,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:00:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:09,430 INFO L225 Difference]: With dead ends: 86 [2020-07-01 13:00:09,430 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 13:00:09,434 INFO L675 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-07-01 13:00:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 13:00:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 13:00:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 13:00:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 71 transitions. [2020-07-01 13:00:09,473 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 71 transitions. Word has length 3 [2020-07-01 13:00:09,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:09,474 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 71 transitions. [2020-07-01 13:00:09,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 71 transitions. [2020-07-01 13:00:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:00:09,474 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:09,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:00:09,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:00:09,477 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash 134183, now seen corresponding path program 1 times [2020-07-01 13:00:09,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:09,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952391519] [2020-07-01 13:00:09,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:09,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952391519] [2020-07-01 13:00:09,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:09,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:09,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331932538] [2020-07-01 13:00:09,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:09,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:09,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:09,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:09,535 INFO L87 Difference]: Start difference. First operand 44 states and 71 transitions. Second operand 3 states. [2020-07-01 13:00:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:09,643 INFO L93 Difference]: Finished difference Result 44 states and 71 transitions. [2020-07-01 13:00:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:09,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:00:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:09,645 INFO L225 Difference]: With dead ends: 44 [2020-07-01 13:00:09,645 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 13:00:09,646 INFO L675 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-07-01 13:00:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 13:00:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 13:00:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 13:00:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2020-07-01 13:00:09,652 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 3 [2020-07-01 13:00:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:09,652 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 59 transitions. [2020-07-01 13:00:09,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2020-07-01 13:00:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:00:09,653 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:09,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:00:09,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:00:09,653 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash 134185, now seen corresponding path program 1 times [2020-07-01 13:00:09,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:09,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579760111] [2020-07-01 13:00:09,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:09,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579760111] [2020-07-01 13:00:09,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:09,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:09,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069145627] [2020-07-01 13:00:09,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:09,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:09,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:09,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:09,681 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. Second operand 3 states. [2020-07-01 13:00:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:09,763 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2020-07-01 13:00:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:09,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:00:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:09,764 INFO L225 Difference]: With dead ends: 44 [2020-07-01 13:00:09,764 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 13:00:09,765 INFO L675 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-07-01 13:00:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 13:00:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 13:00:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 13:00:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2020-07-01 13:00:09,769 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 3 [2020-07-01 13:00:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:09,770 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2020-07-01 13:00:09,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2020-07-01 13:00:09,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:00:09,770 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:09,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:00:09,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:00:09,771 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:09,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:09,771 INFO L82 PathProgramCache]: Analyzing trace with hash 134186, now seen corresponding path program 1 times [2020-07-01 13:00:09,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:09,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192440712] [2020-07-01 13:00:09,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:09,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192440712] [2020-07-01 13:00:09,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:09,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:09,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420082190] [2020-07-01 13:00:09,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:09,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:09,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:09,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:09,806 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand 3 states. [2020-07-01 13:00:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:09,878 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2020-07-01 13:00:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:09,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:00:09,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:09,880 INFO L225 Difference]: With dead ends: 38 [2020-07-01 13:00:09,880 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:00:09,880 INFO L675 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-07-01 13:00:09,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:00:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:00:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:00:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2020-07-01 13:00:09,885 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 3 [2020-07-01 13:00:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:09,885 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-07-01 13:00:09,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2020-07-01 13:00:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:00:09,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:09,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:00:09,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:00:09,886 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:09,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash 4158144, now seen corresponding path program 1 times [2020-07-01 13:00:09,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:09,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435483207] [2020-07-01 13:00:09,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:09,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435483207] [2020-07-01 13:00:09,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:09,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:09,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943538059] [2020-07-01 13:00:09,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:09,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:09,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:09,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:09,916 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 3 states. [2020-07-01 13:00:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:09,992 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-07-01 13:00:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:09,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:00:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:09,994 INFO L225 Difference]: With dead ends: 38 [2020-07-01 13:00:09,994 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:00:09,995 INFO L675 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-07-01 13:00:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:00:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:00:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:00:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2020-07-01 13:00:09,999 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 4 [2020-07-01 13:00:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:10,000 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-07-01 13:00:10,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2020-07-01 13:00:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:00:10,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:10,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:00:10,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:00:10,001 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:10,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash 4158145, now seen corresponding path program 1 times [2020-07-01 13:00:10,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:10,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917438835] [2020-07-01 13:00:10,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:10,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917438835] [2020-07-01 13:00:10,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:10,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:10,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236962482] [2020-07-01 13:00:10,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:10,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:10,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:10,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:10,042 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2020-07-01 13:00:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:10,106 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2020-07-01 13:00:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:10,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:00:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:10,107 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:00:10,107 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 13:00:10,107 INFO L675 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-07-01 13:00:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 13:00:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 13:00:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 13:00:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-07-01 13:00:10,112 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 4 [2020-07-01 13:00:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:10,112 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-07-01 13:00:10,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-07-01 13:00:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:00:10,112 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:10,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:00:10,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:00:10,113 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash 4158142, now seen corresponding path program 1 times [2020-07-01 13:00:10,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:10,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312801463] [2020-07-01 13:00:10,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:10,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312801463] [2020-07-01 13:00:10,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:10,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:10,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891551126] [2020-07-01 13:00:10,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:10,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:10,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:10,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:10,148 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 3 states. [2020-07-01 13:00:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:10,198 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-07-01 13:00:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:10,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:00:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:10,199 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:00:10,199 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:00:10,200 INFO L675 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-07-01 13:00:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:00:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:00:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:00:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:00:10,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 13:00:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:10,201 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:00:10,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:00:10,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:00:10,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:00:10,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:00:10,260 INFO L268 CegarLoopResult]: For program point L11(lines 11 21) no Hoare annotation was computed. [2020-07-01 13:00:10,261 INFO L264 CegarLoopResult]: At program point L11-2(lines 10 21) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (<= 1 |#StackHeapBarrier|) (= 4 (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:00:10,261 INFO L268 CegarLoopResult]: For program point L11-3(lines 11 21) no Hoare annotation was computed. [2020-07-01 13:00:10,261 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:00:10,261 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:00:10,261 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:00:10,261 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:00:10,262 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:00:10,262 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:00:10,262 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:00:10,262 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 13:00:10,262 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:00:10,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:00:10,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:00:10,263 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:00:10,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:00:10,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:00:10,263 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:00:10,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:00:10,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:00:10,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:00:10,264 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:00:10,264 INFO L268 CegarLoopResult]: For program point L13-1(lines 13 19) no Hoare annotation was computed. [2020-07-01 13:00:10,264 INFO L264 CegarLoopResult]: At program point L13-3(lines 12 19) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (<= 1 |#StackHeapBarrier|) (= 4 (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:00:10,264 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 13:00:10,264 INFO L268 CegarLoopResult]: For program point L13-4(lines 13 19) no Hoare annotation was computed. [2020-07-01 13:00:10,264 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 13:00:10,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:00:10,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:00:10,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:00:10,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:00:10,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:00:10,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:00:10,265 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:00:10,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:00:10,265 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:00:10,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:00:10,266 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:00:10,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:00:10,266 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 17) no Hoare annotation was computed. [2020-07-01 13:00:10,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:00:10,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:00:10,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:00:10,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:00:10,270 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:00:10,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:10,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:10,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:10,285 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:10,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:10,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:10,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:10,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:10,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:10,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:10,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:10,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:10,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:00:10 BasicIcfg [2020-07-01 13:00:10,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:00:10,292 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:00:10,292 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:00:10,295 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:00:10,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:10,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:00:08" (1/5) ... [2020-07-01 13:00:10,297 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@365a6292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:00:10, skipping insertion in model container [2020-07-01 13:00:10,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:10,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:08" (2/5) ... [2020-07-01 13:00:10,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@365a6292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:00:10, skipping insertion in model container [2020-07-01 13:00:10,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:10,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:00:08" (3/5) ... [2020-07-01 13:00:10,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@365a6292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:00:10, skipping insertion in model container [2020-07-01 13:00:10,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:10,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:00:09" (4/5) ... [2020-07-01 13:00:10,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@365a6292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:00:10, skipping insertion in model container [2020-07-01 13:00:10,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:10,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:00:10" (5/5) ... [2020-07-01 13:00:10,300 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:00:10,326 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:00:10,326 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:00:10,326 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:00:10,326 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:00:10,326 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:00:10,326 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:00:10,326 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:00:10,326 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:00:10,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-01 13:00:10,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 13:00:10,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:00:10,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:00:10,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 13:00:10,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:00:10,342 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:00:10,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-01 13:00:10,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 13:00:10,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:00:10,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:00:10,345 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 13:00:10,345 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:00:10,351 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 22#L-1true [169] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 16#L9true [115] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 13#L9-1true [111] L9-1-->L11-2: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 17#L11-2true [2020-07-01 13:00:10,352 INFO L796 eck$LassoCheckResult]: Loop: 17#L11-2true [91] L11-2-->L11: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 40#L11true [105] L11-->L12: Formula: (<= 0 |v_ULTIMATE.start_test_fun_#t~mem2_6|) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 26#L12true [124] L12-->L13-3: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6 (store (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 1))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 37#L13-3true [128] L13-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 44#L13true [133] L13-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 42#L13-1true [156] L13-1-->L13-4: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem4_4| |v_ULTIMATE.start_test_fun_#t~mem3_4|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_4|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_4|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 18#L13-4true [118] L13-4-->L20: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_24|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_24|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 20#L20true [225] L20-->L11-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (store |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_21 (store (select |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#valid=|v_#valid_40|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_31|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} OutVars{#valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_31|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 17#L11-2true [2020-07-01 13:00:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:10,353 INFO L82 PathProgramCache]: Analyzing trace with hash 4158079, now seen corresponding path program 1 times [2020-07-01 13:00:10,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:10,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745102986] [2020-07-01 13:00:10,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:10,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:00:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash 245443477, now seen corresponding path program 1 times [2020-07-01 13:00:10,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:10,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299318403] [2020-07-01 13:00:10,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:10,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:00:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:10,420 INFO L82 PathProgramCache]: Analyzing trace with hash -755154925, now seen corresponding path program 1 times [2020-07-01 13:00:10,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:10,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514099257] [2020-07-01 13:00:10,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:10,456 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:00:10,742 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2020-07-01 13:00:10,823 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:00:10,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:00:10,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:00:10,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:00:10,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:00:10,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:10,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:00:10,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:00:10,825 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 13:00:10,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:00:10,826 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:00:10,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:10,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:11,079 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-07-01 13:00:11,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:11,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:11,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:11,444 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:00:11,449 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,454 INFO L120 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-07-01 13:00:11,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:11,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:11,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:11,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,495 INFO L120 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-07-01 13:00:11,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:11,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:11,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:11,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,533 INFO L120 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-07-01 13:00:11,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:11,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:11,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:11,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,569 INFO L120 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-07-01 13:00:11,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:11,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:11,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:11,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,606 INFO L120 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-07-01 13:00:11,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:11,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:11,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:11,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,643 INFO L120 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-07-01 13:00:11,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:11,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:11,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,686 INFO L120 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-07-01 13:00:11,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:11,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:11,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:11,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,724 INFO L120 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-07-01 13:00:11,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:11,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:11,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,766 INFO L120 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-07-01 13:00:11,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:11,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:11,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:11,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,803 INFO L120 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-07-01 13:00:11,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:11,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:11,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:11,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,839 INFO L120 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-07-01 13:00:11,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:11,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:11,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,896 INFO L120 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-07-01 13:00:11,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:11,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:11,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:11,944 INFO L120 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-07-01 13:00:11,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:11,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:11,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:11,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:11,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:11,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:11,960 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:00:11,994 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-01 13:00:11,994 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:12,000 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:00:12,005 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 13:00:12,005 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:00:12,006 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2020-07-01 13:00:12,087 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-07-01 13:00:12,092 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:00:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:12,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:00:12,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:00:12,181 INFO L377 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-07-01 13:00:12,183 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,187 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:00:12,188 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2020-07-01 13:00:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:12,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:00:12,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:00:12,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-07-01 13:00:12,262 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,275 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:00:12,276 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:00:12,276 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2020-07-01 13:00:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:12,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:00:12,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:00:12,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2020-07-01 13:00:12,477 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,487 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:00:12,488 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,489 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-07-01 13:00:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:12,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:00:12,622 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:00:12,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2020-07-01 13:00:12,633 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,641 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:00:12,642 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,642 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-07-01 13:00:12,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2020-07-01 13:00:12,652 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,662 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:00:12,663 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:00:12,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2020-07-01 13:00:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:12,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:00:12,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:00:12,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2020-07-01 13:00:12,727 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,737 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:00:12,738 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,738 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2020-07-01 13:00:12,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2020-07-01 13:00:12,759 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:00:12,781 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:00:12,782 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:00:12,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2020-07-01 13:00:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:12,797 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:00:12,797 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-07-01 13:00:12,801 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 7 loop predicates [2020-07-01 13:00:12,802 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 44 states. Second operand 7 states. [2020-07-01 13:00:13,649 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 44 states.. Second operand 7 states. Result 151 states and 259 transitions. Complement of second has 20 states. [2020-07-01 13:00:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states [2020-07-01 13:00:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 13:00:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2020-07-01 13:00:13,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 193 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-01 13:00:13,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:00:13,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 193 transitions. Stem has 12 letters. Loop has 8 letters. [2020-07-01 13:00:13,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:00:13,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 193 transitions. Stem has 4 letters. Loop has 16 letters. [2020-07-01 13:00:13,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:00:13,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 259 transitions. [2020-07-01 13:00:13,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 13:00:13,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 47 states and 55 transitions. [2020-07-01 13:00:13,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-07-01 13:00:13,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-01 13:00:13,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2020-07-01 13:00:13,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:00:13,675 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-01 13:00:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2020-07-01 13:00:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2020-07-01 13:00:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 13:00:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-07-01 13:00:13,679 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-01 13:00:13,679 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-01 13:00:13,679 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 13:00:13,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-07-01 13:00:13,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 13:00:13,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:00:13,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:00:13,681 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:00:13,681 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:00:13,681 INFO L794 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY [103] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 426#L-1 [169] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 425#L9 [115] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 418#L9-1 [111] L9-1-->L11-2: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 419#L11-2 [91] L11-2-->L11: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 421#L11 [105] L11-->L12: Formula: (<= 0 |v_ULTIMATE.start_test_fun_#t~mem2_6|) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 430#L12 [124] L12-->L13-3: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6 (store (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 1))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 413#L13-3 [2020-07-01 13:00:13,682 INFO L796 eck$LassoCheckResult]: Loop: 413#L13-3 [128] L13-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 427#L13 [133] L13-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 432#L13-1 [132] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 433#L14 [98] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 436#L14-1 [159] L14-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem5_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 416#L18 [84] L18-->L18-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 412#L18-1 [227] L18-1-->L13-3: Formula: (and (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_25) v_ULTIMATE.start_test_fun_~y_ref~0.offset_18 (* |v_ULTIMATE.start_test_fun_#t~mem7_6| 2))) |v_#memory_int_23|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_18) (= 1 (select |v_#valid_43| v_ULTIMATE.start_test_fun_~y_ref~0.base_25)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_18 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~y_ref~0.base_25))) InVars {#valid=|v_#valid_43|, #memory_int=|v_#memory_int_24|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_25, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_43|, #memory_int=|v_#memory_int_23|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_25, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 413#L13-3 [2020-07-01 13:00:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash -680629265, now seen corresponding path program 1 times [2020-07-01 13:00:13,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:13,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028390231] [2020-07-01 13:00:13,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:13,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:00:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash -983145782, now seen corresponding path program 1 times [2020-07-01 13:00:13,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:13,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772837579] [2020-07-01 13:00:13,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:13,719 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:00:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash 122769180, now seen corresponding path program 1 times [2020-07-01 13:00:13,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:13,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767543226] [2020-07-01 13:00:13,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:13,748 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:00:13,991 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2020-07-01 13:00:14,066 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:00:14,067 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:00:14,067 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:00:14,067 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:00:14,067 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:00:14,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:00:14,067 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:00:14,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-07-01 13:00:14,068 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:00:14,068 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:00:14,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,260 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2020-07-01 13:00:14,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:00:14,622 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:00:14,622 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,627 INFO L120 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-07-01 13:00:14,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:14,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:14,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:14,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,663 INFO L120 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-07-01 13:00:14,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:14,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:14,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:14,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,700 INFO L120 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-07-01 13:00:14,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:14,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:14,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,739 INFO L120 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-07-01 13:00:14,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:14,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:14,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:14,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,776 INFO L120 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-07-01 13:00:14,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:14,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:14,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:14,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,813 INFO L120 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-07-01 13:00:14,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:14,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:14,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:14,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,851 INFO L120 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-07-01 13:00:14,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:14,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:14,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,890 INFO L120 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-07-01 13:00:14,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:14,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:14,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:14,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,927 INFO L120 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-07-01 13:00:14,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:14,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:14,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:14,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:14,963 INFO L120 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-07-01 13:00:14,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:14,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:00:14,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:14,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:14,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:14,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:00:14,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:00:14,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:15,000 INFO L120 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-07-01 13:00:15,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:15,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:15,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:15,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:15,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:15,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:15,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:15,043 INFO L120 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-07-01 13:00:15,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:15,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:15,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:15,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:15,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:15,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:15,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:15,100 INFO L120 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-07-01 13:00:15,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:00:15,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:00:15,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:00:15,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:00:15,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:00:15,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:00:15,120 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:00:15,135 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-01 13:00:15,136 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:00:15,138 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:00:15,141 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 13:00:15,141 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:00:15,142 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2020-07-01 13:00:15,205 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-07-01 13:00:15,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:00:15,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:00:15,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:15,229 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 13:00:15,229 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:00:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:15,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 13:00:15,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:00:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:15,414 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:00:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:15,422 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:00:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:15,429 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:00:15,429 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-07-01 13:00:15,430 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-07-01 13:00:15,430 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 8 states. [2020-07-01 13:00:15,601 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 32 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 41 states and 48 transitions. Complement of second has 14 states. [2020-07-01 13:00:15,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-07-01 13:00:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 13:00:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-01 13:00:15,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 7 letters. Loop has 7 letters. [2020-07-01 13:00:15,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:00:15,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 14 letters. Loop has 7 letters. [2020-07-01 13:00:15,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:00:15,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 7 letters. Loop has 14 letters. [2020-07-01 13:00:15,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:00:15,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2020-07-01 13:00:15,609 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:00:15,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-07-01 13:00:15,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 13:00:15,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 13:00:15,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 13:00:15,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:00:15,610 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:00:15,610 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:00:15,610 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:00:15,610 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 13:00:15,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:00:15,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:00:15,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 13:00:15,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:00:15 BasicIcfg [2020-07-01 13:00:15,617 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 13:00:15,618 INFO L168 Benchmark]: Toolchain (without parser) took 7461.57 ms. Allocated memory was 649.6 MB in the beginning and 850.4 MB in the end (delta: 200.8 MB). Free memory was 562.4 MB in the beginning and 697.4 MB in the end (delta: -135.0 MB). Peak memory consumption was 65.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:15,618 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:00:15,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.45 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 562.4 MB in the beginning and 652.0 MB in the end (delta: -89.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:15,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.72 ms. Allocated memory is still 689.4 MB. Free memory was 652.0 MB in the beginning and 649.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:15,620 INFO L168 Benchmark]: Boogie Preprocessor took 23.29 ms. Allocated memory is still 689.4 MB. Free memory was 649.8 MB in the beginning and 647.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:15,620 INFO L168 Benchmark]: RCFGBuilder took 354.48 ms. Allocated memory is still 689.4 MB. Free memory was 647.7 MB in the beginning and 620.1 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:15,620 INFO L168 Benchmark]: BlockEncodingV2 took 128.70 ms. Allocated memory is still 689.4 MB. Free memory was 620.1 MB in the beginning and 610.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:15,621 INFO L168 Benchmark]: TraceAbstraction took 1288.36 ms. Allocated memory is still 689.4 MB. Free memory was 609.3 MB in the beginning and 467.9 MB in the end (delta: 141.4 MB). Peak memory consumption was 141.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:15,621 INFO L168 Benchmark]: BuchiAutomizer took 5324.71 ms. Allocated memory was 689.4 MB in the beginning and 850.4 MB in the end (delta: 161.0 MB). Free memory was 467.9 MB in the beginning and 697.4 MB in the end (delta: -229.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:00:15,624 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 52 locations, 56 edges - StatisticsResult: Encoded RCFG 44 locations, 74 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 297.45 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 562.4 MB in the beginning and 652.0 MB in the end (delta: -89.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.72 ms. Allocated memory is still 689.4 MB. Free memory was 652.0 MB in the beginning and 649.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.29 ms. Allocated memory is still 689.4 MB. Free memory was 649.8 MB in the beginning and 647.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 354.48 ms. Allocated memory is still 689.4 MB. Free memory was 647.7 MB in the beginning and 620.1 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 128.70 ms. Allocated memory is still 689.4 MB. Free memory was 620.1 MB in the beginning and 610.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1288.36 ms. Allocated memory is still 689.4 MB. Free memory was 609.3 MB in the beginning and 467.9 MB in the end (delta: 141.4 MB). Peak memory consumption was 141.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5324.71 ms. Allocated memory was 689.4 MB in the beginning and 850.4 MB in the end (delta: 161.0 MB). Free memory was 467.9 MB in the beginning and 697.4 MB in the end (delta: -229.6 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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 13:00:15,632 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:15,632 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:15,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:15,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:15,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:15,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 == \valid[x_ref] && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 1 <= unknown-#StackHeapBarrier-unknown) && 4 == unknown-#length-unknown[y_ref]) && 1 == \valid[y_ref]) && 0 == x_ref - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 13:00:15,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:15,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:15,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:15,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:15,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:15,636 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 == \valid[x_ref] && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 1 <= unknown-#StackHeapBarrier-unknown) && 4 == unknown-#length-unknown[y_ref]) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 26 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 303 SDslu, 4 SDs, 0 SdLazy, 274 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 60 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 12 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.5s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 21 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 20 SDtfs, 514 SDslu, 61 SDs, 0 SdLazy, 580 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax100 hnf100 lsp97 ukn62 mio100 lsp37 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 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-07-01 13:00:04.897 ----------------------------------------------- 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/BenchExec_run_tSVDvg/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:00:16.062 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check