/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:49:21,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:49:21,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:49:21,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:49:21,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:49:21,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:49:21,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:49:21,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:49:21,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:49:21,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:49:21,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:49:21,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:49:21,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:49:21,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:49:21,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:49:21,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:49:21,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:49:21,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:49:21,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:49:21,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:49:21,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:49:21,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:49:21,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:49:21,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:49:21,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:49:21,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:49:21,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:49:21,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:49:21,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:49:21,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:49:21,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:49:21,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:49:21,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:49:21,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:49:21,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:49:21,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:49:21,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:49:21,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:49:21,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:49:21,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:49:21,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:49:21,840 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:49:21,855 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:49:21,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:49:21,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:49:21,856 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:49:21,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:49:21,857 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:49:21,857 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:49:21,857 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:49:21,857 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:49:21,857 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:49:21,857 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:49:21,858 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:49:21,858 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:49:21,858 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:49:21,858 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:49:21,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:49:21,858 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:49:21,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:49:21,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:49:21,859 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:49:21,859 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:49:21,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:49:21,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:49:21,860 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:49:21,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:49:21,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:49:21,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:49:21,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:49:21,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:49:22,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:49:22,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:49:22,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:49:22,039 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:49:22,040 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:49:22,041 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:49:22,101 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_qaX22O/tmp/177f70e56a2a408480f6a84390899538/FLAG1be0ea397 [2020-07-01 11:49:22,436 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:49:22,437 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:49:22,444 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_qaX22O/tmp/177f70e56a2a408480f6a84390899538/FLAG1be0ea397 [2020-07-01 11:49:22,831 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_qaX22O/tmp/177f70e56a2a408480f6a84390899538 [2020-07-01 11:49:22,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:49:22,844 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:49:22,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:49:22,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:49:22,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:49:22,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:49:22" (1/1) ... [2020-07-01 11:49:22,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6525f68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:22, skipping insertion in model container [2020-07-01 11:49:22,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:49:22" (1/1) ... [2020-07-01 11:49:22,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:49:22,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:49:23,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:49:23,110 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:49:23,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:49:23,141 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:49:23,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23 WrapperNode [2020-07-01 11:49:23,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:49:23,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:49:23,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:49:23,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:49:23,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:49:23,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:49:23,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:49:23,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:49:23,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:49:23,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:49:23,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:49:23,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:49:23,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 11:49:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2020-07-01 11:49:23,269 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2020-07-01 11:49:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2020-07-01 11:49:23,269 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2020-07-01 11:49:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:49:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:49:23,430 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:49:23,430 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-01 11:49:23,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:49:23 BoogieIcfgContainer [2020-07-01 11:49:23,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:49:23,435 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:49:23,435 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:49:23,437 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:49:23,438 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:49:23" (1/1) ... [2020-07-01 11:49:23,454 INFO L313 BlockEncoder]: Initial Icfg 20 locations, 24 edges [2020-07-01 11:49:23,456 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:49:23,456 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:49:23,457 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:49:23,457 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:49:23,459 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:49:23,460 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:49:23,460 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:49:23,473 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:49:23,480 INFO L200 BlockEncoder]: SBE split 0 edges [2020-07-01 11:49:23,485 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:49:23,487 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:49:23,500 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-07-01 11:49:23,502 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-07-01 11:49:23,504 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:49:23,504 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:49:23,504 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:49:23,505 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:49:23,505 INFO L313 BlockEncoder]: Encoded RCFG 16 locations, 20 edges [2020-07-01 11:49:23,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:49:23 BasicIcfg [2020-07-01 11:49:23,506 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:49:23,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:49:23,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:49:23,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:49:23,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:49:22" (1/4) ... [2020-07-01 11:49:23,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c477e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:49:23, skipping insertion in model container [2020-07-01 11:49:23,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (2/4) ... [2020-07-01 11:49:23,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c477e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:49:23, skipping insertion in model container [2020-07-01 11:49:23,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:49:23" (3/4) ... [2020-07-01 11:49:23,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c477e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:49:23, skipping insertion in model container [2020-07-01 11:49:23,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:49:23" (4/4) ... [2020-07-01 11:49:23,515 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:49:23,526 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:49:23,533 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 11:49:23,547 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 11:49:23,575 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:49:23,575 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:49:23,576 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:49:23,576 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:49:23,576 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:49:23,576 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:49:23,576 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:49:23,576 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:49:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-07-01 11:49:23,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:49:23,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-07-01 11:49:23,679 INFO L271 CegarLoopResult]: At program point rec1ENTRY(lines 5 9) the Hoare annotation is: true [2020-07-01 11:49:23,679 INFO L268 CegarLoopResult]: For program point rec1FINAL(lines 5 9) no Hoare annotation was computed. [2020-07-01 11:49:23,679 INFO L268 CegarLoopResult]: For program point rec1EXIT(lines 5 9) no Hoare annotation was computed. [2020-07-01 11:49:23,680 INFO L271 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-07-01 11:49:23,680 INFO L271 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-07-01 11:49:23,680 INFO L268 CegarLoopResult]: For program point L6(lines 6 7) no Hoare annotation was computed. [2020-07-01 11:49:23,680 INFO L268 CegarLoopResult]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-07-01 11:49:23,680 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-01 11:49:23,681 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-01 11:49:23,681 INFO L268 CegarLoopResult]: For program point L12(lines 12 13) no Hoare annotation was computed. [2020-07-01 11:49:23,681 INFO L268 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-07-01 11:49:23,681 INFO L271 CegarLoopResult]: At program point rec2ENTRY(lines 11 15) the Hoare annotation is: true [2020-07-01 11:49:23,682 INFO L268 CegarLoopResult]: For program point rec2FINAL(lines 11 15) no Hoare annotation was computed. [2020-07-01 11:49:23,682 INFO L268 CegarLoopResult]: For program point rec2EXIT(lines 11 15) no Hoare annotation was computed. [2020-07-01 11:49:23,682 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:49:23,682 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-01 11:49:23,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:49:23 BasicIcfg [2020-07-01 11:49:23,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:49:23,687 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:49:23,688 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:49:23,692 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:49:23,693 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:49:23,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:49:22" (1/5) ... [2020-07-01 11:49:23,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bffe25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:49:23, skipping insertion in model container [2020-07-01 11:49:23,694 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:49:23,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:49:23" (2/5) ... [2020-07-01 11:49:23,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bffe25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:49:23, skipping insertion in model container [2020-07-01 11:49:23,695 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:49:23,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:49:23" (3/5) ... [2020-07-01 11:49:23,695 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bffe25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:49:23, skipping insertion in model container [2020-07-01 11:49:23,695 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:49:23,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:49:23" (4/5) ... [2020-07-01 11:49:23,696 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bffe25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:49:23, skipping insertion in model container [2020-07-01 11:49:23,696 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:49:23,696 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:49:23" (5/5) ... [2020-07-01 11:49:23,698 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:49:23,725 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:49:23,725 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:49:23,725 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:49:23,725 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:49:23,725 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:49:23,726 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:49:23,726 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:49:23,726 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:49:23,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-01 11:49:23,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 11:49:23,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:49:23,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:49:23,759 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:49:23,759 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 11:49:23,759 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:49:23,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-01 11:49:23,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 11:49:23,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:49:23,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:49:23,762 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:49:23,762 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 11:49:23,767 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [47] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 10#L19true [45] L19-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_3|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue [2020-07-01 11:49:23,768 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 4#L12true [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 8#L14true [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue [2020-07-01 11:49:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2463, now seen corresponding path program 1 times [2020-07-01 11:49:23,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:23,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439199790] [2020-07-01 11:49:23,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:23,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:49:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash 65297, now seen corresponding path program 1 times [2020-07-01 11:49:23,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:23,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172846661] [2020-07-01 11:49:23,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:23,868 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:49:23,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash 73410739, now seen corresponding path program 1 times [2020-07-01 11:49:23,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:23,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572695828] [2020-07-01 11:49:23,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:23,880 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:49:23,956 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:49:23,957 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:49:23,957 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:49:23,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:49:23,957 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:49:23,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:49:23,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:49:23,958 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:49:23,958 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:49:23,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:49:23,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:49:23,974 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 11:49:23,982 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 11:49:23,985 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 11:49:23,988 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 11:49:23,998 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 11:49:24,061 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:49:24,062 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:24,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:24,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:24,079 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:24,080 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:24,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:24,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:24,118 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:24,118 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret2=0} Honda state: {rec2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:24,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:24,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:24,158 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:24,158 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:24,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:24,190 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:24,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:49:24,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:24,263 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:49:24,265 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:49:24,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:49:24,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:49:24,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:49:24,266 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:49:24,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:49:24,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:49:24,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:49:24,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:49:24,267 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:49:24,267 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:49:24,268 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 11:49:24,272 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 11:49:24,276 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 11:49:24,279 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 11:49:24,287 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 11:49:24,323 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:49:24,329 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/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 11:49:24,348 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 11:49:24,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:49:24,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:49:24,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:49:24,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:49:24,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:49:24,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:49:24,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:49:24,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/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 11:49:24,390 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 11:49:24,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:49:24,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:49:24,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:49:24,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:49:24,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:49:24,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:49:24,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:49:24,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/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 11:49:24,429 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 11:49:24,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:49:24,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:49:24,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:49:24,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:49:24,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:49:24,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:49:24,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:49:24,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/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 11:49:24,467 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 11:49:24,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:49:24,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:49:24,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:49:24,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:49:24,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:49:24,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:49:24,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:49:24,474 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:49:24,479 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:49:24,480 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox2/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 11:49:24,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:49:24,486 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:49:24,486 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:49:24,487 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2020-07-01 11:49:24,521 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:49:24,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:24,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:49:24,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:49:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:24,592 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:49:24,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:49:24,628 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 11:49:24,655 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 11:49:24,661 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 3 loop predicates [2020-07-01 11:49:24,662 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states. Second operand 4 states. [2020-07-01 11:49:24,760 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states.. Second operand 4 states. Result 38 states and 48 transitions. Complement of second has 16 states. [2020-07-01 11:49:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-01 11:49:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 11:49:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-01 11:49:24,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-01 11:49:24,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:49:24,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-01 11:49:24,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:49:24,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-01 11:49:24,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:49:24,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2020-07-01 11:49:24,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 11:49:24,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 36 transitions. [2020-07-01 11:49:24,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-07-01 11:49:24,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-07-01 11:49:24,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2020-07-01 11:49:24,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:49:24,792 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-01 11:49:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2020-07-01 11:49:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-07-01 11:49:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 11:49:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-01 11:49:24,828 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-01 11:49:24,828 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-01 11:49:24,828 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 11:49:24,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2020-07-01 11:49:24,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 11:49:24,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:49:24,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:49:24,831 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:49:24,831 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 11:49:24,831 INFO L794 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 111#L19 [45] L19-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_3|} AuxVars[] AssignedVars[rec2_#in~j]< 110#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 112#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 115#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 113#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 117#L12 [36] L12-->rec2FINAL: Formula: (and (= |v_rec2_#res_2| 0) (<= v_rec2_~j_2 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 118#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 131#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 125#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 123#rec1ENTRY [2020-07-01 11:49:24,832 INFO L796 eck$LassoCheckResult]: Loop: 123#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 127#L6 [60] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 126#L8 [49] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 1)) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 123#rec1ENTRY [2020-07-01 11:49:24,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:24,832 INFO L82 PathProgramCache]: Analyzing trace with hash 753569552, now seen corresponding path program 1 times [2020-07-01 11:49:24,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:24,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918219226] [2020-07-01 11:49:24,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:24,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:49:24,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:24,849 INFO L82 PathProgramCache]: Analyzing trace with hash 69179, now seen corresponding path program 1 times [2020-07-01 11:49:24,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:24,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757985947] [2020-07-01 11:49:24,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:24,858 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:49:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash -203493172, now seen corresponding path program 1 times [2020-07-01 11:49:24,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:24,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724980226] [2020-07-01 11:49:24,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 11:49:24,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724980226] [2020-07-01 11:49:24,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:49:24,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 11:49:24,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402023283] [2020-07-01 11:49:24,968 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:49:24,968 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:49:24,968 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:49:24,968 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:49:24,969 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:49:24,969 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:49:24,969 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:49:24,969 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:49:24,969 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:49:24,970 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:49:24,970 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:49:24,971 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 11:49:24,978 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 11:49:24,981 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 11:49:24,986 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 11:49:24,989 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 11:49:25,025 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:49:25,025 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,029 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:49:25,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:25,091 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:25,091 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#in~i=1} Honda state: {rec1_#in~i=1} Generalized eigenvectors: [{rec1_#in~i=0}, {rec1_#in~i=0}, {rec1_#in~i=1}] Lambdas: [8, 1, 1] Nus: [1, 0] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:25,131 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:25,131 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:25,169 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:25,169 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:25,209 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:25,210 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:25,247 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:25,247 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-07-01 11:49:25,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:49:25,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:49:25,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:49:25,281 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-07-01 11:49:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:49:25,342 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-01 11:49:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 11:49:25,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2020-07-01 11:49:25,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 11:49:25,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 44 transitions. [2020-07-01 11:49:25,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-07-01 11:49:25,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-07-01 11:49:25,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2020-07-01 11:49:25,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:49:25,352 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-07-01 11:49:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2020-07-01 11:49:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-01 11:49:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 11:49:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-07-01 11:49:25,358 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-07-01 11:49:25,358 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-07-01 11:49:25,358 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 11:49:25,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 40 transitions. [2020-07-01 11:49:25,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 11:49:25,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:49:25,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:49:25,361 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:49:25,362 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:49:25,362 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 190#L19 [45] L19-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_3|} AuxVars[] AssignedVars[rec2_#in~j]< 189#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 191#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 193#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 192#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 195#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 194#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 192#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 196#L12 [36] L12-->rec2FINAL: Formula: (and (= |v_rec2_#res_2| 0) (<= v_rec2_~j_2 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 197#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 210#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 203#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 202#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 204#L6 [50] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 214#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 211#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 198#L14-2 [38] L14-2-->rec2FINAL: Formula: (= |v_rec2_#res_1| |v_rec2_#t~ret3_2|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_1|, rec2_#t~ret3=|v_rec2_#t~ret3_1|, rec2_#res=|v_rec2_#res_1|} AuxVars[] AssignedVars[rec2_#t~ret2, rec2_#t~ret3, rec2_#res] 201#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 220#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 206#L14-1 [2020-07-01 11:49:25,363 INFO L796 eck$LassoCheckResult]: Loop: 206#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 213#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 218#L6 [60] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 207#L8 [49] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 1)) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 213#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 218#L6 [50] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 205#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 208#rec1EXIT >[56] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 1)) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 200#L8-1 [48] L8-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec1_#t~ret0_5|) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 209#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 216#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 199#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 209#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 216#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 199#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 209#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 216#L12 [36] L12-->rec2FINAL: Formula: (and (= |v_rec2_#res_2| 0) (<= v_rec2_~j_2 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 217#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 219#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 203#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 202#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 204#L6 [50] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 214#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 211#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 198#L14-2 [38] L14-2-->rec2FINAL: Formula: (= |v_rec2_#res_1| |v_rec2_#t~ret3_2|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_1|, rec2_#t~ret3=|v_rec2_#t~ret3_1|, rec2_#res=|v_rec2_#res_1|} AuxVars[] AssignedVars[rec2_#t~ret2, rec2_#t~ret3, rec2_#res] 201#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 220#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 206#L14-1 [2020-07-01 11:49:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash -40851153, now seen corresponding path program 1 times [2020-07-01 11:49:25,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:25,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982170144] [2020-07-01 11:49:25,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:25,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:49:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash -950623466, now seen corresponding path program 1 times [2020-07-01 11:49:25,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:25,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784553981] [2020-07-01 11:49:25,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 11:49:25,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784553981] [2020-07-01 11:49:25,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273768263] [2020-07-01 11:49:25,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:49:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:49:25,501 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:49:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 11:49:25,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:49:25,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2020-07-01 11:49:25,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000466689] [2020-07-01 11:49:25,526 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:49:25,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:49:25,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:49:25,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:49:25,527 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-01 11:49:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:49:25,563 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-01 11:49:25,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:49:25,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2020-07-01 11:49:25,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 11:49:25,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 28 transitions. [2020-07-01 11:49:25,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-01 11:49:25,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-01 11:49:25,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2020-07-01 11:49:25,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:49:25,569 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-01 11:49:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2020-07-01 11:49:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 11:49:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 11:49:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-01 11:49:25,573 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-01 11:49:25,573 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-01 11:49:25,573 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 11:49:25,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2020-07-01 11:49:25,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 11:49:25,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:49:25,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:49:25,575 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:49:25,575 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 11:49:25,576 INFO L794 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 365#L19 [45] L19-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_3|} AuxVars[] AssignedVars[rec2_#in~j]< 364#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 366#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 368#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 367#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 370#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 369#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 367#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 371#L12 [36] L12-->rec2FINAL: Formula: (and (= |v_rec2_#res_2| 0) (<= v_rec2_~j_2 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 372#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 388#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 376#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 375#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 377#L6 [50] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 386#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 373#L14-2 [38] L14-2-->rec2FINAL: Formula: (= |v_rec2_#res_1| |v_rec2_#t~ret3_2|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_1|, rec2_#t~ret3=|v_rec2_#t~ret3_1|, rec2_#res=|v_rec2_#res_1|} AuxVars[] AssignedVars[rec2_#t~ret2, rec2_#t~ret3, rec2_#res] 374#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 382#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 379#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 385#rec1ENTRY [2020-07-01 11:49:25,576 INFO L796 eck$LassoCheckResult]: Loop: 385#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 387#L6 [60] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 380#L8 [49] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 1)) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 385#rec1ENTRY [2020-07-01 11:49:25,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:25,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1266385697, now seen corresponding path program 2 times [2020-07-01 11:49:25,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:25,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642157406] [2020-07-01 11:49:25,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:25,595 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:49:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 69179, now seen corresponding path program 2 times [2020-07-01 11:49:25,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:25,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919741520] [2020-07-01 11:49:25,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:49:25,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:49:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:49:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash 96468125, now seen corresponding path program 1 times [2020-07-01 11:49:25,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:49:25,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603821003] [2020-07-01 11:49:25,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:49:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:49:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 11:49:25,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603821003] [2020-07-01 11:49:25,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:49:25,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 11:49:25,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745561805] [2020-07-01 11:49:25,722 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:49:25,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:49:25,736 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:49:25,736 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:49:25,736 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:49:25,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,737 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:49:25,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:49:25,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-07-01 11:49:25,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:49:25,738 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:49:25,740 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 11:49:25,754 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 11:49:25,756 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 11:49:25,762 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 11:49:25,766 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 11:49:25,812 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:49:25,812 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:25,825 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:25,825 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:25,861 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:25,862 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:25,898 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:25,898 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:25,934 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:25,934 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:25,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:49:25,968 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -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:4560 -smt2 -in -t:12000 [2020-07-01 11:49:26,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:49:26,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:49:26,027 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:49:26,027 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#in~i=1} Honda state: {rec1_#in~i=1} Generalized eigenvectors: [{rec1_#in~i=0}, {rec1_#in~i=0}, {rec1_#in~i=1}] Lambdas: [8, 1, 1] Nus: [1, 0] [2020-07-01 11:49:26,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:49:26,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:49:26,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:49:26,057 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-07-01 11:49:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:49:26,111 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-01 11:49:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:49:26,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2020-07-01 11:49:26,114 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:49:26,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2020-07-01 11:49:26,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 11:49:26,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 11:49:26,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 11:49:26,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:49:26,115 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:49:26,115 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:49:26,115 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:49:26,115 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 11:49:26,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:49:26,115 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:49:26,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 11:49:26,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:49:26 BasicIcfg [2020-07-01 11:49:26,122 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 11:49:26,124 INFO L168 Benchmark]: Toolchain (without parser) took 3279.65 ms. Allocated memory was 649.6 MB in the beginning and 761.8 MB in the end (delta: 112.2 MB). Free memory was 556.1 MB in the beginning and 672.3 MB in the end (delta: -116.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:49:26,125 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:49:26,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.82 ms. Allocated memory was 649.6 MB in the beginning and 697.8 MB in the end (delta: 48.2 MB). Free memory was 556.1 MB in the beginning and 661.2 MB in the end (delta: -105.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:49:26,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.56 ms. Allocated memory is still 697.8 MB. Free memory was 661.2 MB in the beginning and 659.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:49:26,126 INFO L168 Benchmark]: Boogie Preprocessor took 17.10 ms. Allocated memory is still 697.8 MB. Free memory was 659.8 MB in the beginning and 658.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:49:26,127 INFO L168 Benchmark]: RCFGBuilder took 239.67 ms. Allocated memory is still 697.8 MB. Free memory was 658.5 MB in the beginning and 642.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:49:26,127 INFO L168 Benchmark]: BlockEncodingV2 took 71.10 ms. Allocated memory is still 697.8 MB. Free memory was 642.8 MB in the beginning and 636.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:49:26,128 INFO L168 Benchmark]: TraceAbstraction took 179.50 ms. Allocated memory is still 697.8 MB. Free memory was 636.4 MB in the beginning and 624.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:49:26,128 INFO L168 Benchmark]: BuchiAutomizer took 2434.78 ms. Allocated memory was 697.8 MB in the beginning and 761.8 MB in the end (delta: 64.0 MB). Free memory was 624.1 MB in the beginning and 672.3 MB in the end (delta: -48.2 MB). Peak memory consumption was 15.8 MB. Max. memory is 50.3 GB. [2020-07-01 11:49:26,132 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 20 locations, 24 edges - StatisticsResult: Encoded RCFG 16 locations, 20 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 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 296.82 ms. Allocated memory was 649.6 MB in the beginning and 697.8 MB in the end (delta: 48.2 MB). Free memory was 556.1 MB in the beginning and 661.2 MB in the end (delta: -105.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.56 ms. Allocated memory is still 697.8 MB. Free memory was 661.2 MB in the beginning and 659.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 17.10 ms. Allocated memory is still 697.8 MB. Free memory was 659.8 MB in the beginning and 658.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 239.67 ms. Allocated memory is still 697.8 MB. Free memory was 658.5 MB in the beginning and 642.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 71.10 ms. Allocated memory is still 697.8 MB. Free memory was 642.8 MB in the beginning and 636.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 179.50 ms. Allocated memory is still 697.8 MB. Free memory was 636.4 MB in the beginning and 624.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2434.78 ms. Allocated memory was 697.8 MB in the beginning and 761.8 MB in the end (delta: 64.0 MB). Free memory was 624.1 MB in the beginning and 672.3 MB in the end (delta: -48.2 MB). Peak memory consumption was 15.8 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 16 locations, 0 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 16 PreInvPairs, 16 NumberOfFragments, 7 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function \old(j) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 58 SDtfs, 41 SDslu, 156 SDs, 0 SdLazy, 87 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 11:49:19.608 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp/BenchExec_run_qaX22O/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:49:26.564 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check