/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/gsv2008.c.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:40:55,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:40:55,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:40:55,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:40:55,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:40:55,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:40:55,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:40:55,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:40:55,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:40:55,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:40:55,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:40:55,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:40:55,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:40:55,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:40:55,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:40:55,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:40:55,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:40:55,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:40:55,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:40:55,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:40:55,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:40:55,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:40:55,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:40:55,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:40:55,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:40:55,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:40:55,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:40:55,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:40:55,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:40:55,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:40:55,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:40:55,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:40:55,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:40:55,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:40:55,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:40:55,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:40:55,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:40:55,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:40:55,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:40:55,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:40:55,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:40:55,585 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:55,596 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:40:55,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:40:55,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:40:55,599 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:40:55,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:40:55,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:40:55,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:40:55,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:40:55,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:40:55,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:40:55,601 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:40:55,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:40:55,602 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:40:55,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:40:55,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:40:55,602 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:40:55,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:40:55,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:40:55,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:40:55,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:40:55,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:40:55,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:40:55,604 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:55,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:40:55,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:40:55,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:40:55,888 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:40:55,888 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:40:55,889 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c [2020-07-08 23:40:55,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4326aa3e0/1ad30103a57e4ddea04c37bc0cc5a336/FLAG5ea81a92f [2020-07-08 23:40:56,409 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:40:56,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c [2020-07-08 23:40:56,416 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4326aa3e0/1ad30103a57e4ddea04c37bc0cc5a336/FLAG5ea81a92f [2020-07-08 23:40:56,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4326aa3e0/1ad30103a57e4ddea04c37bc0cc5a336 [2020-07-08 23:40:56,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:40:56,766 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:40:56,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:40:56,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:40:56,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:40:56,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:40:56" (1/1) ... [2020-07-08 23:40:56,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56799d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:56, skipping insertion in model container [2020-07-08 23:40:56,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:40:56" (1/1) ... [2020-07-08 23:40:56,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:40:56,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:40:56,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:40:56,968 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:40:56,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:40:57,001 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:40:57,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:57 WrapperNode [2020-07-08 23:40:57,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:40:57,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:40:57,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:40:57,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:40:57,016 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:57" (1/1) ... [2020-07-08 23:40:57,016 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:57" (1/1) ... [2020-07-08 23:40:57,022 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:57" (1/1) ... [2020-07-08 23:40:57,022 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:57" (1/1) ... [2020-07-08 23:40:57,027 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:57" (1/1) ... [2020-07-08 23:40:57,030 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:57" (1/1) ... [2020-07-08 23:40:57,031 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:57" (1/1) ... [2020-07-08 23:40:57,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:40:57,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:40:57,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:40:57,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:40:57,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:57" (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:57,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:40:57,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:40:57,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:40:57,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:40:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:40:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:40:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:40:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:40:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:40:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:40:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:40:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:40:57,436 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:40:57,437 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 23:40:57,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:40:57 BoogieIcfgContainer [2020-07-08 23:40:57,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:40:57,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:40:57,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:40:57,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:40:57,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:40:56" (1/3) ... [2020-07-08 23:40:57,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efb64dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:40:57, skipping insertion in model container [2020-07-08 23:40:57,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:57" (2/3) ... [2020-07-08 23:40:57,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efb64dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:40:57, skipping insertion in model container [2020-07-08 23:40:57,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:40:57" (3/3) ... [2020-07-08 23:40:57,451 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+cfa-reducer.c [2020-07-08 23:40:57,463 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:40:57,472 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:40:57,491 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:40:57,513 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:40:57,513 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:40:57,513 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:40:57,513 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:40:57,514 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:40:57,514 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:40:57,514 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:40:57,514 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:40:57,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-08 23:40:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 23:40:57,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:57,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:57,546 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:57,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:57,560 INFO L82 PathProgramCache]: Analyzing trace with hash 341466613, now seen corresponding path program 1 times [2020-07-08 23:40:57,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:57,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [370877733] [2020-07-08 23:40:57,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:57,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {37#true} is VALID [2020-07-08 23:40:57,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} ~__return_65~0 := 0; {37#true} is VALID [2020-07-08 23:40:57,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 23:40:57,780 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #55#return; {37#true} is VALID [2020-07-08 23:40:57,784 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {44#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-08 23:40:57,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {37#true} is VALID [2020-07-08 23:40:57,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} ~__return_65~0 := 0; {37#true} is VALID [2020-07-08 23:40:57,786 INFO L280 TraceCheckUtils]: 3: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 23:40:57,786 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {37#true} {37#true} #55#return; {37#true} is VALID [2020-07-08 23:40:57,787 INFO L263 TraceCheckUtils]: 5: Hoare triple {37#true} call #t~ret1 := main(); {37#true} is VALID [2020-07-08 23:40:57,787 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} havoc ~main__x~0; {37#true} is VALID [2020-07-08 23:40:57,787 INFO L280 TraceCheckUtils]: 7: Hoare triple {37#true} havoc ~main__y~0; {37#true} is VALID [2020-07-08 23:40:57,789 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~main__x~0 := -50; {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:57,790 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:57,791 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:57,792 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:57,793 INFO L280 TraceCheckUtils]: 12: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:57,794 INFO L280 TraceCheckUtils]: 13: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:57,795 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} assume !(~main__x~0 < 0); {38#false} is VALID [2020-07-08 23:40:57,796 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} havoc ~__tmp_1~0; {38#false} is VALID [2020-07-08 23:40:57,796 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {38#false} is VALID [2020-07-08 23:40:57,797 INFO L280 TraceCheckUtils]: 17: Hoare triple {38#false} havoc ~__VERIFIER_assert__cond~0; {38#false} is VALID [2020-07-08 23:40:57,797 INFO L280 TraceCheckUtils]: 18: Hoare triple {38#false} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {38#false} is VALID [2020-07-08 23:40:57,798 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} assume 0 == ~__VERIFIER_assert__cond~0; {38#false} is VALID [2020-07-08 23:40:57,798 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-08 23:40:57,802 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:57,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [370877733] [2020-07-08 23:40:57,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:57,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:40:57,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331599161] [2020-07-08 23:40:57,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-07-08 23:40:57,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:57,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:40:57,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:57,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:40:57,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:57,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:40:57,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:40:57,874 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2020-07-08 23:40:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:58,157 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-08 23:40:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:40:58,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-07-08 23:40:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:40:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2020-07-08 23:40:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:40:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2020-07-08 23:40:58,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 55 transitions. [2020-07-08 23:40:58,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:58,284 INFO L225 Difference]: With dead ends: 51 [2020-07-08 23:40:58,284 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 23:40:58,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 23:40:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-07-08 23:40:58,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:58,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2020-07-08 23:40:58,387 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2020-07-08 23:40:58,388 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2020-07-08 23:40:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:58,392 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-08 23:40:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 23:40:58,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:58,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:58,393 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2020-07-08 23:40:58,393 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2020-07-08 23:40:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:58,397 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-08 23:40:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 23:40:58,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:58,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:58,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:58,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 23:40:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-08 23:40:58,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 21 [2020-07-08 23:40:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:58,403 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-08 23:40:58,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:40:58,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2020-07-08 23:40:58,448 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:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-08 23:40:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 23:40:58,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:58,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:58,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:40:58,451 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:58,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash 178703795, now seen corresponding path program 1 times [2020-07-08 23:40:58,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:58,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [484599576] [2020-07-08 23:40:58,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:58,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {257#true} is VALID [2020-07-08 23:40:58,686 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#true} ~__return_65~0 := 0; {257#true} is VALID [2020-07-08 23:40:58,686 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-08 23:40:58,686 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #55#return; {257#true} is VALID [2020-07-08 23:40:58,689 INFO L263 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {269#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-08 23:40:58,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {257#true} is VALID [2020-07-08 23:40:58,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} ~__return_65~0 := 0; {257#true} is VALID [2020-07-08 23:40:58,690 INFO L280 TraceCheckUtils]: 3: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-08 23:40:58,690 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {257#true} {257#true} #55#return; {257#true} is VALID [2020-07-08 23:40:58,690 INFO L263 TraceCheckUtils]: 5: Hoare triple {257#true} call #t~ret1 := main(); {257#true} is VALID [2020-07-08 23:40:58,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {257#true} havoc ~main__x~0; {257#true} is VALID [2020-07-08 23:40:58,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {257#true} havoc ~main__y~0; {257#true} is VALID [2020-07-08 23:40:58,693 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#true} ~main__x~0 := -50; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:58,694 INFO L280 TraceCheckUtils]: 9: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:58,694 INFO L280 TraceCheckUtils]: 10: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:58,696 INFO L280 TraceCheckUtils]: 11: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:58,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:58,697 INFO L280 TraceCheckUtils]: 13: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:58,699 INFO L280 TraceCheckUtils]: 14: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:58,700 INFO L280 TraceCheckUtils]: 15: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {264#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 23:40:58,701 INFO L280 TraceCheckUtils]: 16: Hoare triple {264#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {264#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 23:40:58,703 INFO L280 TraceCheckUtils]: 17: Hoare triple {264#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {265#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 23:40:58,704 INFO L280 TraceCheckUtils]: 18: Hoare triple {265#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0); {266#(<= 51 main_~main__y~0)} is VALID [2020-07-08 23:40:58,705 INFO L280 TraceCheckUtils]: 19: Hoare triple {266#(<= 51 main_~main__y~0)} havoc ~__tmp_1~0; {266#(<= 51 main_~main__y~0)} is VALID [2020-07-08 23:40:58,706 INFO L280 TraceCheckUtils]: 20: Hoare triple {266#(<= 51 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {267#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:40:58,707 INFO L280 TraceCheckUtils]: 21: Hoare triple {267#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {267#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:40:58,712 INFO L280 TraceCheckUtils]: 22: Hoare triple {267#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {268#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 23:40:58,713 INFO L280 TraceCheckUtils]: 23: Hoare triple {268#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {258#false} is VALID [2020-07-08 23:40:58,713 INFO L280 TraceCheckUtils]: 24: Hoare triple {258#false} assume !false; {258#false} is VALID [2020-07-08 23:40:58,715 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:58,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [484599576] [2020-07-08 23:40:58,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:58,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 23:40:58,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041893705] [2020-07-08 23:40:58,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 23:40:58,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:58,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:40:58,768 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:58,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:40:58,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:40:58,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:40:58,770 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2020-07-08 23:40:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:59,291 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-08 23:40:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:40:59,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 23:40:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-08 23:40:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-08 23:40:59,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2020-07-08 23:40:59,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:59,360 INFO L225 Difference]: With dead ends: 38 [2020-07-08 23:40:59,361 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 23:40:59,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:40:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 23:40:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-08 23:40:59,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:59,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2020-07-08 23:40:59,411 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2020-07-08 23:40:59,411 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2020-07-08 23:40:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:59,414 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 23:40:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 23:40:59,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:59,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:59,415 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2020-07-08 23:40:59,415 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2020-07-08 23:40:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:59,418 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 23:40:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 23:40:59,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:59,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:59,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:59,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 23:40:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2020-07-08 23:40:59,421 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2020-07-08 23:40:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:59,421 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2020-07-08 23:40:59,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:40:59,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2020-07-08 23:40:59,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2020-07-08 23:40:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 23:40:59,462 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:59,463 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:59,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:40:59,463 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash 563687025, now seen corresponding path program 2 times [2020-07-08 23:40:59,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:59,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978163107] [2020-07-08 23:40:59,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:59,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {496#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {482#true} is VALID [2020-07-08 23:40:59,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {482#true} ~__return_65~0 := 0; {482#true} is VALID [2020-07-08 23:40:59,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2020-07-08 23:40:59,624 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #55#return; {482#true} is VALID [2020-07-08 23:40:59,625 INFO L263 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {496#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-08 23:40:59,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {482#true} is VALID [2020-07-08 23:40:59,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#true} ~__return_65~0 := 0; {482#true} is VALID [2020-07-08 23:40:59,626 INFO L280 TraceCheckUtils]: 3: Hoare triple {482#true} assume true; {482#true} is VALID [2020-07-08 23:40:59,626 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {482#true} {482#true} #55#return; {482#true} is VALID [2020-07-08 23:40:59,627 INFO L263 TraceCheckUtils]: 5: Hoare triple {482#true} call #t~ret1 := main(); {482#true} is VALID [2020-07-08 23:40:59,627 INFO L280 TraceCheckUtils]: 6: Hoare triple {482#true} havoc ~main__x~0; {482#true} is VALID [2020-07-08 23:40:59,627 INFO L280 TraceCheckUtils]: 7: Hoare triple {482#true} havoc ~main__y~0; {482#true} is VALID [2020-07-08 23:40:59,628 INFO L280 TraceCheckUtils]: 8: Hoare triple {482#true} ~main__x~0 := -50; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:59,629 INFO L280 TraceCheckUtils]: 9: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:59,629 INFO L280 TraceCheckUtils]: 10: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:59,630 INFO L280 TraceCheckUtils]: 11: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:59,630 INFO L280 TraceCheckUtils]: 12: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:59,631 INFO L280 TraceCheckUtils]: 13: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:59,632 INFO L280 TraceCheckUtils]: 14: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:40:59,633 INFO L280 TraceCheckUtils]: 15: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {489#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 23:40:59,633 INFO L280 TraceCheckUtils]: 16: Hoare triple {489#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {489#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 23:40:59,634 INFO L280 TraceCheckUtils]: 17: Hoare triple {489#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {490#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 23:40:59,635 INFO L280 TraceCheckUtils]: 18: Hoare triple {490#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0; {490#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 23:40:59,636 INFO L280 TraceCheckUtils]: 19: Hoare triple {490#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {491#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:40:59,637 INFO L280 TraceCheckUtils]: 20: Hoare triple {491#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {491#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:40:59,637 INFO L280 TraceCheckUtils]: 21: Hoare triple {491#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {492#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:40:59,638 INFO L280 TraceCheckUtils]: 22: Hoare triple {492#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0); {493#(<= 27 main_~main__y~0)} is VALID [2020-07-08 23:40:59,639 INFO L280 TraceCheckUtils]: 23: Hoare triple {493#(<= 27 main_~main__y~0)} havoc ~__tmp_1~0; {493#(<= 27 main_~main__y~0)} is VALID [2020-07-08 23:40:59,640 INFO L280 TraceCheckUtils]: 24: Hoare triple {493#(<= 27 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {494#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:40:59,641 INFO L280 TraceCheckUtils]: 25: Hoare triple {494#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {494#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:40:59,641 INFO L280 TraceCheckUtils]: 26: Hoare triple {494#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {495#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 23:40:59,642 INFO L280 TraceCheckUtils]: 27: Hoare triple {495#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {483#false} is VALID [2020-07-08 23:40:59,642 INFO L280 TraceCheckUtils]: 28: Hoare triple {483#false} assume !false; {483#false} is VALID [2020-07-08 23:40:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:59,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978163107] [2020-07-08 23:40:59,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:59,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:40:59,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237531557] [2020-07-08 23:40:59,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-08 23:40:59,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:59,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:40:59,679 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:59,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:40:59,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:59,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:40:59,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:40:59,680 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 11 states. [2020-07-08 23:41:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:00,380 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 23:41:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 23:41:00,380 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-08 23:41:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:41:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2020-07-08 23:41:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:41:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2020-07-08 23:41:00,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2020-07-08 23:41:00,442 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:41:00,444 INFO L225 Difference]: With dead ends: 42 [2020-07-08 23:41:00,444 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 23:41:00,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2020-07-08 23:41:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 23:41:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-08 23:41:00,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:00,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-08 23:41:00,514 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-08 23:41:00,515 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-08 23:41:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:00,518 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 23:41:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 23:41:00,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:00,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:00,519 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-08 23:41:00,519 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-08 23:41:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:00,522 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 23:41:00,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 23:41:00,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:00,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:00,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:00,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 23:41:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-08 23:41:00,525 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 29 [2020-07-08 23:41:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:00,526 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-08 23:41:00,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:41:00,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2020-07-08 23:41:00,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-08 23:41:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 23:41:00,564 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:00,565 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:00,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:41:00,565 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1026490321, now seen corresponding path program 3 times [2020-07-08 23:41:00,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:00,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188454790] [2020-07-08 23:41:00,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:00,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {753#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {737#true} is VALID [2020-07-08 23:41:00,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {737#true} ~__return_65~0 := 0; {737#true} is VALID [2020-07-08 23:41:00,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {737#true} assume true; {737#true} is VALID [2020-07-08 23:41:00,763 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {737#true} {737#true} #55#return; {737#true} is VALID [2020-07-08 23:41:00,764 INFO L263 TraceCheckUtils]: 0: Hoare triple {737#true} call ULTIMATE.init(); {753#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-08 23:41:00,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {753#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {737#true} is VALID [2020-07-08 23:41:00,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {737#true} ~__return_65~0 := 0; {737#true} is VALID [2020-07-08 23:41:00,765 INFO L280 TraceCheckUtils]: 3: Hoare triple {737#true} assume true; {737#true} is VALID [2020-07-08 23:41:00,765 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {737#true} {737#true} #55#return; {737#true} is VALID [2020-07-08 23:41:00,765 INFO L263 TraceCheckUtils]: 5: Hoare triple {737#true} call #t~ret1 := main(); {737#true} is VALID [2020-07-08 23:41:00,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {737#true} havoc ~main__x~0; {737#true} is VALID [2020-07-08 23:41:00,766 INFO L280 TraceCheckUtils]: 7: Hoare triple {737#true} havoc ~main__y~0; {737#true} is VALID [2020-07-08 23:41:00,768 INFO L280 TraceCheckUtils]: 8: Hoare triple {737#true} ~main__x~0 := -50; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:00,769 INFO L280 TraceCheckUtils]: 9: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:00,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:00,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:00,770 INFO L280 TraceCheckUtils]: 12: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:00,771 INFO L280 TraceCheckUtils]: 13: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:00,774 INFO L280 TraceCheckUtils]: 14: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:00,778 INFO L280 TraceCheckUtils]: 15: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {744#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 23:41:00,784 INFO L280 TraceCheckUtils]: 16: Hoare triple {744#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {744#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 23:41:00,785 INFO L280 TraceCheckUtils]: 17: Hoare triple {744#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {745#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 23:41:00,786 INFO L280 TraceCheckUtils]: 18: Hoare triple {745#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0; {745#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 23:41:00,787 INFO L280 TraceCheckUtils]: 19: Hoare triple {745#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {746#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:41:00,788 INFO L280 TraceCheckUtils]: 20: Hoare triple {746#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {746#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:41:00,789 INFO L280 TraceCheckUtils]: 21: Hoare triple {746#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {747#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:41:00,789 INFO L280 TraceCheckUtils]: 22: Hoare triple {747#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume ~main__x~0 < 0; {747#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:41:00,790 INFO L280 TraceCheckUtils]: 23: Hoare triple {747#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main__x~0 := ~main__x~0 + ~main__y~0; {748#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-08 23:41:00,791 INFO L280 TraceCheckUtils]: 24: Hoare triple {748#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {748#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-08 23:41:00,792 INFO L280 TraceCheckUtils]: 25: Hoare triple {748#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {749#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-08 23:41:00,793 INFO L280 TraceCheckUtils]: 26: Hoare triple {749#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} assume !(~main__x~0 < 0); {750#(<= 19 main_~main__y~0)} is VALID [2020-07-08 23:41:00,794 INFO L280 TraceCheckUtils]: 27: Hoare triple {750#(<= 19 main_~main__y~0)} havoc ~__tmp_1~0; {750#(<= 19 main_~main__y~0)} is VALID [2020-07-08 23:41:00,794 INFO L280 TraceCheckUtils]: 28: Hoare triple {750#(<= 19 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {751#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:41:00,795 INFO L280 TraceCheckUtils]: 29: Hoare triple {751#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {751#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:41:00,811 INFO L280 TraceCheckUtils]: 30: Hoare triple {751#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {752#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 23:41:00,812 INFO L280 TraceCheckUtils]: 31: Hoare triple {752#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {738#false} is VALID [2020-07-08 23:41:00,812 INFO L280 TraceCheckUtils]: 32: Hoare triple {738#false} assume !false; {738#false} is VALID [2020-07-08 23:41:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:41:00,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188454790] [2020-07-08 23:41:00,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:41:00,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 23:41:00,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024341954] [2020-07-08 23:41:00,820 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-08 23:41:00,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:00,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 23:41:00,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:00,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 23:41:00,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 23:41:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:41:00,861 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 13 states. [2020-07-08 23:41:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:01,672 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-08 23:41:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 23:41:01,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-08 23:41:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:41:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2020-07-08 23:41:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:41:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2020-07-08 23:41:01,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 46 transitions. [2020-07-08 23:41:01,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:01,747 INFO L225 Difference]: With dead ends: 46 [2020-07-08 23:41:01,748 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 23:41:01,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2020-07-08 23:41:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 23:41:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-07-08 23:41:01,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:01,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2020-07-08 23:41:01,818 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2020-07-08 23:41:01,818 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2020-07-08 23:41:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:01,825 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-08 23:41:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-07-08 23:41:01,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:01,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:01,826 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2020-07-08 23:41:01,827 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2020-07-08 23:41:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:01,830 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-08 23:41:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-07-08 23:41:01,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:01,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:01,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:01,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 23:41:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-08 23:41:01,835 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 33 [2020-07-08 23:41:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:01,835 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-08 23:41:01,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 23:41:01,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-08 23:41:01,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-08 23:41:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 23:41:01,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:01,894 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:01,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:41:01,895 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2083373805, now seen corresponding path program 4 times [2020-07-08 23:41:01,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:01,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1290114378] [2020-07-08 23:41:01,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:02,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {1022#true} is VALID [2020-07-08 23:41:02,146 INFO L280 TraceCheckUtils]: 1: Hoare triple {1022#true} ~__return_65~0 := 0; {1022#true} is VALID [2020-07-08 23:41:02,146 INFO L280 TraceCheckUtils]: 2: Hoare triple {1022#true} assume true; {1022#true} is VALID [2020-07-08 23:41:02,147 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1022#true} {1022#true} #55#return; {1022#true} is VALID [2020-07-08 23:41:02,150 INFO L263 TraceCheckUtils]: 0: Hoare triple {1022#true} call ULTIMATE.init(); {1040#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-08 23:41:02,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {1022#true} is VALID [2020-07-08 23:41:02,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {1022#true} ~__return_65~0 := 0; {1022#true} is VALID [2020-07-08 23:41:02,150 INFO L280 TraceCheckUtils]: 3: Hoare triple {1022#true} assume true; {1022#true} is VALID [2020-07-08 23:41:02,151 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1022#true} {1022#true} #55#return; {1022#true} is VALID [2020-07-08 23:41:02,151 INFO L263 TraceCheckUtils]: 5: Hoare triple {1022#true} call #t~ret1 := main(); {1022#true} is VALID [2020-07-08 23:41:02,151 INFO L280 TraceCheckUtils]: 6: Hoare triple {1022#true} havoc ~main__x~0; {1022#true} is VALID [2020-07-08 23:41:02,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {1022#true} havoc ~main__y~0; {1022#true} is VALID [2020-07-08 23:41:02,152 INFO L280 TraceCheckUtils]: 8: Hoare triple {1022#true} ~main__x~0 := -50; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:02,152 INFO L280 TraceCheckUtils]: 9: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:02,152 INFO L280 TraceCheckUtils]: 10: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:02,153 INFO L280 TraceCheckUtils]: 11: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:02,153 INFO L280 TraceCheckUtils]: 12: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:02,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:02,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 23:41:02,155 INFO L280 TraceCheckUtils]: 15: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {1029#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 23:41:02,155 INFO L280 TraceCheckUtils]: 16: Hoare triple {1029#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1029#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 23:41:02,156 INFO L280 TraceCheckUtils]: 17: Hoare triple {1029#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {1030#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 23:41:02,156 INFO L280 TraceCheckUtils]: 18: Hoare triple {1030#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0; {1030#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 23:41:02,157 INFO L280 TraceCheckUtils]: 19: Hoare triple {1030#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {1031#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:41:02,157 INFO L280 TraceCheckUtils]: 20: Hoare triple {1031#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1031#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:41:02,158 INFO L280 TraceCheckUtils]: 21: Hoare triple {1031#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {1032#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:41:02,158 INFO L280 TraceCheckUtils]: 22: Hoare triple {1032#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume ~main__x~0 < 0; {1032#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 23:41:02,159 INFO L280 TraceCheckUtils]: 23: Hoare triple {1032#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main__x~0 := ~main__x~0 + ~main__y~0; {1033#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-08 23:41:02,159 INFO L280 TraceCheckUtils]: 24: Hoare triple {1033#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1033#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-08 23:41:02,160 INFO L280 TraceCheckUtils]: 25: Hoare triple {1033#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {1034#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-08 23:41:02,160 INFO L280 TraceCheckUtils]: 26: Hoare triple {1034#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} assume ~main__x~0 < 0; {1034#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-08 23:41:02,161 INFO L280 TraceCheckUtils]: 27: Hoare triple {1034#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} ~main__x~0 := ~main__x~0 + ~main__y~0; {1035#(<= (+ main_~main__x~0 56) (* 4 main_~main__y~0))} is VALID [2020-07-08 23:41:02,161 INFO L280 TraceCheckUtils]: 28: Hoare triple {1035#(<= (+ main_~main__x~0 56) (* 4 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1035#(<= (+ main_~main__x~0 56) (* 4 main_~main__y~0))} is VALID [2020-07-08 23:41:02,162 INFO L280 TraceCheckUtils]: 29: Hoare triple {1035#(<= (+ main_~main__x~0 56) (* 4 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {1036#(<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))} is VALID [2020-07-08 23:41:02,163 INFO L280 TraceCheckUtils]: 30: Hoare triple {1036#(<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))} assume !(~main__x~0 < 0); {1037#(<= 15 main_~main__y~0)} is VALID [2020-07-08 23:41:02,163 INFO L280 TraceCheckUtils]: 31: Hoare triple {1037#(<= 15 main_~main__y~0)} havoc ~__tmp_1~0; {1037#(<= 15 main_~main__y~0)} is VALID [2020-07-08 23:41:02,164 INFO L280 TraceCheckUtils]: 32: Hoare triple {1037#(<= 15 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {1038#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:41:02,164 INFO L280 TraceCheckUtils]: 33: Hoare triple {1038#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {1038#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:41:02,164 INFO L280 TraceCheckUtils]: 34: Hoare triple {1038#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1039#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 23:41:02,165 INFO L280 TraceCheckUtils]: 35: Hoare triple {1039#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {1023#false} is VALID [2020-07-08 23:41:02,165 INFO L280 TraceCheckUtils]: 36: Hoare triple {1023#false} assume !false; {1023#false} is VALID [2020-07-08 23:41:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:41:02,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1290114378] [2020-07-08 23:41:02,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:41:02,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-08 23:41:02,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533553339] [2020-07-08 23:41:02,169 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2020-07-08 23:41:02,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:02,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 23:41:02,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:02,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 23:41:02,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:02,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 23:41:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:41:02,215 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 15 states. [2020-07-08 23:41:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:03,192 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-07-08 23:41:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 23:41:03,193 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2020-07-08 23:41:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:41:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 50 transitions. [2020-07-08 23:41:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:41:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 50 transitions. [2020-07-08 23:41:03,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 50 transitions. [2020-07-08 23:41:03,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:03,261 INFO L225 Difference]: With dead ends: 50 [2020-07-08 23:41:03,262 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 23:41:03,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2020-07-08 23:41:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 23:41:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-08 23:41:03,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:03,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-08 23:41:03,334 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-08 23:41:03,335 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-08 23:41:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:03,338 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-08 23:41:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-08 23:41:03,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:03,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:03,339 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-08 23:41:03,339 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-08 23:41:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:03,341 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-08 23:41:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-08 23:41:03,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:03,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:03,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:03,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 23:41:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2020-07-08 23:41:03,344 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 37 [2020-07-08 23:41:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:03,345 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2020-07-08 23:41:03,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 23:41:03,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2020-07-08 23:41:03,404 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:41:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-08 23:41:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 23:41:03,406 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:03,406 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:03,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:41:03,406 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash -540084565, now seen corresponding path program 5 times [2020-07-08 23:41:03,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:03,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1478446475] [2020-07-08 23:41:03,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:03,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {1349#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {1337#true} is VALID [2020-07-08 23:41:03,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {1337#true} ~__return_65~0 := 0; {1337#true} is VALID [2020-07-08 23:41:03,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {1337#true} assume true; {1337#true} is VALID [2020-07-08 23:41:03,536 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1337#true} {1337#true} #55#return; {1337#true} is VALID [2020-07-08 23:41:03,537 INFO L263 TraceCheckUtils]: 0: Hoare triple {1337#true} call ULTIMATE.init(); {1349#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-08 23:41:03,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {1349#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0; {1337#true} is VALID [2020-07-08 23:41:03,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {1337#true} ~__return_65~0 := 0; {1337#true} is VALID [2020-07-08 23:41:03,538 INFO L280 TraceCheckUtils]: 3: Hoare triple {1337#true} assume true; {1337#true} is VALID [2020-07-08 23:41:03,538 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1337#true} {1337#true} #55#return; {1337#true} is VALID [2020-07-08 23:41:03,538 INFO L263 TraceCheckUtils]: 5: Hoare triple {1337#true} call #t~ret1 := main(); {1337#true} is VALID [2020-07-08 23:41:03,539 INFO L280 TraceCheckUtils]: 6: Hoare triple {1337#true} havoc ~main__x~0; {1337#true} is VALID [2020-07-08 23:41:03,539 INFO L280 TraceCheckUtils]: 7: Hoare triple {1337#true} havoc ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,539 INFO L280 TraceCheckUtils]: 8: Hoare triple {1337#true} ~main__x~0 := -50; {1337#true} is VALID [2020-07-08 23:41:03,539 INFO L280 TraceCheckUtils]: 9: Hoare triple {1337#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1337#true} is VALID [2020-07-08 23:41:03,540 INFO L280 TraceCheckUtils]: 10: Hoare triple {1337#true} ~main__y~0 := #t~nondet0; {1337#true} is VALID [2020-07-08 23:41:03,540 INFO L280 TraceCheckUtils]: 11: Hoare triple {1337#true} havoc #t~nondet0; {1337#true} is VALID [2020-07-08 23:41:03,540 INFO L280 TraceCheckUtils]: 12: Hoare triple {1337#true} assume !!(-1000 < ~main__y~0); {1337#true} is VALID [2020-07-08 23:41:03,540 INFO L280 TraceCheckUtils]: 13: Hoare triple {1337#true} assume !!(~main__y~0 < 1000000); {1337#true} is VALID [2020-07-08 23:41:03,540 INFO L280 TraceCheckUtils]: 14: Hoare triple {1337#true} assume ~main__x~0 < 0; {1337#true} is VALID [2020-07-08 23:41:03,541 INFO L280 TraceCheckUtils]: 15: Hoare triple {1337#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,541 INFO L280 TraceCheckUtils]: 16: Hoare triple {1337#true} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,541 INFO L280 TraceCheckUtils]: 17: Hoare triple {1337#true} ~main__y~0 := 1 + ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,541 INFO L280 TraceCheckUtils]: 18: Hoare triple {1337#true} assume ~main__x~0 < 0; {1337#true} is VALID [2020-07-08 23:41:03,542 INFO L280 TraceCheckUtils]: 19: Hoare triple {1337#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,542 INFO L280 TraceCheckUtils]: 20: Hoare triple {1337#true} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,542 INFO L280 TraceCheckUtils]: 21: Hoare triple {1337#true} ~main__y~0 := 1 + ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,542 INFO L280 TraceCheckUtils]: 22: Hoare triple {1337#true} assume ~main__x~0 < 0; {1337#true} is VALID [2020-07-08 23:41:03,543 INFO L280 TraceCheckUtils]: 23: Hoare triple {1337#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,543 INFO L280 TraceCheckUtils]: 24: Hoare triple {1337#true} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,543 INFO L280 TraceCheckUtils]: 25: Hoare triple {1337#true} ~main__y~0 := 1 + ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,543 INFO L280 TraceCheckUtils]: 26: Hoare triple {1337#true} assume ~main__x~0 < 0; {1337#true} is VALID [2020-07-08 23:41:03,544 INFO L280 TraceCheckUtils]: 27: Hoare triple {1337#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,544 INFO L280 TraceCheckUtils]: 28: Hoare triple {1337#true} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,544 INFO L280 TraceCheckUtils]: 29: Hoare triple {1337#true} ~main__y~0 := 1 + ~main__y~0; {1337#true} is VALID [2020-07-08 23:41:03,545 INFO L280 TraceCheckUtils]: 30: Hoare triple {1337#true} assume ~main__x~0 < 0; {1343#(<= (+ main_~main__x~0 1) 0)} is VALID [2020-07-08 23:41:03,546 INFO L280 TraceCheckUtils]: 31: Hoare triple {1343#(<= (+ main_~main__x~0 1) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {1344#(<= (+ main_~main__x~0 1) main_~main__y~0)} is VALID [2020-07-08 23:41:03,546 INFO L280 TraceCheckUtils]: 32: Hoare triple {1344#(<= (+ main_~main__x~0 1) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1344#(<= (+ main_~main__x~0 1) main_~main__y~0)} is VALID [2020-07-08 23:41:03,549 INFO L280 TraceCheckUtils]: 33: Hoare triple {1344#(<= (+ main_~main__x~0 1) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {1345#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2020-07-08 23:41:03,550 INFO L280 TraceCheckUtils]: 34: Hoare triple {1345#(<= (+ main_~main__x~0 2) main_~main__y~0)} assume !(~main__x~0 < 0); {1346#(<= 2 main_~main__y~0)} is VALID [2020-07-08 23:41:03,551 INFO L280 TraceCheckUtils]: 35: Hoare triple {1346#(<= 2 main_~main__y~0)} havoc ~__tmp_1~0; {1346#(<= 2 main_~main__y~0)} is VALID [2020-07-08 23:41:03,553 INFO L280 TraceCheckUtils]: 36: Hoare triple {1346#(<= 2 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {1347#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:41:03,553 INFO L280 TraceCheckUtils]: 37: Hoare triple {1347#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {1347#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 23:41:03,554 INFO L280 TraceCheckUtils]: 38: Hoare triple {1347#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1348#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 23:41:03,554 INFO L280 TraceCheckUtils]: 39: Hoare triple {1348#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {1338#false} is VALID [2020-07-08 23:41:03,555 INFO L280 TraceCheckUtils]: 40: Hoare triple {1338#false} assume !false; {1338#false} is VALID [2020-07-08 23:41:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-08 23:41:03,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1478446475] [2020-07-08 23:41:03,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:41:03,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 23:41:03,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857628890] [2020-07-08 23:41:03,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-07-08 23:41:03,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:03,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:41:03,585 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:41:03,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:41:03,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:03,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:41:03,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:41:03,586 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 9 states. [2020-07-08 23:41:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:04,050 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 23:41:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 23:41:04,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-07-08 23:41:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:41:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2020-07-08 23:41:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:41:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2020-07-08 23:41:04,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2020-07-08 23:41:04,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:04,088 INFO L225 Difference]: With dead ends: 42 [2020-07-08 23:41:04,088 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:41:04,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-07-08 23:41:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:41:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:41:04,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:04,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:04,090 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:04,090 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:04,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:41:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:41:04,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:04,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:04,091 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:04,091 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:04,091 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:41:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:41:04,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:04,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:04,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:04,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:41:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:41:04,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-08 23:41:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:04,092 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:41:04,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:41:04,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:41:04,093 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:41:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:41:04,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:04,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:41:04,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:41:04,687 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:41:04,687 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-08 23:41:04,687 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|)) [2020-07-08 23:41:04,687 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:41:04,687 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:41:04,688 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:41:04,688 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:41:04,688 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:41:04,688 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-08 23:41:04,688 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-08 23:41:04,688 INFO L268 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2020-07-08 23:41:04,688 INFO L268 CegarLoopResult]: For program point L5-3(lines 4 6) no Hoare annotation was computed. [2020-07-08 23:41:04,689 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-08 23:41:04,689 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (= |old(~__return_65~0)| ~__return_65~0) (<= (+ main_~main__x~0 1) main_~main__y~0)) [2020-07-08 23:41:04,689 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-08 23:41:04,689 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 58) the Hoare annotation is: true [2020-07-08 23:41:04,689 INFO L264 CegarLoopResult]: At program point L23(lines 23 56) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-08 23:41:04,689 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-08 23:41:04,689 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-08 23:41:04,689 INFO L264 CegarLoopResult]: At program point L17(lines 17 57) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-08 23:41:04,690 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (= |old(~__return_65~0)| ~__return_65~0) [2020-07-08 23:41:04,690 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: false [2020-07-08 23:41:04,690 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 58) the Hoare annotation is: true [2020-07-08 23:41:04,690 INFO L264 CegarLoopResult]: At program point L44(lines 44 53) the Hoare annotation is: (let ((.cse0 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse1 (= |old(~__return_65~0)| ~__return_65~0)) (.cse2 (not (= 0 main_~__tmp_1~0)))) (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 .cse1 .cse2 (<= 2 main_~main__y~0)) (and .cse0 .cse1 (<= 15 main_~main__y~0) .cse2 (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))))) [2020-07-08 23:41:04,690 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (= |old(~__return_65~0)| ~__return_65~0)) (.cse1 (not (= 0 main_~__tmp_1~0)))) (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 .cse1 (<= 2 main_~main__y~0)) (and .cse0 (<= 15 main_~main__y~0) .cse1 (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))))) [2020-07-08 23:41:04,690 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (= |old(~__return_65~0)| ~__return_65~0))) (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 (<= 2 main_~main__y~0)) (and .cse0 (<= 15 main_~main__y~0) (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))))) [2020-07-08 23:41:04,691 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (= |old(~__return_65~0)| ~__return_65~0) (<= (+ main_~main__x~0 1) main_~main__y~0)) [2020-07-08 23:41:04,691 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (= |old(~__return_65~0)| ~__return_65~0))) (or (and (<= (+ main_~main__x~0 50) 0) .cse0) (and (<= (+ main_~main__x~0 1) 0) (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0))) [2020-07-08 23:41:04,691 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) the Hoare annotation is: false [2020-07-08 23:41:04,691 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 58) the Hoare annotation is: (= |old(~__return_65~0)| ~__return_65~0) [2020-07-08 23:41:04,691 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (= |old(~__return_65~0)| ~__return_65~0) [2020-07-08 23:41:04,691 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-08 23:41:04,692 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-08 23:41:04,692 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: false [2020-07-08 23:41:04,692 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= |old(~__return_65~0)| ~__return_65~0) [2020-07-08 23:41:04,692 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-08 23:41:04,692 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 (= |old(~__return_65~0)| ~__return_65~0)) (.cse1 (not (= 0 main_~__tmp_1~0)))) (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 .cse1 (<= 2 main_~main__y~0)) (and .cse0 (<= 15 main_~main__y~0) .cse1 (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))))) [2020-07-08 23:41:04,692 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (= |old(~__return_65~0)| ~__return_65~0))) (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 (<= 2 main_~main__y~0)) (and .cse0 (<= 15 main_~main__y~0) (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))))) [2020-07-08 23:41:04,692 INFO L264 CegarLoopResult]: At program point L35(lines 28 56) the Hoare annotation is: (let ((.cse0 (= |old(~__return_65~0)| ~__return_65~0))) (or (and (<= (+ main_~main__x~0 50) 0) .cse0) (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0))) [2020-07-08 23:41:04,696 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:41:04,697 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 23:41:04,697 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 23:41:04,697 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-08 23:41:04,698 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-08 23:41:04,708 INFO L163 areAnnotationChecker]: CFG has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:41:04,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:41:04 BoogieIcfgContainer [2020-07-08 23:41:04,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:41:04,724 INFO L168 Benchmark]: Toolchain (without parser) took 7957.53 ms. Allocated memory was 137.9 MB in the beginning and 302.0 MB in the end (delta: 164.1 MB). Free memory was 103.0 MB in the beginning and 155.5 MB in the end (delta: -52.5 MB). Peak memory consumption was 111.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:04,725 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:41:04,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.19 ms. Allocated memory is still 137.9 MB. Free memory was 102.7 MB in the beginning and 92.9 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:41:04,726 INFO L168 Benchmark]: Boogie Preprocessor took 29.62 ms. Allocated memory is still 137.9 MB. Free memory was 92.9 MB in the beginning and 91.5 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:41:04,727 INFO L168 Benchmark]: RCFGBuilder took 410.35 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 91.3 MB in the beginning and 163.9 MB in the end (delta: -72.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:04,728 INFO L168 Benchmark]: TraceAbstraction took 7276.38 ms. Allocated memory was 202.9 MB in the beginning and 302.0 MB in the end (delta: 99.1 MB). Free memory was 163.0 MB in the beginning and 155.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 106.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:04,732 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.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 235.19 ms. Allocated memory is still 137.9 MB. Free memory was 102.7 MB in the beginning and 92.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.62 ms. Allocated memory is still 137.9 MB. Free memory was 92.9 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 410.35 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 91.3 MB in the beginning and 163.9 MB in the end (delta: -72.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7276.38 ms. Allocated memory was 202.9 MB in the beginning and 302.0 MB in the end (delta: 99.1 MB). Free memory was 163.0 MB in the beginning and 155.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 106.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: 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: 28]: Loop Invariant Derived loop invariant: (main__x + 50 <= 0 && \old(__return_65) == __return_65) || (main__x + 2 <= main__y && \old(__return_65) == __return_65) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.5s, OverallIterations: 6, TraceHistogramMax: 5, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 119 SDtfs, 259 SDslu, 209 SDs, 0 SdLazy, 851 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 34 PreInvPairs, 84 NumberOfFragments, 323 HoareAnnotationTreeSize, 34 FomulaSimplifications, 1456 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 34 FomulaSimplificationsInter, 413 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 19368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 45/95 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...