/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_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:22,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:22,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:22,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:22,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:22,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:22,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:22,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:22,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:22,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:22,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:22,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:22,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:22,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:22,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:22,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:22,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:22,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:22,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:22,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:22,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:22,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:22,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:22,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:22,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:22,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:22,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:22,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:22,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:22,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:22,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:22,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:22,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:22,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:22,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:22,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:22,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:22,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:22,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:22,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:22,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:22,421 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-10 15:29:22,435 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:22,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:22,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:22,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:22,437 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:22,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:22,437 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:22,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:22,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:22,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:22,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:22,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:22,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:22,439 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:22,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:22,439 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:22,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:22,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:22,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:22,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:22,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:22,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:22,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:22,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:22,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:22,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:22,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:22,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:22,442 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:22,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:22,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:22,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:22,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:22,712 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:22,712 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:22,713 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1_variant.i [2020-07-10 15:29:22,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e1ce514/d433438780db4cf2a6597a3103763668/FLAGef492072b [2020-07-10 15:29:23,211 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:23,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant.i [2020-07-10 15:29:23,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e1ce514/d433438780db4cf2a6597a3103763668/FLAGef492072b [2020-07-10 15:29:23,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e1ce514/d433438780db4cf2a6597a3103763668 [2020-07-10 15:29:23,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:23,603 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:23,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:23,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:23,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:23,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26419898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23, skipping insertion in model container [2020-07-10 15:29:23,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:23,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:23,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:23,791 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:23,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:23,822 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:23,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23 WrapperNode [2020-07-10 15:29:23,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:23,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:23,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:23,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:23,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (1/1) ... [2020-07-10 15:29:23,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:23,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:23,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:23,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:23,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (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-10 15:29:23,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:23,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:23,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:23,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:29:23,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:24,196 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:24,197 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:29:24,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:24 BoogieIcfgContainer [2020-07-10 15:29:24,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:24,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:24,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:24,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:24,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:23" (1/3) ... [2020-07-10 15:29:24,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a8a49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:24, skipping insertion in model container [2020-07-10 15:29:24,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:23" (2/3) ... [2020-07-10 15:29:24,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a8a49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:24, skipping insertion in model container [2020-07-10 15:29:24,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:24" (3/3) ... [2020-07-10 15:29:24,229 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.i [2020-07-10 15:29:24,256 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:24,266 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:24,289 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:24,312 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:24,312 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:24,312 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:24,313 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:24,313 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:24,313 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:24,313 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:24,313 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-10 15:29:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:29:24,333 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:24,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:24,334 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash 651998901, now seen corresponding path program 1 times [2020-07-10 15:29:24,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:24,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990026438] [2020-07-10 15:29:24,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:24,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:29:24,589 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2020-07-10 15:29:24,590 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-10 15:29:24,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:29:24,591 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2020-07-10 15:29:24,591 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2020-07-10 15:29:24,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~i~0 := 0; {26#(<= main_~i~0 1000000)} is VALID [2020-07-10 15:29:24,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#(<= main_~i~0 1000000)} assume !!(1000000 != ~i~0); {26#(<= main_~i~0 1000000)} is VALID [2020-07-10 15:29:24,595 INFO L263 TraceCheckUtils]: 6: Hoare triple {26#(<= main_~i~0 1000000)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {27#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:24,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {28#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:24,600 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {23#false} is VALID [2020-07-10 15:29:24,601 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-10 15:29:24,602 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-10 15:29:24,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990026438] [2020-07-10 15:29:24,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:24,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:29:24,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941322788] [2020-07-10 15:29:24,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:29:24,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:24,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:29:24,646 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-10 15:29:24,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:29:24,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:29:24,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:29:24,656 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2020-07-10 15:29:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:24,866 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2020-07-10 15:29:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:29:24,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:29:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-10 15:29:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-10 15:29:24,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2020-07-10 15:29:24,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:24,975 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:29:24,975 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 15:29:24,979 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 15:29:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-10 15:29:25,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:25,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2020-07-10 15:29:25,024 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2020-07-10 15:29:25,024 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2020-07-10 15:29:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:25,028 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 15:29:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 15:29:25,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:25,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:25,030 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2020-07-10 15:29:25,030 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2020-07-10 15:29:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:25,033 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 15:29:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 15:29:25,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:25,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:25,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:25,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:29:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-10 15:29:25,039 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2020-07-10 15:29:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:25,040 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-10 15:29:25,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:29:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-10 15:29:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:29:25,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:25,042 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:25,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:25,043 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1822329080, now seen corresponding path program 1 times [2020-07-10 15:29:25,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:25,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335134875] [2020-07-10 15:29:25,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-10 15:29:25,133 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {158#true} {158#true} #41#return; {158#true} is VALID [2020-07-10 15:29:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {158#true} ~cond := #in~cond; {158#true} is VALID [2020-07-10 15:29:25,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {158#true} assume !(0 == ~cond); {158#true} is VALID [2020-07-10 15:29:25,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-10 15:29:25,145 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {158#true} {162#(<= main_~i~0 0)} #45#return; {162#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,145 INFO L263 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {158#true} is VALID [2020-07-10 15:29:25,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-10 15:29:25,146 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #41#return; {158#true} is VALID [2020-07-10 15:29:25,146 INFO L263 TraceCheckUtils]: 3: Hoare triple {158#true} call #t~ret1 := main(); {158#true} is VALID [2020-07-10 15:29:25,147 INFO L280 TraceCheckUtils]: 4: Hoare triple {158#true} havoc ~i~0;~i~0 := 0; {162#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,148 INFO L280 TraceCheckUtils]: 5: Hoare triple {162#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {162#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,148 INFO L263 TraceCheckUtils]: 6: Hoare triple {162#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {158#true} is VALID [2020-07-10 15:29:25,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {158#true} ~cond := #in~cond; {158#true} is VALID [2020-07-10 15:29:25,149 INFO L280 TraceCheckUtils]: 8: Hoare triple {158#true} assume !(0 == ~cond); {158#true} is VALID [2020-07-10 15:29:25,149 INFO L280 TraceCheckUtils]: 9: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-10 15:29:25,151 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {158#true} {162#(<= main_~i~0 0)} #45#return; {162#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,152 INFO L280 TraceCheckUtils]: 11: Hoare triple {162#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {167#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:25,153 INFO L280 TraceCheckUtils]: 12: Hoare triple {167#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {167#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:25,154 INFO L263 TraceCheckUtils]: 13: Hoare triple {167#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {168#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:25,155 INFO L280 TraceCheckUtils]: 14: Hoare triple {168#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {169#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:25,156 INFO L280 TraceCheckUtils]: 15: Hoare triple {169#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {159#false} is VALID [2020-07-10 15:29:25,156 INFO L280 TraceCheckUtils]: 16: Hoare triple {159#false} assume !false; {159#false} is VALID [2020-07-10 15:29:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:25,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335134875] [2020-07-10 15:29:25,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335550369] [2020-07-10 15:29:25,160 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-10 15:29:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:29:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:25,290 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:25,337 INFO L263 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {158#true} is VALID [2020-07-10 15:29:25,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-10 15:29:25,338 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #41#return; {158#true} is VALID [2020-07-10 15:29:25,338 INFO L263 TraceCheckUtils]: 3: Hoare triple {158#true} call #t~ret1 := main(); {158#true} is VALID [2020-07-10 15:29:25,339 INFO L280 TraceCheckUtils]: 4: Hoare triple {158#true} havoc ~i~0;~i~0 := 0; {162#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {162#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {162#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,340 INFO L263 TraceCheckUtils]: 6: Hoare triple {162#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {158#true} is VALID [2020-07-10 15:29:25,340 INFO L280 TraceCheckUtils]: 7: Hoare triple {158#true} ~cond := #in~cond; {158#true} is VALID [2020-07-10 15:29:25,341 INFO L280 TraceCheckUtils]: 8: Hoare triple {158#true} assume !(0 == ~cond); {158#true} is VALID [2020-07-10 15:29:25,341 INFO L280 TraceCheckUtils]: 9: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-10 15:29:25,342 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {158#true} {162#(<= main_~i~0 0)} #45#return; {162#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {162#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {167#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:25,344 INFO L280 TraceCheckUtils]: 12: Hoare triple {167#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {167#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:25,345 INFO L263 TraceCheckUtils]: 13: Hoare triple {167#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {212#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:25,346 INFO L280 TraceCheckUtils]: 14: Hoare triple {212#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {216#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:25,347 INFO L280 TraceCheckUtils]: 15: Hoare triple {216#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {159#false} is VALID [2020-07-10 15:29:25,347 INFO L280 TraceCheckUtils]: 16: Hoare triple {159#false} assume !false; {159#false} is VALID [2020-07-10 15:29:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:25,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:25,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-10 15:29:25,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336740680] [2020-07-10 15:29:25,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-10 15:29:25,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:25,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:29:25,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:25,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:29:25,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:25,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:29:25,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:25,375 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2020-07-10 15:29:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:25,553 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2020-07-10 15:29:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:25,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-10 15:29:25,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-07-10 15:29:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-07-10 15:29:25,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2020-07-10 15:29:25,592 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-10 15:29:25,595 INFO L225 Difference]: With dead ends: 30 [2020-07-10 15:29:25,595 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:29:25,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:29:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:29:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-10 15:29:25,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:25,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-10 15:29:25,613 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-10 15:29:25,613 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-10 15:29:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:25,616 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 15:29:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 15:29:25,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:25,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:25,617 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-10 15:29:25,617 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-10 15:29:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:25,620 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 15:29:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 15:29:25,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:25,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:25,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:25,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:29:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-10 15:29:25,624 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2020-07-10 15:29:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:25,625 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-10 15:29:25,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:29:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 15:29:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:29:25,626 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:25,626 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:25,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:29:25,832 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1510359893, now seen corresponding path program 2 times [2020-07-10 15:29:25,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:25,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001109173] [2020-07-10 15:29:25,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,937 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-10 15:29:25,938 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {363#true} {363#true} #41#return; {363#true} is VALID [2020-07-10 15:29:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-10 15:29:25,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-10 15:29:25,972 INFO L280 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-10 15:29:25,973 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {363#true} {367#(<= main_~i~0 0)} #45#return; {367#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-10 15:29:25,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-10 15:29:25,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-10 15:29:25,984 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {363#true} {372#(<= main_~i~0 1)} #45#return; {372#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:25,984 INFO L263 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {363#true} is VALID [2020-07-10 15:29:25,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-10 15:29:25,985 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #41#return; {363#true} is VALID [2020-07-10 15:29:25,985 INFO L263 TraceCheckUtils]: 3: Hoare triple {363#true} call #t~ret1 := main(); {363#true} is VALID [2020-07-10 15:29:25,986 INFO L280 TraceCheckUtils]: 4: Hoare triple {363#true} havoc ~i~0;~i~0 := 0; {367#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,987 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {367#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,987 INFO L263 TraceCheckUtils]: 6: Hoare triple {367#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {363#true} is VALID [2020-07-10 15:29:25,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-10 15:29:25,987 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-10 15:29:25,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-10 15:29:25,989 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {363#true} {367#(<= main_~i~0 0)} #45#return; {367#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:25,990 INFO L280 TraceCheckUtils]: 11: Hoare triple {367#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {372#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:25,990 INFO L280 TraceCheckUtils]: 12: Hoare triple {372#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {372#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:25,991 INFO L263 TraceCheckUtils]: 13: Hoare triple {372#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {363#true} is VALID [2020-07-10 15:29:25,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-10 15:29:25,991 INFO L280 TraceCheckUtils]: 15: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-10 15:29:25,991 INFO L280 TraceCheckUtils]: 16: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-10 15:29:25,992 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {363#true} {372#(<= main_~i~0 1)} #45#return; {372#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:25,993 INFO L280 TraceCheckUtils]: 18: Hoare triple {372#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {377#(<= main_~i~0 2)} is VALID [2020-07-10 15:29:25,994 INFO L280 TraceCheckUtils]: 19: Hoare triple {377#(<= main_~i~0 2)} assume !!(1000000 != ~i~0); {377#(<= main_~i~0 2)} is VALID [2020-07-10 15:29:25,995 INFO L263 TraceCheckUtils]: 20: Hoare triple {377#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {378#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:25,996 INFO L280 TraceCheckUtils]: 21: Hoare triple {378#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {379#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:25,997 INFO L280 TraceCheckUtils]: 22: Hoare triple {379#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {364#false} is VALID [2020-07-10 15:29:25,997 INFO L280 TraceCheckUtils]: 23: Hoare triple {364#false} assume !false; {364#false} is VALID [2020-07-10 15:29:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:29:25,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001109173] [2020-07-10 15:29:25,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438260763] [2020-07-10 15:29:25,999 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-10 15:29:26,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:29:26,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:26,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:29:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:26,097 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:26,140 INFO L263 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {363#true} is VALID [2020-07-10 15:29:26,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-10 15:29:26,141 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #41#return; {363#true} is VALID [2020-07-10 15:29:26,142 INFO L263 TraceCheckUtils]: 3: Hoare triple {363#true} call #t~ret1 := main(); {363#true} is VALID [2020-07-10 15:29:26,142 INFO L280 TraceCheckUtils]: 4: Hoare triple {363#true} havoc ~i~0;~i~0 := 0; {367#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:26,143 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {367#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:26,144 INFO L263 TraceCheckUtils]: 6: Hoare triple {367#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {363#true} is VALID [2020-07-10 15:29:26,144 INFO L280 TraceCheckUtils]: 7: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-10 15:29:26,144 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-10 15:29:26,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-10 15:29:26,146 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {363#true} {367#(<= main_~i~0 0)} #45#return; {367#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:26,147 INFO L280 TraceCheckUtils]: 11: Hoare triple {367#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {372#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:26,147 INFO L280 TraceCheckUtils]: 12: Hoare triple {372#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {372#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:26,148 INFO L263 TraceCheckUtils]: 13: Hoare triple {372#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {363#true} is VALID [2020-07-10 15:29:26,148 INFO L280 TraceCheckUtils]: 14: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-10 15:29:26,149 INFO L280 TraceCheckUtils]: 15: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-10 15:29:26,149 INFO L280 TraceCheckUtils]: 16: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-10 15:29:26,150 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {363#true} {372#(<= main_~i~0 1)} #45#return; {372#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:26,151 INFO L280 TraceCheckUtils]: 18: Hoare triple {372#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {377#(<= main_~i~0 2)} is VALID [2020-07-10 15:29:26,152 INFO L280 TraceCheckUtils]: 19: Hoare triple {377#(<= main_~i~0 2)} assume !!(1000000 != ~i~0); {377#(<= main_~i~0 2)} is VALID [2020-07-10 15:29:26,153 INFO L263 TraceCheckUtils]: 20: Hoare triple {377#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:26,154 INFO L280 TraceCheckUtils]: 21: Hoare triple {443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:26,155 INFO L280 TraceCheckUtils]: 22: Hoare triple {447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {364#false} is VALID [2020-07-10 15:29:26,155 INFO L280 TraceCheckUtils]: 23: Hoare triple {364#false} assume !false; {364#false} is VALID [2020-07-10 15:29:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:29:26,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:26,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-10 15:29:26,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882122728] [2020-07-10 15:29:26,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-10 15:29:26,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:26,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:29:26,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:26,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:29:26,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:26,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:29:26,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:29:26,189 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2020-07-10 15:29:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:26,359 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-10 15:29:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:29:26,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-10 15:29:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:29:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-10 15:29:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:29:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-10 15:29:26,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2020-07-10 15:29:26,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:26,414 INFO L225 Difference]: With dead ends: 37 [2020-07-10 15:29:26,414 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:29:26,415 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:29:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-10 15:29:26,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:26,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-10 15:29:26,432 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-10 15:29:26,432 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-10 15:29:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:26,434 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-10 15:29:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-10 15:29:26,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:26,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:26,436 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-10 15:29:26,436 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-10 15:29:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:26,438 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-10 15:29:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-10 15:29:26,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:26,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:26,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:26,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:29:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-10 15:29:26,442 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-10 15:29:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:26,443 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-10 15:29:26,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:29:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 15:29:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:29:26,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:26,444 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:26,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:26,646 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:26,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1096709736, now seen corresponding path program 3 times [2020-07-10 15:29:26,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:26,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694420423] [2020-07-10 15:29:26,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,757 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {628#true} {628#true} #41#return; {628#true} is VALID [2020-07-10 15:29:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-10 15:29:26,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-10 15:29:26,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,770 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {628#true} {632#(<= main_~i~0 0)} #45#return; {632#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-10 15:29:26,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-10 15:29:26,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,780 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {628#true} {637#(<= main_~i~0 1)} #45#return; {637#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,786 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-10 15:29:26,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-10 15:29:26,787 INFO L280 TraceCheckUtils]: 2: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,788 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {628#true} {642#(<= main_~i~0 2)} #45#return; {642#(<= main_~i~0 2)} is VALID [2020-07-10 15:29:26,788 INFO L263 TraceCheckUtils]: 0: Hoare triple {628#true} call ULTIMATE.init(); {628#true} is VALID [2020-07-10 15:29:26,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,789 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {628#true} {628#true} #41#return; {628#true} is VALID [2020-07-10 15:29:26,789 INFO L263 TraceCheckUtils]: 3: Hoare triple {628#true} call #t~ret1 := main(); {628#true} is VALID [2020-07-10 15:29:26,790 INFO L280 TraceCheckUtils]: 4: Hoare triple {628#true} havoc ~i~0;~i~0 := 0; {632#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:26,793 INFO L280 TraceCheckUtils]: 5: Hoare triple {632#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {632#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:26,794 INFO L263 TraceCheckUtils]: 6: Hoare triple {632#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {628#true} is VALID [2020-07-10 15:29:26,794 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-10 15:29:26,794 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-10 15:29:26,795 INFO L280 TraceCheckUtils]: 9: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,795 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {628#true} {632#(<= main_~i~0 0)} #45#return; {632#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:26,796 INFO L280 TraceCheckUtils]: 11: Hoare triple {632#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {637#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:26,797 INFO L280 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {637#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:26,797 INFO L263 TraceCheckUtils]: 13: Hoare triple {637#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {628#true} is VALID [2020-07-10 15:29:26,797 INFO L280 TraceCheckUtils]: 14: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-10 15:29:26,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-10 15:29:26,798 INFO L280 TraceCheckUtils]: 16: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,799 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {628#true} {637#(<= main_~i~0 1)} #45#return; {637#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:26,800 INFO L280 TraceCheckUtils]: 18: Hoare triple {637#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {642#(<= main_~i~0 2)} is VALID [2020-07-10 15:29:26,800 INFO L280 TraceCheckUtils]: 19: Hoare triple {642#(<= main_~i~0 2)} assume !!(1000000 != ~i~0); {642#(<= main_~i~0 2)} is VALID [2020-07-10 15:29:26,801 INFO L263 TraceCheckUtils]: 20: Hoare triple {642#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {628#true} is VALID [2020-07-10 15:29:26,801 INFO L280 TraceCheckUtils]: 21: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-10 15:29:26,801 INFO L280 TraceCheckUtils]: 22: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-10 15:29:26,801 INFO L280 TraceCheckUtils]: 23: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,802 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {628#true} {642#(<= main_~i~0 2)} #45#return; {642#(<= main_~i~0 2)} is VALID [2020-07-10 15:29:26,803 INFO L280 TraceCheckUtils]: 25: Hoare triple {642#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {647#(<= main_~i~0 3)} is VALID [2020-07-10 15:29:26,804 INFO L280 TraceCheckUtils]: 26: Hoare triple {647#(<= main_~i~0 3)} assume !!(1000000 != ~i~0); {647#(<= main_~i~0 3)} is VALID [2020-07-10 15:29:26,805 INFO L263 TraceCheckUtils]: 27: Hoare triple {647#(<= main_~i~0 3)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {648#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:26,805 INFO L280 TraceCheckUtils]: 28: Hoare triple {648#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {649#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:26,806 INFO L280 TraceCheckUtils]: 29: Hoare triple {649#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {629#false} is VALID [2020-07-10 15:29:26,806 INFO L280 TraceCheckUtils]: 30: Hoare triple {629#false} assume !false; {629#false} is VALID [2020-07-10 15:29:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 15:29:26,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694420423] [2020-07-10 15:29:26,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617637407] [2020-07-10 15:29:26,808 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:26,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:29:26,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:26,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 15:29:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:26,946 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:26,981 INFO L263 TraceCheckUtils]: 0: Hoare triple {628#true} call ULTIMATE.init(); {628#true} is VALID [2020-07-10 15:29:26,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,982 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {628#true} {628#true} #41#return; {628#true} is VALID [2020-07-10 15:29:26,982 INFO L263 TraceCheckUtils]: 3: Hoare triple {628#true} call #t~ret1 := main(); {628#true} is VALID [2020-07-10 15:29:26,982 INFO L280 TraceCheckUtils]: 4: Hoare triple {628#true} havoc ~i~0;~i~0 := 0; {628#true} is VALID [2020-07-10 15:29:26,983 INFO L280 TraceCheckUtils]: 5: Hoare triple {628#true} assume !!(1000000 != ~i~0); {628#true} is VALID [2020-07-10 15:29:26,983 INFO L263 TraceCheckUtils]: 6: Hoare triple {628#true} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {628#true} is VALID [2020-07-10 15:29:26,983 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-10 15:29:26,983 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-10 15:29:26,984 INFO L280 TraceCheckUtils]: 9: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,984 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {628#true} {628#true} #45#return; {628#true} is VALID [2020-07-10 15:29:26,984 INFO L280 TraceCheckUtils]: 11: Hoare triple {628#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {628#true} is VALID [2020-07-10 15:29:26,985 INFO L280 TraceCheckUtils]: 12: Hoare triple {628#true} assume !!(1000000 != ~i~0); {628#true} is VALID [2020-07-10 15:29:26,985 INFO L263 TraceCheckUtils]: 13: Hoare triple {628#true} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {628#true} is VALID [2020-07-10 15:29:26,985 INFO L280 TraceCheckUtils]: 14: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-10 15:29:26,985 INFO L280 TraceCheckUtils]: 15: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-10 15:29:26,986 INFO L280 TraceCheckUtils]: 16: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-10 15:29:26,986 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {628#true} {628#true} #45#return; {628#true} is VALID [2020-07-10 15:29:26,986 INFO L280 TraceCheckUtils]: 18: Hoare triple {628#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {628#true} is VALID [2020-07-10 15:29:26,987 INFO L280 TraceCheckUtils]: 19: Hoare triple {628#true} assume !!(1000000 != ~i~0); {710#(not (= main_~i~0 1000000))} is VALID [2020-07-10 15:29:26,987 INFO L263 TraceCheckUtils]: 20: Hoare triple {710#(not (= main_~i~0 1000000))} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {628#true} is VALID [2020-07-10 15:29:26,988 INFO L280 TraceCheckUtils]: 21: Hoare triple {628#true} ~cond := #in~cond; {717#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:26,989 INFO L280 TraceCheckUtils]: 22: Hoare triple {717#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {648#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:26,989 INFO L280 TraceCheckUtils]: 23: Hoare triple {648#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {648#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:26,990 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {648#(not (= 0 |__VERIFIER_assert_#in~cond|))} {710#(not (= main_~i~0 1000000))} #45#return; {727#(and (not (= main_~i~0 1000000)) (<= main_~i~0 1000000))} is VALID [2020-07-10 15:29:26,991 INFO L280 TraceCheckUtils]: 25: Hoare triple {727#(and (not (= main_~i~0 1000000)) (<= main_~i~0 1000000))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {731#(<= main_~i~0 1000000)} is VALID [2020-07-10 15:29:26,992 INFO L280 TraceCheckUtils]: 26: Hoare triple {731#(<= main_~i~0 1000000)} assume !!(1000000 != ~i~0); {731#(<= main_~i~0 1000000)} is VALID [2020-07-10 15:29:26,993 INFO L263 TraceCheckUtils]: 27: Hoare triple {731#(<= main_~i~0 1000000)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:26,994 INFO L280 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:26,994 INFO L280 TraceCheckUtils]: 29: Hoare triple {742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {629#false} is VALID [2020-07-10 15:29:26,995 INFO L280 TraceCheckUtils]: 30: Hoare triple {629#false} assume !false; {629#false} is VALID [2020-07-10 15:29:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-10 15:29:26,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:26,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-10 15:29:26,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611785261] [2020-07-10 15:29:26,997 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-10 15:29:26,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:26,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 15:29:27,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:27,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 15:29:27,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 15:29:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:29:27,042 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 14 states. [2020-07-10 15:29:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:27,395 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-10 15:29:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:29:27,395 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-10 15:29:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-10 15:29:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-10 15:29:27,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-10 15:29:27,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:27,435 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:29:27,436 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:27,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:29:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:27,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:27,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,438 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,439 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:27,439 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:27,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:27,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:27,440 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,440 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:27,440 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:27,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:27,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:27,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:27,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:27,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-10 15:29:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:27,442 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:27,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 15:29:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:27,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:27,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:27,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:27,731 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:27,731 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:27,731 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:27,731 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:27,731 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:27,732 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:27,732 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:27,732 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:27,732 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:27,732 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:27,737 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 19) the Hoare annotation is: true [2020-07-10 15:29:27,738 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 19) no Hoare annotation was computed. [2020-07-10 15:29:27,738 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (not (= main_~i~0 1000000)) (<= main_~i~0 1000000)) [2020-07-10 15:29:27,738 INFO L268 CegarLoopResult]: For program point L16-1(lines 15 17) no Hoare annotation was computed. [2020-07-10 15:29:27,738 INFO L264 CegarLoopResult]: At program point L15-2(lines 15 17) the Hoare annotation is: (<= main_~i~0 1000000) [2020-07-10 15:29:27,738 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 19) no Hoare annotation was computed. [2020-07-10 15:29:27,738 INFO L268 CegarLoopResult]: For program point L15-3(lines 15 17) no Hoare annotation was computed. [2020-07-10 15:29:27,738 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:27,739 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:27,739 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:27,739 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:27,739 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:27,739 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:27,746 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:27,746 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:27,750 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:27,750 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:27,750 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:27,750 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:27,750 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:27,750 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-10 15:29:27,750 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-10 15:29:27,751 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:27,751 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:27,751 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:27,751 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:27,752 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-10 15:29:27,752 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-10 15:29:27,752 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:27,752 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:27,752 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:27,752 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:27,752 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-10 15:29:27,752 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:27,753 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:27,753 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:27,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:27 BoogieIcfgContainer [2020-07-10 15:29:27,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:27,765 INFO L168 Benchmark]: Toolchain (without parser) took 4161.83 ms. Allocated memory was 139.5 MB in the beginning and 246.4 MB in the end (delta: 107.0 MB). Free memory was 104.6 MB in the beginning and 183.9 MB in the end (delta: -79.3 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:27,766 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 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-10 15:29:27,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.89 ms. Allocated memory is still 139.5 MB. Free memory was 104.4 MB in the beginning and 94.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:27,768 INFO L168 Benchmark]: Boogie Preprocessor took 32.28 ms. Allocated memory is still 139.5 MB. Free memory was 94.9 MB in the beginning and 93.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:27,769 INFO L168 Benchmark]: RCFGBuilder took 346.55 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 93.3 MB in the beginning and 169.3 MB in the end (delta: -76.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:27,770 INFO L168 Benchmark]: TraceAbstraction took 3553.06 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 168.6 MB in the beginning and 183.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:27,774 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.23 ms. Allocated memory is still 139.5 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 218.89 ms. Allocated memory is still 139.5 MB. Free memory was 104.4 MB in the beginning and 94.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.28 ms. Allocated memory is still 139.5 MB. Free memory was 94.9 MB in the beginning and 93.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 346.55 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 93.3 MB in the beginning and 169.3 MB in the end (delta: -76.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3553.06 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 168.6 MB in the beginning and 183.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 27.2 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: 3.3s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 41 SDtfs, 38 SDslu, 174 SDs, 0 SdLazy, 162 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=3, 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, 12 PreInvPairs, 23 NumberOfFragments, 16 HoareAnnotationTreeSize, 12 FomulaSimplifications, 15 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 154 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 6607 SizeOfPredicates, 7 NumberOfNonLiveVariables, 126 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 69/104 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...