/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:40:33,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:40:33,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:40:33,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:40:33,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:40:33,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:40:33,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:40:33,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:40:33,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:40:33,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:40:33,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:40:33,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:40:33,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:40:33,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:40:33,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:40:33,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:40:33,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:40:33,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:40:33,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:40:33,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:40:33,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:40:33,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:40:33,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:40:33,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:40:33,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:40:33,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:40:33,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:40:33,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:40:33,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:40:33,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:40:33,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:40:33,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:40:33,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:40:33,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:40:33,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:40:33,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:40:33,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:40:33,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:40:33,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:40:33,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:40:33,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:40:33,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:40:33,596 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:40:33,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:40:33,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:40:33,598 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:40:33,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:40:33,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:40:33,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:40:33,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:40:33,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:40:33,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:40:33,604 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:40:33,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:40:33,604 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:40:33,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:40:33,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:40:33,605 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:40:33,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:40:33,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:40:33,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:40:33,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:40:33,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:40:33,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:40:33,606 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:40:33,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:40:33,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:40:33,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:40:33,914 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:40:33,914 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:40:33,915 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005.i [2020-07-08 23:40:33,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c913a4c/06106b81d66d4e09b9c838366649c009/FLAG0f76532a1 [2020-07-08 23:40:34,463 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:40:34,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i [2020-07-08 23:40:34,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c913a4c/06106b81d66d4e09b9c838366649c009/FLAG0f76532a1 [2020-07-08 23:40:34,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c913a4c/06106b81d66d4e09b9c838366649c009 [2020-07-08 23:40:34,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:40:34,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:40:34,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:40:34,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:40:34,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:40:34,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:40:34" (1/1) ... [2020-07-08 23:40:34,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9b0210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:34, skipping insertion in model container [2020-07-08 23:40:34,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:40:34" (1/1) ... [2020-07-08 23:40:34,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:40:34,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:40:35,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:40:35,026 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:40:35,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:40:35,057 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:40:35,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35 WrapperNode [2020-07-08 23:40:35,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:40:35,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:40:35,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:40:35,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:40:35,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35" (1/1) ... [2020-07-08 23:40:35,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35" (1/1) ... [2020-07-08 23:40:35,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35" (1/1) ... [2020-07-08 23:40:35,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35" (1/1) ... [2020-07-08 23:40:35,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35" (1/1) ... [2020-07-08 23:40:35,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35" (1/1) ... [2020-07-08 23:40:35,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35" (1/1) ... [2020-07-08 23:40:35,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:40:35,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:40:35,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:40:35,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:40:35,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:40:35,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:40:35,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:40:35,255 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:40:35,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:40:35,255 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:40:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:40:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:40:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:40:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:40:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:40:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:40:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:40:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:40:35,474 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:40:35,474 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 23:40:35,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:40:35 BoogieIcfgContainer [2020-07-08 23:40:35,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:40:35,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:40:35,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:40:35,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:40:35,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:40:34" (1/3) ... [2020-07-08 23:40:35,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d627ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:40:35, skipping insertion in model container [2020-07-08 23:40:35,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:35" (2/3) ... [2020-07-08 23:40:35,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d627ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:40:35, skipping insertion in model container [2020-07-08 23:40:35,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:40:35" (3/3) ... [2020-07-08 23:40:35,488 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005.i [2020-07-08 23:40:35,506 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:40:35,516 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:40:35,530 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:40:35,557 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:40:35,558 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:40:35,558 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:40:35,558 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:40:35,558 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:40:35,558 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:40:35,559 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:40:35,559 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:40:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-08 23:40:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 23:40:35,610 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:35,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:35,614 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:35,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:35,623 INFO L82 PathProgramCache]: Analyzing trace with hash -714485069, now seen corresponding path program 1 times [2020-07-08 23:40:35,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:35,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [437729510] [2020-07-08 23:40:35,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:35,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-08 23:40:35,839 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #46#return; {26#true} is VALID [2020-07-08 23:40:35,841 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-08 23:40:35,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-08 23:40:35,842 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #46#return; {26#true} is VALID [2020-07-08 23:40:35,842 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret0 := main(); {26#true} is VALID [2020-07-08 23:40:35,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~i~0; {26#true} is VALID [2020-07-08 23:40:35,843 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~j~0; {26#true} is VALID [2020-07-08 23:40:35,845 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} ~i~0 := 1; {30#(<= main_~i~0 1)} is VALID [2020-07-08 23:40:35,846 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#(<= main_~i~0 1)} ~j~0 := 10; {31#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 23:40:35,851 INFO L280 TraceCheckUtils]: 8: Hoare triple {31#(<= (+ main_~i~0 9) main_~j~0)} assume !(~j~0 >= ~i~0); {27#false} is VALID [2020-07-08 23:40:35,852 INFO L263 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {27#false} is VALID [2020-07-08 23:40:35,852 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-08 23:40:35,852 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-08 23:40:35,853 INFO L280 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-08 23:40:35,854 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-08 23:40:35,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [437729510] [2020-07-08 23:40:35,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:35,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:40:35,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195643196] [2020-07-08 23:40:35,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-08 23:40:35,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:35,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:40:35,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:35,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:40:35,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:35,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:40:35,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:40:35,917 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2020-07-08 23:40:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:36,104 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-08 23:40:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:40:36,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-08 23:40:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:40:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-08 23:40:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:40:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-08 23:40:36,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2020-07-08 23:40:36,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:36,253 INFO L225 Difference]: With dead ends: 37 [2020-07-08 23:40:36,254 INFO L226 Difference]: Without dead ends: 18 [2020-07-08 23:40:36,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:40:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-08 23:40:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-08 23:40:36,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:36,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-08 23:40:36,320 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-08 23:40:36,320 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-08 23:40:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:36,323 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-08 23:40:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-08 23:40:36,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:36,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:36,325 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-08 23:40:36,325 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-08 23:40:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:36,328 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-08 23:40:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-08 23:40:36,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:36,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:36,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:36,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 23:40:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-08 23:40:36,333 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2020-07-08 23:40:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:36,334 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-08 23:40:36,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:40:36,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2020-07-08 23:40:36,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-08 23:40:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 23:40:36,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:36,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:36,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:40:36,365 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:36,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash 673132007, now seen corresponding path program 1 times [2020-07-08 23:40:36,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:36,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [509432636] [2020-07-08 23:40:36,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:36,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-08 23:40:36,465 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2020-07-08 23:40:36,466 INFO L263 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2020-07-08 23:40:36,466 INFO L280 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-08 23:40:36,466 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2020-07-08 23:40:36,467 INFO L263 TraceCheckUtils]: 3: Hoare triple {180#true} call #t~ret0 := main(); {180#true} is VALID [2020-07-08 23:40:36,467 INFO L280 TraceCheckUtils]: 4: Hoare triple {180#true} havoc ~i~0; {180#true} is VALID [2020-07-08 23:40:36,467 INFO L280 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~j~0; {180#true} is VALID [2020-07-08 23:40:36,469 INFO L280 TraceCheckUtils]: 6: Hoare triple {180#true} ~i~0 := 1; {184#(<= main_~i~0 1)} is VALID [2020-07-08 23:40:36,470 INFO L280 TraceCheckUtils]: 7: Hoare triple {184#(<= main_~i~0 1)} ~j~0 := 10; {185#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 23:40:36,471 INFO L280 TraceCheckUtils]: 8: Hoare triple {185#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0); {185#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 23:40:36,472 INFO L280 TraceCheckUtils]: 9: Hoare triple {185#(<= (+ main_~i~0 9) main_~j~0)} ~i~0 := 2 + ~i~0; {186#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 23:40:36,474 INFO L280 TraceCheckUtils]: 10: Hoare triple {186#(<= (+ main_~i~0 7) main_~j~0)} ~j~0 := -1 + ~j~0; {187#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-08 23:40:36,475 INFO L280 TraceCheckUtils]: 11: Hoare triple {187#(<= (+ main_~i~0 6) main_~j~0)} assume !(~j~0 >= ~i~0); {181#false} is VALID [2020-07-08 23:40:36,475 INFO L263 TraceCheckUtils]: 12: Hoare triple {181#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {181#false} is VALID [2020-07-08 23:40:36,476 INFO L280 TraceCheckUtils]: 13: Hoare triple {181#false} ~cond := #in~cond; {181#false} is VALID [2020-07-08 23:40:36,476 INFO L280 TraceCheckUtils]: 14: Hoare triple {181#false} assume 0 == ~cond; {181#false} is VALID [2020-07-08 23:40:36,476 INFO L280 TraceCheckUtils]: 15: Hoare triple {181#false} assume !false; {181#false} is VALID [2020-07-08 23:40:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:36,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [509432636] [2020-07-08 23:40:36,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:36,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 23:40:36,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560707394] [2020-07-08 23:40:36,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 23:40:36,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:36,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 23:40:36,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:36,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 23:40:36,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:36,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 23:40:36,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:40:36,510 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2020-07-08 23:40:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:36,664 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-08 23:40:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:40:36,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 23:40:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:40:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-08 23:40:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:40:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-08 23:40:36,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-08 23:40:36,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:36,714 INFO L225 Difference]: With dead ends: 26 [2020-07-08 23:40:36,715 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 23:40:36,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:40:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 23:40:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-08 23:40:36,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:36,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2020-07-08 23:40:36,744 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2020-07-08 23:40:36,745 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2020-07-08 23:40:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:36,747 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-08 23:40:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-08 23:40:36,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:36,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:36,750 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2020-07-08 23:40:36,750 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2020-07-08 23:40:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:36,754 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-08 23:40:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-08 23:40:36,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:36,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:36,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:36,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 23:40:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-08 23:40:36,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2020-07-08 23:40:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:36,760 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-08 23:40:36,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 23:40:36,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2020-07-08 23:40:36,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-08 23:40:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 23:40:36,788 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:36,789 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:36,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:40:36,790 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash 113219123, now seen corresponding path program 2 times [2020-07-08 23:40:36,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:36,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [738038874] [2020-07-08 23:40:36,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:36,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-08 23:40:36,936 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {326#true} {326#true} #46#return; {326#true} is VALID [2020-07-08 23:40:36,937 INFO L263 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2020-07-08 23:40:36,937 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-08 23:40:36,937 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {326#true} {326#true} #46#return; {326#true} is VALID [2020-07-08 23:40:36,938 INFO L263 TraceCheckUtils]: 3: Hoare triple {326#true} call #t~ret0 := main(); {326#true} is VALID [2020-07-08 23:40:36,938 INFO L280 TraceCheckUtils]: 4: Hoare triple {326#true} havoc ~i~0; {326#true} is VALID [2020-07-08 23:40:36,938 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#true} havoc ~j~0; {326#true} is VALID [2020-07-08 23:40:36,939 INFO L280 TraceCheckUtils]: 6: Hoare triple {326#true} ~i~0 := 1; {330#(<= main_~i~0 1)} is VALID [2020-07-08 23:40:36,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {330#(<= main_~i~0 1)} ~j~0 := 10; {331#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 23:40:36,941 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0); {331#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 23:40:36,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= (+ main_~i~0 9) main_~j~0)} ~i~0 := 2 + ~i~0; {332#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 23:40:36,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {332#(<= (+ main_~i~0 7) main_~j~0)} ~j~0 := -1 + ~j~0; {333#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-08 23:40:36,945 INFO L280 TraceCheckUtils]: 11: Hoare triple {333#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0); {333#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-08 23:40:36,946 INFO L280 TraceCheckUtils]: 12: Hoare triple {333#(<= (+ main_~i~0 6) main_~j~0)} ~i~0 := 2 + ~i~0; {334#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-08 23:40:36,947 INFO L280 TraceCheckUtils]: 13: Hoare triple {334#(<= (+ main_~i~0 4) main_~j~0)} ~j~0 := -1 + ~j~0; {335#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-08 23:40:36,948 INFO L280 TraceCheckUtils]: 14: Hoare triple {335#(<= (+ main_~i~0 3) main_~j~0)} assume !(~j~0 >= ~i~0); {327#false} is VALID [2020-07-08 23:40:36,949 INFO L263 TraceCheckUtils]: 15: Hoare triple {327#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {327#false} is VALID [2020-07-08 23:40:36,949 INFO L280 TraceCheckUtils]: 16: Hoare triple {327#false} ~cond := #in~cond; {327#false} is VALID [2020-07-08 23:40:36,949 INFO L280 TraceCheckUtils]: 17: Hoare triple {327#false} assume 0 == ~cond; {327#false} is VALID [2020-07-08 23:40:36,950 INFO L280 TraceCheckUtils]: 18: Hoare triple {327#false} assume !false; {327#false} is VALID [2020-07-08 23:40:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:36,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [738038874] [2020-07-08 23:40:36,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:36,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 23:40:36,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647140830] [2020-07-08 23:40:36,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-08 23:40:36,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:36,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:40:36,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:36,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:40:36,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:40:36,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:40:36,978 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2020-07-08 23:40:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:37,154 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-08 23:40:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 23:40:37,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-08 23:40:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:40:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-08 23:40:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:40:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-08 23:40:37,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-08 23:40:37,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:37,193 INFO L225 Difference]: With dead ends: 29 [2020-07-08 23:40:37,193 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 23:40:37,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:40:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 23:40:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-08 23:40:37,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:37,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-08 23:40:37,213 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-08 23:40:37,213 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-08 23:40:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:37,215 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-08 23:40:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-08 23:40:37,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:37,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:37,217 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-08 23:40:37,217 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-08 23:40:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:37,219 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-08 23:40:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-08 23:40:37,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:37,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:37,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:37,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 23:40:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-08 23:40:37,222 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2020-07-08 23:40:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:37,223 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-08 23:40:37,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:40:37,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2020-07-08 23:40:37,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-08 23:40:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 23:40:37,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:37,252 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:37,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:40:37,253 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:37,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:37,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1401469543, now seen corresponding path program 3 times [2020-07-08 23:40:37,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:37,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [510460552] [2020-07-08 23:40:37,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:37,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {492#true} assume true; {492#true} is VALID [2020-07-08 23:40:37,404 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {492#true} {492#true} #46#return; {492#true} is VALID [2020-07-08 23:40:37,404 INFO L263 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2020-07-08 23:40:37,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {492#true} assume true; {492#true} is VALID [2020-07-08 23:40:37,405 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {492#true} {492#true} #46#return; {492#true} is VALID [2020-07-08 23:40:37,405 INFO L263 TraceCheckUtils]: 3: Hoare triple {492#true} call #t~ret0 := main(); {492#true} is VALID [2020-07-08 23:40:37,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {492#true} havoc ~i~0; {492#true} is VALID [2020-07-08 23:40:37,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {492#true} havoc ~j~0; {492#true} is VALID [2020-07-08 23:40:37,407 INFO L280 TraceCheckUtils]: 6: Hoare triple {492#true} ~i~0 := 1; {496#(<= main_~i~0 1)} is VALID [2020-07-08 23:40:37,408 INFO L280 TraceCheckUtils]: 7: Hoare triple {496#(<= main_~i~0 1)} ~j~0 := 10; {497#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 23:40:37,409 INFO L280 TraceCheckUtils]: 8: Hoare triple {497#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0); {497#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 23:40:37,410 INFO L280 TraceCheckUtils]: 9: Hoare triple {497#(<= (+ main_~i~0 9) main_~j~0)} ~i~0 := 2 + ~i~0; {498#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 23:40:37,411 INFO L280 TraceCheckUtils]: 10: Hoare triple {498#(<= (+ main_~i~0 7) main_~j~0)} ~j~0 := -1 + ~j~0; {499#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-08 23:40:37,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {499#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0); {499#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-08 23:40:37,413 INFO L280 TraceCheckUtils]: 12: Hoare triple {499#(<= (+ main_~i~0 6) main_~j~0)} ~i~0 := 2 + ~i~0; {500#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-08 23:40:37,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {500#(<= (+ main_~i~0 4) main_~j~0)} ~j~0 := -1 + ~j~0; {501#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-08 23:40:37,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {501#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0); {501#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-08 23:40:37,416 INFO L280 TraceCheckUtils]: 15: Hoare triple {501#(<= (+ main_~i~0 3) main_~j~0)} ~i~0 := 2 + ~i~0; {502#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-08 23:40:37,417 INFO L280 TraceCheckUtils]: 16: Hoare triple {502#(<= (+ main_~i~0 1) main_~j~0)} ~j~0 := -1 + ~j~0; {503#(<= main_~i~0 main_~j~0)} is VALID [2020-07-08 23:40:37,418 INFO L280 TraceCheckUtils]: 17: Hoare triple {503#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {493#false} is VALID [2020-07-08 23:40:37,418 INFO L263 TraceCheckUtils]: 18: Hoare triple {493#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {493#false} is VALID [2020-07-08 23:40:37,418 INFO L280 TraceCheckUtils]: 19: Hoare triple {493#false} ~cond := #in~cond; {493#false} is VALID [2020-07-08 23:40:37,419 INFO L280 TraceCheckUtils]: 20: Hoare triple {493#false} assume 0 == ~cond; {493#false} is VALID [2020-07-08 23:40:37,419 INFO L280 TraceCheckUtils]: 21: Hoare triple {493#false} assume !false; {493#false} is VALID [2020-07-08 23:40:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:37,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [510460552] [2020-07-08 23:40:37,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:37,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 23:40:37,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272427736] [2020-07-08 23:40:37,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-08 23:40:37,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:37,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 23:40:37,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:37,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 23:40:37,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:37,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 23:40:37,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:40:37,472 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2020-07-08 23:40:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:37,695 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 23:40:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 23:40:37,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-08 23:40:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:40:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-08 23:40:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:40:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-08 23:40:37,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-08 23:40:37,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:37,742 INFO L225 Difference]: With dead ends: 31 [2020-07-08 23:40:37,742 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 23:40:37,743 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:40:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 23:40:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-08 23:40:37,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:37,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-08 23:40:37,766 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-08 23:40:37,766 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-08 23:40:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:37,768 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-08 23:40:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-08 23:40:37,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:37,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:37,769 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-08 23:40:37,770 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-08 23:40:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:37,772 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-08 23:40:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-08 23:40:37,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:37,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:37,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:37,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 23:40:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-08 23:40:37,775 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2020-07-08 23:40:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:37,775 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-08 23:40:37,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 23:40:37,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2020-07-08 23:40:37,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-08 23:40:37,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 23:40:37,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:37,826 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:37,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:40:37,827 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:37,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:37,827 INFO L82 PathProgramCache]: Analyzing trace with hash -158025293, now seen corresponding path program 4 times [2020-07-08 23:40:37,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:37,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022910318] [2020-07-08 23:40:37,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:38,049 INFO L280 TraceCheckUtils]: 0: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-08 23:40:38,049 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {674#true} {674#true} #46#return; {674#true} is VALID [2020-07-08 23:40:38,050 INFO L263 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {674#true} is VALID [2020-07-08 23:40:38,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-08 23:40:38,050 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {674#true} {674#true} #46#return; {674#true} is VALID [2020-07-08 23:40:38,051 INFO L263 TraceCheckUtils]: 3: Hoare triple {674#true} call #t~ret0 := main(); {674#true} is VALID [2020-07-08 23:40:38,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {674#true} havoc ~i~0; {674#true} is VALID [2020-07-08 23:40:38,052 INFO L280 TraceCheckUtils]: 5: Hoare triple {674#true} havoc ~j~0; {674#true} is VALID [2020-07-08 23:40:38,052 INFO L280 TraceCheckUtils]: 6: Hoare triple {674#true} ~i~0 := 1; {674#true} is VALID [2020-07-08 23:40:38,054 INFO L280 TraceCheckUtils]: 7: Hoare triple {674#true} ~j~0 := 10; {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2020-07-08 23:40:38,054 INFO L280 TraceCheckUtils]: 8: Hoare triple {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} assume !!(~j~0 >= ~i~0); {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2020-07-08 23:40:38,058 INFO L280 TraceCheckUtils]: 9: Hoare triple {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} ~i~0 := 2 + ~i~0; {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2020-07-08 23:40:38,062 INFO L280 TraceCheckUtils]: 10: Hoare triple {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} ~j~0 := -1 + ~j~0; {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2020-07-08 23:40:38,063 INFO L280 TraceCheckUtils]: 11: Hoare triple {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} assume !!(~j~0 >= ~i~0); {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2020-07-08 23:40:38,064 INFO L280 TraceCheckUtils]: 12: Hoare triple {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} ~i~0 := 2 + ~i~0; {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2020-07-08 23:40:38,065 INFO L280 TraceCheckUtils]: 13: Hoare triple {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} ~j~0 := -1 + ~j~0; {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} is VALID [2020-07-08 23:40:38,067 INFO L280 TraceCheckUtils]: 14: Hoare triple {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} assume !!(~j~0 >= ~i~0); {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} is VALID [2020-07-08 23:40:38,068 INFO L280 TraceCheckUtils]: 15: Hoare triple {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} ~i~0 := 2 + ~i~0; {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} is VALID [2020-07-08 23:40:38,069 INFO L280 TraceCheckUtils]: 16: Hoare triple {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} ~j~0 := -1 + ~j~0; {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} is VALID [2020-07-08 23:40:38,070 INFO L280 TraceCheckUtils]: 17: Hoare triple {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} assume !!(~j~0 >= ~i~0); {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} is VALID [2020-07-08 23:40:38,071 INFO L280 TraceCheckUtils]: 18: Hoare triple {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} ~i~0 := 2 + ~i~0; {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} is VALID [2020-07-08 23:40:38,072 INFO L280 TraceCheckUtils]: 19: Hoare triple {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} ~j~0 := -1 + ~j~0; {682#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-08 23:40:38,073 INFO L280 TraceCheckUtils]: 20: Hoare triple {682#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {682#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-08 23:40:38,074 INFO L263 TraceCheckUtils]: 21: Hoare triple {682#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {683#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:38,075 INFO L280 TraceCheckUtils]: 22: Hoare triple {683#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {684#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:38,076 INFO L280 TraceCheckUtils]: 23: Hoare triple {684#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {675#false} is VALID [2020-07-08 23:40:38,076 INFO L280 TraceCheckUtils]: 24: Hoare triple {675#false} assume !false; {675#false} is VALID [2020-07-08 23:40:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:38,080 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022910318] [2020-07-08 23:40:38,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:38,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 23:40:38,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044185496] [2020-07-08 23:40:38,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 23:40:38,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:38,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:40:38,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:38,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:40:38,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:40:38,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:40:38,123 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2020-07-08 23:40:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:38,479 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-08 23:40:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:40:38,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 23:40:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2020-07-08 23:40:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2020-07-08 23:40:38,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2020-07-08 23:40:38,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:38,522 INFO L225 Difference]: With dead ends: 36 [2020-07-08 23:40:38,523 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 23:40:38,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:40:38,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 23:40:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-08 23:40:38,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:38,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2020-07-08 23:40:38,574 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2020-07-08 23:40:38,574 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2020-07-08 23:40:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:38,577 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 23:40:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 23:40:38,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:38,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:38,578 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2020-07-08 23:40:38,578 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2020-07-08 23:40:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:38,581 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 23:40:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 23:40:38,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:38,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:38,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:38,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 23:40:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2020-07-08 23:40:38,583 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2020-07-08 23:40:38,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:38,584 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2020-07-08 23:40:38,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:40:38,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2020-07-08 23:40:38,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-08 23:40:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 23:40:38,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:38,614 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:38,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:40:38,614 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash -407443737, now seen corresponding path program 5 times [2020-07-08 23:40:38,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:38,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1165348488] [2020-07-08 23:40:38,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:38,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {881#true} assume true; {881#true} is VALID [2020-07-08 23:40:38,806 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {881#true} {881#true} #46#return; {881#true} is VALID [2020-07-08 23:40:38,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID [2020-07-08 23:40:38,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {881#true} assume true; {881#true} is VALID [2020-07-08 23:40:38,807 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {881#true} {881#true} #46#return; {881#true} is VALID [2020-07-08 23:40:38,807 INFO L263 TraceCheckUtils]: 3: Hoare triple {881#true} call #t~ret0 := main(); {881#true} is VALID [2020-07-08 23:40:38,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {881#true} havoc ~i~0; {881#true} is VALID [2020-07-08 23:40:38,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {881#true} havoc ~j~0; {881#true} is VALID [2020-07-08 23:40:38,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {881#true} ~i~0 := 1; {885#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:38,808 INFO L280 TraceCheckUtils]: 7: Hoare triple {885#(<= 1 main_~i~0)} ~j~0 := 10; {886#(<= main_~j~0 (+ main_~i~0 9))} is VALID [2020-07-08 23:40:38,809 INFO L280 TraceCheckUtils]: 8: Hoare triple {886#(<= main_~j~0 (+ main_~i~0 9))} assume !!(~j~0 >= ~i~0); {886#(<= main_~j~0 (+ main_~i~0 9))} is VALID [2020-07-08 23:40:38,810 INFO L280 TraceCheckUtils]: 9: Hoare triple {886#(<= main_~j~0 (+ main_~i~0 9))} ~i~0 := 2 + ~i~0; {887#(<= main_~j~0 (+ main_~i~0 7))} is VALID [2020-07-08 23:40:38,817 INFO L280 TraceCheckUtils]: 10: Hoare triple {887#(<= main_~j~0 (+ main_~i~0 7))} ~j~0 := -1 + ~j~0; {888#(<= main_~j~0 (+ main_~i~0 6))} is VALID [2020-07-08 23:40:38,818 INFO L280 TraceCheckUtils]: 11: Hoare triple {888#(<= main_~j~0 (+ main_~i~0 6))} assume !!(~j~0 >= ~i~0); {888#(<= main_~j~0 (+ main_~i~0 6))} is VALID [2020-07-08 23:40:38,818 INFO L280 TraceCheckUtils]: 12: Hoare triple {888#(<= main_~j~0 (+ main_~i~0 6))} ~i~0 := 2 + ~i~0; {889#(<= main_~j~0 (+ main_~i~0 4))} is VALID [2020-07-08 23:40:38,819 INFO L280 TraceCheckUtils]: 13: Hoare triple {889#(<= main_~j~0 (+ main_~i~0 4))} ~j~0 := -1 + ~j~0; {890#(<= main_~j~0 (+ main_~i~0 3))} is VALID [2020-07-08 23:40:38,824 INFO L280 TraceCheckUtils]: 14: Hoare triple {890#(<= main_~j~0 (+ main_~i~0 3))} assume !!(~j~0 >= ~i~0); {890#(<= main_~j~0 (+ main_~i~0 3))} is VALID [2020-07-08 23:40:38,826 INFO L280 TraceCheckUtils]: 15: Hoare triple {890#(<= main_~j~0 (+ main_~i~0 3))} ~i~0 := 2 + ~i~0; {891#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2020-07-08 23:40:38,827 INFO L280 TraceCheckUtils]: 16: Hoare triple {891#(<= main_~j~0 (+ main_~i~0 1))} ~j~0 := -1 + ~j~0; {892#(<= main_~j~0 main_~i~0)} is VALID [2020-07-08 23:40:38,827 INFO L280 TraceCheckUtils]: 17: Hoare triple {892#(<= main_~j~0 main_~i~0)} assume !!(~j~0 >= ~i~0); {892#(<= main_~j~0 main_~i~0)} is VALID [2020-07-08 23:40:38,828 INFO L280 TraceCheckUtils]: 18: Hoare triple {892#(<= main_~j~0 main_~i~0)} ~i~0 := 2 + ~i~0; {893#(<= (+ main_~j~0 2) main_~i~0)} is VALID [2020-07-08 23:40:38,829 INFO L280 TraceCheckUtils]: 19: Hoare triple {893#(<= (+ main_~j~0 2) main_~i~0)} ~j~0 := -1 + ~j~0; {894#(<= (+ main_~j~0 3) main_~i~0)} is VALID [2020-07-08 23:40:38,830 INFO L280 TraceCheckUtils]: 20: Hoare triple {894#(<= (+ main_~j~0 3) main_~i~0)} assume !!(~j~0 >= ~i~0); {882#false} is VALID [2020-07-08 23:40:38,830 INFO L280 TraceCheckUtils]: 21: Hoare triple {882#false} ~i~0 := 2 + ~i~0; {882#false} is VALID [2020-07-08 23:40:38,830 INFO L280 TraceCheckUtils]: 22: Hoare triple {882#false} ~j~0 := -1 + ~j~0; {882#false} is VALID [2020-07-08 23:40:38,831 INFO L280 TraceCheckUtils]: 23: Hoare triple {882#false} assume !(~j~0 >= ~i~0); {882#false} is VALID [2020-07-08 23:40:38,831 INFO L263 TraceCheckUtils]: 24: Hoare triple {882#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {882#false} is VALID [2020-07-08 23:40:38,831 INFO L280 TraceCheckUtils]: 25: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2020-07-08 23:40:38,831 INFO L280 TraceCheckUtils]: 26: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2020-07-08 23:40:38,832 INFO L280 TraceCheckUtils]: 27: Hoare triple {882#false} assume !false; {882#false} is VALID [2020-07-08 23:40:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:38,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1165348488] [2020-07-08 23:40:38,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:38,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-08 23:40:38,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10799565] [2020-07-08 23:40:38,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-08 23:40:38,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:38,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 23:40:38,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:38,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 23:40:38,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:38,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 23:40:38,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-08 23:40:38,874 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2020-07-08 23:40:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:39,126 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-08 23:40:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:40:39,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-08 23:40:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 23:40:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2020-07-08 23:40:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 23:40:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2020-07-08 23:40:39,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 29 transitions. [2020-07-08 23:40:39,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:39,158 INFO L225 Difference]: With dead ends: 29 [2020-07-08 23:40:39,158 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:40:39,159 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2020-07-08 23:40:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:40:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:40:39,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:39,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:39,160 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:39,160 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:39,160 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:40:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:39,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:39,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:39,161 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:39,161 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:39,161 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:40:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:39,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:39,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:39,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:39,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:40:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:40:39,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2020-07-08 23:40:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:39,163 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:40:39,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 23:40:39,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:40:39,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:39,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:39,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:40:39,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:40:39,585 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:40:39,585 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:40:39,585 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:40:39,585 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:40:39,585 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:40:39,586 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:40:39,586 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:39,586 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:39,586 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 23:40:39,586 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 23:40:39,586 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:39,586 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 23) the Hoare annotation is: true [2020-07-08 23:40:39,586 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 23) the Hoare annotation is: true [2020-07-08 23:40:39,587 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-08 23:40:39,587 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= main_~j~0 7) (<= 7 main_~j~0) (<= (+ main_~j~0 2) main_~i~0)) (let ((.cse0 (+ main_~i~0 7))) (and (<= main_~j~0 10) (<= 10 main_~j~0) (<= main_~j~0 .cse0) (<= .cse0 main_~j~0))) (let ((.cse1 (+ main_~i~0 1))) (and (<= main_~j~0 8) (<= main_~j~0 .cse1) (<= 8 main_~j~0) (<= .cse1 main_~j~0))) (let ((.cse2 (+ main_~i~0 4))) (and (<= 9 main_~j~0) (<= .cse2 main_~j~0) (<= main_~j~0 .cse2) (<= main_~j~0 9)))) [2020-07-08 23:40:39,587 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 3))) (and (<= .cse0 main_~j~0) (<= main_~j~0 8) (<= main_~j~0 .cse0) (<= 8 main_~j~0))) (and (<= main_~j~0 7) (<= 7 main_~j~0) (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0)) (let ((.cse1 (+ main_~i~0 6))) (and (<= 9 main_~j~0) (<= .cse1 main_~j~0) (<= main_~j~0 .cse1) (<= main_~j~0 9))) (let ((.cse2 (+ main_~i~0 9))) (and (<= .cse2 main_~j~0) (<= main_~i~0 1) (<= main_~j~0 .cse2) (<= 1 main_~i~0)))) [2020-07-08 23:40:39,588 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~i~0 1) (<= 1 main_~i~0)) [2020-07-08 23:40:39,588 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-08 23:40:39,588 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 20) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 3))) (and (<= .cse0 main_~j~0) (<= main_~j~0 8) (<= main_~j~0 .cse0) (<= 8 main_~j~0))) (and (<= main_~j~0 6) (<= (+ main_~j~0 3) main_~i~0) (< 5 main_~j~0)) (and (<= main_~j~0 7) (<= 7 main_~j~0) (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0)) (let ((.cse1 (+ main_~i~0 6))) (and (<= 9 main_~j~0) (<= .cse1 main_~j~0) (<= main_~j~0 .cse1) (<= main_~j~0 9))) (let ((.cse2 (+ main_~i~0 9))) (and (<= .cse2 main_~j~0) (<= main_~i~0 1) (<= main_~j~0 .cse2) (<= 1 main_~i~0)))) [2020-07-08 23:40:39,588 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-08 23:40:39,589 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 20) the Hoare annotation is: (and (<= main_~j~0 6) (< 5 main_~j~0)) [2020-07-08 23:40:39,589 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 23) the Hoare annotation is: true [2020-07-08 23:40:39,589 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 23:40:39,589 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-08 23:40:39,589 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:40:39,589 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 23:40:39,589 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-08 23:40:39,590 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:40:39,594 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:40:39,595 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:40:39,595 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:40:39,596 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 23:40:39,596 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 23:40:39,604 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:40:39,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:40:39 BoogieIcfgContainer [2020-07-08 23:40:39,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:40:39,623 INFO L168 Benchmark]: Toolchain (without parser) took 4796.03 ms. Allocated memory was 145.2 MB in the beginning and 272.6 MB in the end (delta: 127.4 MB). Free memory was 104.2 MB in the beginning and 194.4 MB in the end (delta: -90.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:39,624 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-08 23:40:39,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.91 ms. Allocated memory is still 145.2 MB. Free memory was 103.8 MB in the beginning and 94.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:39,626 INFO L168 Benchmark]: Boogie Preprocessor took 33.47 ms. Allocated memory is still 145.2 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:39,627 INFO L168 Benchmark]: RCFGBuilder took 385.52 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.4 MB in the beginning and 167.2 MB in the end (delta: -74.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:39,628 INFO L168 Benchmark]: TraceAbstraction took 4139.74 ms. Allocated memory was 202.9 MB in the beginning and 272.6 MB in the end (delta: 69.7 MB). Free memory was 166.5 MB in the beginning and 194.4 MB in the end (delta: -27.9 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:39,631 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.91 ms. Allocated memory is still 145.2 MB. Free memory was 103.8 MB in the beginning and 94.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.47 ms. Allocated memory is still 145.2 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.52 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.4 MB in the beginning and 167.2 MB in the end (delta: -74.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4139.74 ms. Allocated memory was 202.9 MB in the beginning and 272.6 MB in the end (delta: 69.7 MB). Free memory was 166.5 MB in the beginning and 194.4 MB in the end (delta: -27.9 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((i + 3 <= j && j <= 8) && j <= i + 3) && 8 <= j) || ((j <= 6 && j + 3 <= i) && 5 < j)) || (((j <= 7 && 7 <= j) && j <= i) && i <= j)) || (((9 <= j && i + 6 <= j) && j <= i + 6) && j <= 9)) || (((i + 9 <= j && i <= 1) && j <= i + 9) && 1 <= i) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 5, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 84 SDtfs, 26 SDslu, 283 SDs, 0 SdLazy, 267 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 53 PreInvPairs, 82 NumberOfFragments, 249 HoareAnnotationTreeSize, 53 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 50 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 7671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 35/75 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...