/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:52:06,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:52:06,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:52:06,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:52:06,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:52:06,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:52:06,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:52:06,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:52:06,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:52:06,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:52:06,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:52:06,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:52:06,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:52:06,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:52:06,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:52:06,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:52:06,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:52:06,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:52:06,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:52:06,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:52:06,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:52:06,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:52:06,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:52:06,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:52:06,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:52:06,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:52:06,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:52:06,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:52:06,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:52:06,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:52:06,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:52:06,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:52:06,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:52:06,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:52:06,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:52:06,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:52:06,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:52:06,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:52:06,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:52:06,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:52:06,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:52:06,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:52:06,485 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:52:06,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:52:06,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:52:06,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:52:06,487 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:52:06,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:52:06,487 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:52:06,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:52:06,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:52:06,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:52:06,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:52:06,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:52:06,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:52:06,489 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:52:06,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:52:06,489 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:52:06,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:52:06,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:52:06,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:52:06,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:52:06,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:52:06,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:52:06,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:52:06,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:52:06,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:52:06,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:52:06,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:52:06,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:52:06,492 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:52:06,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:52:06,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:52:06,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:52:06,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:52:06,812 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:52:06,813 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:52:06,814 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1.i [2020-07-17 22:52:06,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a508d8db/b15ae24452d54f9db8f1b1bc6d5480cc/FLAG0eeb976c1 [2020-07-17 22:52:07,383 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:52:07,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1.i [2020-07-17 22:52:07,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a508d8db/b15ae24452d54f9db8f1b1bc6d5480cc/FLAG0eeb976c1 [2020-07-17 22:52:07,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a508d8db/b15ae24452d54f9db8f1b1bc6d5480cc [2020-07-17 22:52:07,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:52:07,766 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:52:07,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:07,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:52:07,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:52:07,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:07" (1/1) ... [2020-07-17 22:52:07,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526d7b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:07, skipping insertion in model container [2020-07-17 22:52:07,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:07" (1/1) ... [2020-07-17 22:52:07,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:52:07,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:52:07,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:07,987 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:52:08,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:08,019 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:52:08,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08 WrapperNode [2020-07-17 22:52:08,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:08,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:52:08,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:52:08,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:52:08,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:52:08,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:52:08,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:52:08,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:52:08,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (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-17 22:52:08,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:52:08,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:52:08,207 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:52:08,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:52:08,207 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:52:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:52:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:52:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:52:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:52:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:52:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:52:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:52:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:52:08,520 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:52:08,520 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:52:08,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:08 BoogieIcfgContainer [2020-07-17 22:52:08,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:52:08,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:52:08,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:52:08,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:52:08,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:52:07" (1/3) ... [2020-07-17 22:52:08,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c9eaa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:08, skipping insertion in model container [2020-07-17 22:52:08,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (2/3) ... [2020-07-17 22:52:08,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c9eaa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:08, skipping insertion in model container [2020-07-17 22:52:08,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:08" (3/3) ... [2020-07-17 22:52:08,542 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_1.i [2020-07-17 22:52:08,554 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:52:08,562 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:52:08,577 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:52:08,603 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:52:08,603 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:52:08,603 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:52:08,603 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:52:08,604 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:52:08,604 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:52:08,604 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:52:08,604 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:52:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-17 22:52:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:52:08,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:08,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:08,631 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:08,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash 650151859, now seen corresponding path program 1 times [2020-07-17 22:52:08,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:08,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976321496] [2020-07-17 22:52:08,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:08,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:52:08,869 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2020-07-17 22:52:08,872 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-17 22:52:08,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:52:08,874 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2020-07-17 22:52:08,875 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2020-07-17 22:52:08,878 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~i~0 := 0; {26#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:08,880 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#(<= main_~i~0 0)} assume !(~i~0 < 1000000); {23#false} is VALID [2020-07-17 22:52:08,881 INFO L263 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {23#false} is VALID [2020-07-17 22:52:08,881 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-17 22:52:08,882 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-17 22:52:08,882 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-17 22:52:08,884 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-17 22:52:08,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976321496] [2020-07-17 22:52:08,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:08,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:52:08,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472534649] [2020-07-17 22:52:08,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-17 22:52:08,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:08,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:52:08,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:08,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:52:08,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:52:08,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:52:08,955 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-07-17 22:52:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:09,079 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-17 22:52:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:52:09,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-17 22:52:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:52:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-17 22:52:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:52:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-17 22:52:09,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2020-07-17 22:52:09,191 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-17 22:52:09,202 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:52:09,205 INFO L226 Difference]: Without dead ends: 14 [2020-07-17 22:52:09,209 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:52:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-17 22:52:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-17 22:52:09,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:09,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2020-07-17 22:52:09,262 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2020-07-17 22:52:09,262 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2020-07-17 22:52:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:09,266 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-17 22:52:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:52:09,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:09,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:09,267 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2020-07-17 22:52:09,268 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2020-07-17 22:52:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:09,271 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-17 22:52:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:52:09,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:09,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:09,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:09,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:52:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-17 22:52:09,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2020-07-17 22:52:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:09,278 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-17 22:52:09,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:52:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-17 22:52:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-17 22:52:09,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:09,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:09,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:52:09,280 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:09,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1133927695, now seen corresponding path program 1 times [2020-07-17 22:52:09,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:09,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592365930] [2020-07-17 22:52:09,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-17 22:52:09,347 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {121#true} {121#true} #41#return; {121#true} is VALID [2020-07-17 22:52:09,347 INFO L263 TraceCheckUtils]: 0: Hoare triple {121#true} call ULTIMATE.init(); {121#true} is VALID [2020-07-17 22:52:09,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-17 22:52:09,348 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} #41#return; {121#true} is VALID [2020-07-17 22:52:09,348 INFO L263 TraceCheckUtils]: 3: Hoare triple {121#true} call #t~ret1 := main(); {121#true} is VALID [2020-07-17 22:52:09,350 INFO L280 TraceCheckUtils]: 4: Hoare triple {121#true} havoc ~i~0;~i~0 := 0; {125#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,351 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {125#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,352 INFO L280 TraceCheckUtils]: 6: Hoare triple {125#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {126#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:09,354 INFO L280 TraceCheckUtils]: 7: Hoare triple {126#(<= main_~i~0 1)} assume !(~i~0 < 1000000); {122#false} is VALID [2020-07-17 22:52:09,354 INFO L263 TraceCheckUtils]: 8: Hoare triple {122#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {122#false} is VALID [2020-07-17 22:52:09,354 INFO L280 TraceCheckUtils]: 9: Hoare triple {122#false} ~cond := #in~cond; {122#false} is VALID [2020-07-17 22:52:09,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {122#false} assume 0 == ~cond; {122#false} is VALID [2020-07-17 22:52:09,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {122#false} assume !false; {122#false} is VALID [2020-07-17 22:52:09,356 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-17 22:52:09,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592365930] [2020-07-17 22:52:09,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769408217] [2020-07-17 22:52:09,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:52:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:09,478 INFO L263 TraceCheckUtils]: 0: Hoare triple {121#true} call ULTIMATE.init(); {121#true} is VALID [2020-07-17 22:52:09,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-17 22:52:09,479 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} #41#return; {121#true} is VALID [2020-07-17 22:52:09,480 INFO L263 TraceCheckUtils]: 3: Hoare triple {121#true} call #t~ret1 := main(); {121#true} is VALID [2020-07-17 22:52:09,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {121#true} havoc ~i~0;~i~0 := 0; {125#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,482 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {125#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,484 INFO L280 TraceCheckUtils]: 6: Hoare triple {125#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {126#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:09,486 INFO L280 TraceCheckUtils]: 7: Hoare triple {126#(<= main_~i~0 1)} assume !(~i~0 < 1000000); {122#false} is VALID [2020-07-17 22:52:09,486 INFO L263 TraceCheckUtils]: 8: Hoare triple {122#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {122#false} is VALID [2020-07-17 22:52:09,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {122#false} ~cond := #in~cond; {122#false} is VALID [2020-07-17 22:52:09,487 INFO L280 TraceCheckUtils]: 10: Hoare triple {122#false} assume 0 == ~cond; {122#false} is VALID [2020-07-17 22:52:09,488 INFO L280 TraceCheckUtils]: 11: Hoare triple {122#false} assume !false; {122#false} is VALID [2020-07-17 22:52:09,489 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-17 22:52:09,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:09,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-17 22:52:09,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660899750] [2020-07-17 22:52:09,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-17 22:52:09,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:09,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:52:09,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:09,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:52:09,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:09,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:52:09,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:52:09,516 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2020-07-17 22:52:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:09,591 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-17 22:52:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:52:09,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-17 22:52:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:52:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-17 22:52:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:52:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-17 22:52:09,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2020-07-17 22:52:09,632 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-17 22:52:09,634 INFO L225 Difference]: With dead ends: 21 [2020-07-17 22:52:09,634 INFO L226 Difference]: Without dead ends: 16 [2020-07-17 22:52:09,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:52:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-17 22:52:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-17 22:52:09,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:09,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2020-07-17 22:52:09,649 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2020-07-17 22:52:09,649 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2020-07-17 22:52:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:09,652 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-17 22:52:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:52:09,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:09,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:09,653 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2020-07-17 22:52:09,653 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2020-07-17 22:52:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:09,668 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-17 22:52:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:52:09,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:09,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:09,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:09,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:52:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-17 22:52:09,672 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2020-07-17 22:52:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:09,672 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-17 22:52:09,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:52:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-17 22:52:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:52:09,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:09,673 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:09,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:52:09,889 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:09,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:09,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1942427985, now seen corresponding path program 2 times [2020-07-17 22:52:09,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:09,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575760702] [2020-07-17 22:52:09,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {250#true} assume true; {250#true} is VALID [2020-07-17 22:52:09,965 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {250#true} {250#true} #41#return; {250#true} is VALID [2020-07-17 22:52:09,966 INFO L263 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2020-07-17 22:52:09,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {250#true} assume true; {250#true} is VALID [2020-07-17 22:52:09,966 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {250#true} {250#true} #41#return; {250#true} is VALID [2020-07-17 22:52:09,967 INFO L263 TraceCheckUtils]: 3: Hoare triple {250#true} call #t~ret1 := main(); {250#true} is VALID [2020-07-17 22:52:09,968 INFO L280 TraceCheckUtils]: 4: Hoare triple {250#true} havoc ~i~0;~i~0 := 0; {254#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,969 INFO L280 TraceCheckUtils]: 5: Hoare triple {254#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {254#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,971 INFO L280 TraceCheckUtils]: 6: Hoare triple {254#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {255#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:09,973 INFO L280 TraceCheckUtils]: 7: Hoare triple {255#(<= main_~i~0 1)} assume !!(~i~0 < 1000000); {255#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:09,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {255#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {256#(<= main_~i~0 2)} is VALID [2020-07-17 22:52:09,976 INFO L280 TraceCheckUtils]: 9: Hoare triple {256#(<= main_~i~0 2)} assume !(~i~0 < 1000000); {251#false} is VALID [2020-07-17 22:52:09,980 INFO L263 TraceCheckUtils]: 10: Hoare triple {251#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {251#false} is VALID [2020-07-17 22:52:09,980 INFO L280 TraceCheckUtils]: 11: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2020-07-17 22:52:09,980 INFO L280 TraceCheckUtils]: 12: Hoare triple {251#false} assume 0 == ~cond; {251#false} is VALID [2020-07-17 22:52:09,981 INFO L280 TraceCheckUtils]: 13: Hoare triple {251#false} assume !false; {251#false} is VALID [2020-07-17 22:52:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:09,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575760702] [2020-07-17 22:52:09,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804671911] [2020-07-17 22:52:09,982 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:10,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:52:10,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:10,022 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:52:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:10,084 INFO L263 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2020-07-17 22:52:10,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {250#true} assume true; {250#true} is VALID [2020-07-17 22:52:10,085 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {250#true} {250#true} #41#return; {250#true} is VALID [2020-07-17 22:52:10,085 INFO L263 TraceCheckUtils]: 3: Hoare triple {250#true} call #t~ret1 := main(); {250#true} is VALID [2020-07-17 22:52:10,086 INFO L280 TraceCheckUtils]: 4: Hoare triple {250#true} havoc ~i~0;~i~0 := 0; {254#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,087 INFO L280 TraceCheckUtils]: 5: Hoare triple {254#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {254#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,089 INFO L280 TraceCheckUtils]: 6: Hoare triple {254#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {255#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:10,089 INFO L280 TraceCheckUtils]: 7: Hoare triple {255#(<= main_~i~0 1)} assume !!(~i~0 < 1000000); {255#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:10,091 INFO L280 TraceCheckUtils]: 8: Hoare triple {255#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {256#(<= main_~i~0 2)} is VALID [2020-07-17 22:52:10,092 INFO L280 TraceCheckUtils]: 9: Hoare triple {256#(<= main_~i~0 2)} assume !(~i~0 < 1000000); {251#false} is VALID [2020-07-17 22:52:10,092 INFO L263 TraceCheckUtils]: 10: Hoare triple {251#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {251#false} is VALID [2020-07-17 22:52:10,092 INFO L280 TraceCheckUtils]: 11: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2020-07-17 22:52:10,093 INFO L280 TraceCheckUtils]: 12: Hoare triple {251#false} assume 0 == ~cond; {251#false} is VALID [2020-07-17 22:52:10,093 INFO L280 TraceCheckUtils]: 13: Hoare triple {251#false} assume !false; {251#false} is VALID [2020-07-17 22:52:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:10,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:10,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-17 22:52:10,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225068499] [2020-07-17 22:52:10,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:52:10,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:10,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:52:10,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:10,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:52:10,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:10,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:52:10,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:52:10,116 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2020-07-17 22:52:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,174 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-17 22:52:10,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:52:10,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:52:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-17 22:52:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-17 22:52:10,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2020-07-17 22:52:10,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:10,213 INFO L225 Difference]: With dead ends: 23 [2020-07-17 22:52:10,213 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:52:10,214 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:52:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:52:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-17 22:52:10,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:10,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-17 22:52:10,227 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-17 22:52:10,227 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-17 22:52:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,229 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:52:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:52:10,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:10,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:10,230 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-17 22:52:10,230 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-17 22:52:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,232 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:52:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:52:10,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:10,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:10,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:10,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:52:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-17 22:52:10,235 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2020-07-17 22:52:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:10,236 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-17 22:52:10,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:52:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-17 22:52:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:52:10,237 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:10,237 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:10,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:10,452 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1522126099, now seen corresponding path program 3 times [2020-07-17 22:52:10,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:10,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520487466] [2020-07-17 22:52:10,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {396#true} assume true; {396#true} is VALID [2020-07-17 22:52:10,542 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {396#true} {396#true} #41#return; {396#true} is VALID [2020-07-17 22:52:10,543 INFO L263 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {396#true} is VALID [2020-07-17 22:52:10,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {396#true} assume true; {396#true} is VALID [2020-07-17 22:52:10,544 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {396#true} {396#true} #41#return; {396#true} is VALID [2020-07-17 22:52:10,544 INFO L263 TraceCheckUtils]: 3: Hoare triple {396#true} call #t~ret1 := main(); {396#true} is VALID [2020-07-17 22:52:10,545 INFO L280 TraceCheckUtils]: 4: Hoare triple {396#true} havoc ~i~0;~i~0 := 0; {400#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,547 INFO L280 TraceCheckUtils]: 5: Hoare triple {400#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {400#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,548 INFO L280 TraceCheckUtils]: 6: Hoare triple {400#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {401#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:10,550 INFO L280 TraceCheckUtils]: 7: Hoare triple {401#(<= main_~i~0 1)} assume !!(~i~0 < 1000000); {401#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:10,553 INFO L280 TraceCheckUtils]: 8: Hoare triple {401#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {402#(<= main_~i~0 2)} is VALID [2020-07-17 22:52:10,554 INFO L280 TraceCheckUtils]: 9: Hoare triple {402#(<= main_~i~0 2)} assume !!(~i~0 < 1000000); {402#(<= main_~i~0 2)} is VALID [2020-07-17 22:52:10,556 INFO L280 TraceCheckUtils]: 10: Hoare triple {402#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {403#(<= main_~i~0 3)} is VALID [2020-07-17 22:52:10,557 INFO L280 TraceCheckUtils]: 11: Hoare triple {403#(<= main_~i~0 3)} assume !(~i~0 < 1000000); {397#false} is VALID [2020-07-17 22:52:10,557 INFO L263 TraceCheckUtils]: 12: Hoare triple {397#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {397#false} is VALID [2020-07-17 22:52:10,558 INFO L280 TraceCheckUtils]: 13: Hoare triple {397#false} ~cond := #in~cond; {397#false} is VALID [2020-07-17 22:52:10,558 INFO L280 TraceCheckUtils]: 14: Hoare triple {397#false} assume 0 == ~cond; {397#false} is VALID [2020-07-17 22:52:10,558 INFO L280 TraceCheckUtils]: 15: Hoare triple {397#false} assume !false; {397#false} is VALID [2020-07-17 22:52:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:10,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520487466] [2020-07-17 22:52:10,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420065472] [2020-07-17 22:52:10,560 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:52:10,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:52:10,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:10,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:10,694 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:52:10,754 INFO L263 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {396#true} is VALID [2020-07-17 22:52:10,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {396#true} assume true; {396#true} is VALID [2020-07-17 22:52:10,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {396#true} {396#true} #41#return; {396#true} is VALID [2020-07-17 22:52:10,756 INFO L263 TraceCheckUtils]: 3: Hoare triple {396#true} call #t~ret1 := main(); {396#true} is VALID [2020-07-17 22:52:10,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {396#true} havoc ~i~0;~i~0 := 0; {396#true} is VALID [2020-07-17 22:52:10,756 INFO L280 TraceCheckUtils]: 5: Hoare triple {396#true} assume !!(~i~0 < 1000000); {396#true} is VALID [2020-07-17 22:52:10,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {396#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {396#true} is VALID [2020-07-17 22:52:10,757 INFO L280 TraceCheckUtils]: 7: Hoare triple {396#true} assume !!(~i~0 < 1000000); {396#true} is VALID [2020-07-17 22:52:10,757 INFO L280 TraceCheckUtils]: 8: Hoare triple {396#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {396#true} is VALID [2020-07-17 22:52:10,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {396#true} assume !!(~i~0 < 1000000); {434#(< main_~i~0 1000000)} is VALID [2020-07-17 22:52:10,760 INFO L280 TraceCheckUtils]: 10: Hoare triple {434#(< main_~i~0 1000000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {438#(<= main_~i~0 1000000)} is VALID [2020-07-17 22:52:10,761 INFO L280 TraceCheckUtils]: 11: Hoare triple {438#(<= main_~i~0 1000000)} assume !(~i~0 < 1000000); {442#(and (<= main_~i~0 1000000) (<= 1000000 main_~i~0))} is VALID [2020-07-17 22:52:10,763 INFO L263 TraceCheckUtils]: 12: Hoare triple {442#(and (<= main_~i~0 1000000) (<= 1000000 main_~i~0))} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:10,764 INFO L280 TraceCheckUtils]: 13: Hoare triple {446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:10,765 INFO L280 TraceCheckUtils]: 14: Hoare triple {450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {397#false} is VALID [2020-07-17 22:52:10,765 INFO L280 TraceCheckUtils]: 15: Hoare triple {397#false} assume !false; {397#false} is VALID [2020-07-17 22:52:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:52:10,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:10,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2020-07-17 22:52:10,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421005109] [2020-07-17 22:52:10,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-17 22:52:10,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:10,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:52:10,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:10,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:52:10,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:52:10,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:52:10,789 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2020-07-17 22:52:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,876 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-17 22:52:10,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:52:10,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-17 22:52:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2020-07-17 22:52:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2020-07-17 22:52:10,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 13 transitions. [2020-07-17 22:52:10,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:10,901 INFO L225 Difference]: With dead ends: 17 [2020-07-17 22:52:10,901 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:52:10,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:52:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:52:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:52:10,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:10,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:10,903 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:10,903 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,903 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:10,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:10,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:10,904 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:10,904 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,905 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:10,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:10,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:10,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:10,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:52:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:52:10,907 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-07-17 22:52:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:10,907 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:52:10,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:52:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:10,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:11,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:11,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:52:11,187 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:52:11,188 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:11,188 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:11,188 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:52:11,188 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:52:11,189 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:52:11,189 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:11,189 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:52:11,189 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:11,189 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:11,189 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 18) the Hoare annotation is: true [2020-07-17 22:52:11,190 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 18) no Hoare annotation was computed. [2020-07-17 22:52:11,190 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-17 22:52:11,190 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-17 22:52:11,190 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 18) no Hoare annotation was computed. [2020-07-17 22:52:11,190 INFO L264 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (<= main_~i~0 1000000) [2020-07-17 22:52:11,191 INFO L264 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (and (<= main_~i~0 1000000) (<= 1000000 main_~i~0)) [2020-07-17 22:52:11,191 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:52:11,191 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:52:11,191 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:52:11,191 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:52:11,191 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:52:11,192 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:52:11,196 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:11,197 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:52:11,198 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:11,198 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:11,198 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:11,198 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:52:11,198 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:52:11,199 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-17 22:52:11,200 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:11,200 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:11,200 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:11,200 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:52:11,200 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:52:11,200 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-17 22:52:11,201 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:11,201 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:11,201 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:52:11,201 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:52:11,201 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:52:11,201 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:52:11,202 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:52:11,202 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:52:11,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:52:11 BoogieIcfgContainer [2020-07-17 22:52:11,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:52:11,218 INFO L168 Benchmark]: Toolchain (without parser) took 3452.19 ms. Allocated memory was 146.3 MB in the beginning and 235.4 MB in the end (delta: 89.1 MB). Free memory was 104.8 MB in the beginning and 98.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 95.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:11,219 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:52:11,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.01 ms. Allocated memory is still 146.3 MB. Free memory was 104.4 MB in the beginning and 95.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:11,221 INFO L168 Benchmark]: Boogie Preprocessor took 31.30 ms. Allocated memory is still 146.3 MB. Free memory was 95.0 MB in the beginning and 93.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:11,222 INFO L168 Benchmark]: RCFGBuilder took 478.94 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.4 MB in the beginning and 168.8 MB in the end (delta: -75.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:11,223 INFO L168 Benchmark]: TraceAbstraction took 2678.55 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 168.2 MB in the beginning and 98.1 MB in the end (delta: 70.1 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:11,227 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.55 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 253.01 ms. Allocated memory is still 146.3 MB. Free memory was 104.4 MB in the beginning and 95.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.30 ms. Allocated memory is still 146.3 MB. Free memory was 95.0 MB in the beginning and 93.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 478.94 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.4 MB in the beginning and 168.8 MB in the end (delta: -75.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2678.55 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 168.2 MB in the beginning and 98.1 MB in the end (delta: 70.1 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: i <= 1000000 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 43 SDtfs, 10 SDslu, 60 SDs, 0 SdLazy, 39 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 15 HoareAnnotationTreeSize, 10 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 94 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 1941 SizeOfPredicates, 3 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 9/28 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...