/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-267fbe0 [2020-07-17 22:52:06,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:52:06,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:52:06,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:52:06,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:52:06,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:52:06,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:52:06,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:52:06,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:52:06,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:52:06,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:52:06,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:52:06,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:52:06,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:52:06,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:52:06,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:52:06,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:52:06,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:52:06,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:52:06,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:52:06,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:52:06,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:52:06,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:52:06,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:52:06,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:52:06,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:52:06,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:52:06,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:52:06,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:52:06,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:52:06,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:52:06,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:52:06,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:52:06,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:52:06,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:52:06,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:52:06,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:52:06,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:52:06,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:52:06,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:52:06,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:52:06,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:52:06,539 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:52:06,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:52:06,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:52:06,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:52:06,546 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:52:06,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:52:06,546 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:52:06,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:52:06,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:52:06,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:52:06,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:52:06,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:52:06,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:52:06,548 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:52:06,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:52:06,548 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:52:06,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:52:06,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:52:06,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:52:06,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:52:06,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:52:06,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:52:06,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:52:06,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:52:06,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:52:06,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:52:06,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:52:06,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:52:06,554 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:52:06,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:52:06,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:52:06,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:52:06,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:52:06,888 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:52:06,889 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:52:06,889 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-17 22:52:06,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2c8dfa1/cb4ab21d27df411caae0a580196da909/FLAG44c7a6ec2 [2020-07-17 22:52:07,446 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:52:07,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant.i [2020-07-17 22:52:07,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2c8dfa1/cb4ab21d27df411caae0a580196da909/FLAG44c7a6ec2 [2020-07-17 22:52:07,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2c8dfa1/cb4ab21d27df411caae0a580196da909 [2020-07-17 22:52:07,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:52:07,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:52:07,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:07,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:52:07,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:52:07,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:07" (1/1) ... [2020-07-17 22:52:07,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8f63c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:07, skipping insertion in model container [2020-07-17 22:52:07,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:07" (1/1) ... [2020-07-17 22:52:07,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:52:07,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:52:08,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:08,058 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:52:08,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:08,093 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:52:08,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08 WrapperNode [2020-07-17 22:52:08,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:08,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:52:08,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:52:08,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:52:08,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... [2020-07-17 22:52:08,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:52:08,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:52:08,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:52:08,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:52:08,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:52:08,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:52:08,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:52:08,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:52:08,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:52:08,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:52:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:52:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:52:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:52:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:52:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:52:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:52:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:52:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:52:08,597 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:52:08,597 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:52:08,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:08 BoogieIcfgContainer [2020-07-17 22:52:08,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:52:08,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:52:08,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:52:08,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:52:08,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:52:07" (1/3) ... [2020-07-17 22:52:08,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd43da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:08, skipping insertion in model container [2020-07-17 22:52:08,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:08" (2/3) ... [2020-07-17 22:52:08,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd43da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:08, skipping insertion in model container [2020-07-17 22:52:08,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:08" (3/3) ... [2020-07-17 22:52:08,631 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.i [2020-07-17 22:52:08,644 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:52:08,651 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:52:08,679 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:52:08,703 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:52:08,704 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:52:08,704 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:52:08,704 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:52:08,704 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:52:08,704 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:52:08,704 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:52:08,705 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:52:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-17 22:52:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:52:08,731 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:08,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:08,733 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:08,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash 651998901, now seen corresponding path program 1 times [2020-07-17 22:52:08,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:08,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86296510] [2020-07-17 22:52:08,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,021 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:52:09,022 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2020-07-17 22:52:09,024 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-17 22:52:09,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:52:09,024 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2020-07-17 22:52:09,025 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2020-07-17 22:52:09,026 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~i~0 := 0; {26#(<= main_~i~0 1000000)} is VALID [2020-07-17 22:52:09,028 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#(<= main_~i~0 1000000)} assume !!(1000000 != ~i~0); {26#(<= main_~i~0 1000000)} is VALID [2020-07-17 22:52:09,030 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-17 22:52:09,031 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-17 22:52:09,032 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {23#false} is VALID [2020-07-17 22:52:09,033 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-17 22:52:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:09,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86296510] [2020-07-17 22:52:09,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:09,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:52:09,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069674114] [2020-07-17 22:52:09,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:52:09,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:09,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:52:09,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:09,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:52:09,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:52:09,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:52:09,099 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2020-07-17 22:52:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:09,365 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2020-07-17 22:52:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:52:09,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:52:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-17 22:52:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-17 22:52:09,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2020-07-17 22:52:09,458 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-17 22:52:09,470 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:52:09,471 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:52:09,475 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-17 22:52:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:52:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-17 22:52:09,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:09,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2020-07-17 22:52:09,523 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2020-07-17 22:52:09,523 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2020-07-17 22:52:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:09,527 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-17 22:52:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-17 22:52:09,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:09,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:09,529 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2020-07-17 22:52:09,529 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2020-07-17 22:52:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:09,533 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-17 22:52:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-17 22:52:09,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:09,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:09,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:09,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:52:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-17 22:52:09,539 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2020-07-17 22:52:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:09,540 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-17 22:52:09,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:52:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-17 22:52:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:52:09,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:09,542 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:09,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:52:09,543 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:09,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:09,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1822329080, now seen corresponding path program 1 times [2020-07-17 22:52:09,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:09,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696711917] [2020-07-17 22:52:09,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-17 22:52:09,681 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {158#true} {158#true} #41#return; {158#true} is VALID [2020-07-17 22:52:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {158#true} ~cond := #in~cond; {158#true} is VALID [2020-07-17 22:52:09,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {158#true} assume !(0 == ~cond); {158#true} is VALID [2020-07-17 22:52:09,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-17 22:52:09,693 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {158#true} {162#(<= main_~i~0 0)} #45#return; {162#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,694 INFO L263 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {158#true} is VALID [2020-07-17 22:52:09,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-17 22:52:09,695 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #41#return; {158#true} is VALID [2020-07-17 22:52:09,695 INFO L263 TraceCheckUtils]: 3: Hoare triple {158#true} call #t~ret1 := main(); {158#true} is VALID [2020-07-17 22:52:09,696 INFO L280 TraceCheckUtils]: 4: Hoare triple {158#true} havoc ~i~0;~i~0 := 0; {162#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,699 INFO L280 TraceCheckUtils]: 5: Hoare triple {162#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {162#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,699 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-17 22:52:09,699 INFO L280 TraceCheckUtils]: 7: Hoare triple {158#true} ~cond := #in~cond; {158#true} is VALID [2020-07-17 22:52:09,700 INFO L280 TraceCheckUtils]: 8: Hoare triple {158#true} assume !(0 == ~cond); {158#true} is VALID [2020-07-17 22:52:09,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-17 22:52:09,703 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {158#true} {162#(<= main_~i~0 0)} #45#return; {162#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,705 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-17 22:52:09,706 INFO L280 TraceCheckUtils]: 12: Hoare triple {167#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {167#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:09,709 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-17 22:52:09,710 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-17 22:52:09,712 INFO L280 TraceCheckUtils]: 15: Hoare triple {169#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {159#false} is VALID [2020-07-17 22:52:09,713 INFO L280 TraceCheckUtils]: 16: Hoare triple {159#false} assume !false; {159#false} is VALID [2020-07-17 22:52:09,716 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-17 22:52:09,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696711917] [2020-07-17 22:52:09,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732820485] [2020-07-17 22:52:09,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:52:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:09,806 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:09,887 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:52:09,938 INFO L263 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {158#true} is VALID [2020-07-17 22:52:09,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-17 22:52:09,939 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #41#return; {158#true} is VALID [2020-07-17 22:52:09,940 INFO L263 TraceCheckUtils]: 3: Hoare triple {158#true} call #t~ret1 := main(); {158#true} is VALID [2020-07-17 22:52:09,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {158#true} havoc ~i~0;~i~0 := 0; {162#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {162#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {162#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,951 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-17 22:52:09,952 INFO L280 TraceCheckUtils]: 7: Hoare triple {158#true} ~cond := #in~cond; {158#true} is VALID [2020-07-17 22:52:09,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {158#true} assume !(0 == ~cond); {158#true} is VALID [2020-07-17 22:52:09,953 INFO L280 TraceCheckUtils]: 9: Hoare triple {158#true} assume true; {158#true} is VALID [2020-07-17 22:52:09,954 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {158#true} {162#(<= main_~i~0 0)} #45#return; {162#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:09,955 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-17 22:52:09,955 INFO L280 TraceCheckUtils]: 12: Hoare triple {167#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {167#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:09,957 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-17 22:52:09,958 INFO L280 TraceCheckUtils]: 14: Hoare triple {212#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {216#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:09,963 INFO L280 TraceCheckUtils]: 15: Hoare triple {216#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {159#false} is VALID [2020-07-17 22:52:09,963 INFO L280 TraceCheckUtils]: 16: Hoare triple {159#false} assume !false; {159#false} is VALID [2020-07-17 22:52:09,965 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-17 22:52:09,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:09,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-17 22:52:09,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147487073] [2020-07-17 22:52:09,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-17 22:52:09,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:09,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:52:10,007 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-17 22:52:10,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:52:10,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:52:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:52:10,009 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2020-07-17 22:52:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,218 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2020-07-17 22:52:10,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:52:10,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-17 22:52:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:52:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-07-17 22:52:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:52:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-07-17 22:52:10,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2020-07-17 22:52:10,265 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-17 22:52:10,268 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:52:10,269 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:52:10,270 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-17 22:52:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:52:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-17 22:52:10,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:10,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-17 22:52:10,294 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-17 22:52:10,294 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-17 22:52:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,299 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-17 22:52:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-17 22:52:10,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:10,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:10,300 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-17 22:52:10,301 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-17 22:52:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,308 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-17 22:52:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-17 22:52:10,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:10,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:10,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:10,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:52:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-17 22:52:10,314 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2020-07-17 22:52:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:10,318 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-17 22:52:10,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:52:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:52:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:52:10,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:10,320 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:10,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:52:10,533 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1510359893, now seen corresponding path program 2 times [2020-07-17 22:52:10,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:10,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698900725] [2020-07-17 22:52:10,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-17 22:52:10,633 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {363#true} {363#true} #41#return; {363#true} is VALID [2020-07-17 22:52:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-17 22:52:10,643 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-17 22:52:10,643 INFO L280 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-17 22:52:10,644 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {363#true} {367#(<= main_~i~0 0)} #45#return; {367#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-17 22:52:10,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-17 22:52:10,654 INFO L280 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-17 22:52:10,655 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {363#true} {372#(<= main_~i~0 1)} #45#return; {372#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:10,656 INFO L263 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {363#true} is VALID [2020-07-17 22:52:10,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-17 22:52:10,656 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #41#return; {363#true} is VALID [2020-07-17 22:52:10,657 INFO L263 TraceCheckUtils]: 3: Hoare triple {363#true} call #t~ret1 := main(); {363#true} is VALID [2020-07-17 22:52:10,657 INFO L280 TraceCheckUtils]: 4: Hoare triple {363#true} havoc ~i~0;~i~0 := 0; {367#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,658 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {367#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,659 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-17 22:52:10,659 INFO L280 TraceCheckUtils]: 7: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-17 22:52:10,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-17 22:52:10,659 INFO L280 TraceCheckUtils]: 9: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-17 22:52:10,660 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {363#true} {367#(<= main_~i~0 0)} #45#return; {367#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,662 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-17 22:52:10,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {372#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {372#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:10,663 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-17 22:52:10,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-17 22:52:10,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-17 22:52:10,663 INFO L280 TraceCheckUtils]: 16: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-17 22:52:10,664 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {363#true} {372#(<= main_~i~0 1)} #45#return; {372#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:10,665 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-17 22:52:10,666 INFO L280 TraceCheckUtils]: 19: Hoare triple {377#(<= main_~i~0 2)} assume !!(1000000 != ~i~0); {377#(<= main_~i~0 2)} is VALID [2020-07-17 22:52:10,668 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-17 22:52:10,669 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-17 22:52:10,670 INFO L280 TraceCheckUtils]: 22: Hoare triple {379#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {364#false} is VALID [2020-07-17 22:52:10,670 INFO L280 TraceCheckUtils]: 23: Hoare triple {364#false} assume !false; {364#false} is VALID [2020-07-17 22:52:10,671 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-17 22:52:10,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698900725] [2020-07-17 22:52:10,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356692137] [2020-07-17 22:52:10,672 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:10,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:52:10,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:10,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:52:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:10,763 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:52:10,809 INFO L263 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {363#true} is VALID [2020-07-17 22:52:10,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-17 22:52:10,810 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #41#return; {363#true} is VALID [2020-07-17 22:52:10,810 INFO L263 TraceCheckUtils]: 3: Hoare triple {363#true} call #t~ret1 := main(); {363#true} is VALID [2020-07-17 22:52:10,811 INFO L280 TraceCheckUtils]: 4: Hoare triple {363#true} havoc ~i~0;~i~0 := 0; {367#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,812 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {367#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,812 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-17 22:52:10,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-17 22:52:10,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-17 22:52:10,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-17 22:52:10,814 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {363#true} {367#(<= main_~i~0 0)} #45#return; {367#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:10,815 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-17 22:52:10,816 INFO L280 TraceCheckUtils]: 12: Hoare triple {372#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {372#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:10,817 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-17 22:52:10,817 INFO L280 TraceCheckUtils]: 14: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2020-07-17 22:52:10,817 INFO L280 TraceCheckUtils]: 15: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2020-07-17 22:52:10,818 INFO L280 TraceCheckUtils]: 16: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-17 22:52:10,819 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {363#true} {372#(<= main_~i~0 1)} #45#return; {372#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:10,820 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-17 22:52:10,821 INFO L280 TraceCheckUtils]: 19: Hoare triple {377#(<= main_~i~0 2)} assume !!(1000000 != ~i~0); {377#(<= main_~i~0 2)} is VALID [2020-07-17 22:52:10,822 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-17 22:52:10,823 INFO L280 TraceCheckUtils]: 21: Hoare triple {443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:10,824 INFO L280 TraceCheckUtils]: 22: Hoare triple {447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {364#false} is VALID [2020-07-17 22:52:10,824 INFO L280 TraceCheckUtils]: 23: Hoare triple {364#false} assume !false; {364#false} is VALID [2020-07-17 22:52:10,826 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-17 22:52:10,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:10,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-17 22:52:10,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233802502] [2020-07-17 22:52:10,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-17 22:52:10,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:10,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:52:10,857 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-17 22:52:10,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:52:10,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:10,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:52:10,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:52:10,858 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2020-07-17 22:52:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:11,029 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-17 22:52:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:52:11,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-17 22:52:11,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:52:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-17 22:52:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:52:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-17 22:52:11,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2020-07-17 22:52:11,101 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-17 22:52:11,103 INFO L225 Difference]: With dead ends: 37 [2020-07-17 22:52:11,104 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:52:11,105 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-17 22:52:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:52:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-17 22:52:11,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:11,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-17 22:52:11,137 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-17 22:52:11,137 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-17 22:52:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:11,142 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-17 22:52:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-17 22:52:11,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:11,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:11,148 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-17 22:52:11,149 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-17 22:52:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:11,154 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-17 22:52:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-17 22:52:11,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:11,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:11,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:11,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:52:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-17 22:52:11,164 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-17 22:52:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:11,164 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-17 22:52:11,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:52:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-17 22:52:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:52:11,166 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:11,166 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:11,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:11,368 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:11,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1096709736, now seen corresponding path program 3 times [2020-07-17 22:52:11,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:11,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165728401] [2020-07-17 22:52:11,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:11,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,478 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {628#true} {628#true} #41#return; {628#true} is VALID [2020-07-17 22:52:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:11,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-17 22:52:11,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-17 22:52:11,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {628#true} {632#(<= main_~i~0 0)} #45#return; {632#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:11,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-17 22:52:11,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-17 22:52:11,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,497 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {628#true} {637#(<= main_~i~0 1)} #45#return; {637#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:11,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-17 22:52:11,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-17 22:52:11,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,505 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {628#true} {642#(<= main_~i~0 2)} #45#return; {642#(<= main_~i~0 2)} is VALID [2020-07-17 22:52:11,505 INFO L263 TraceCheckUtils]: 0: Hoare triple {628#true} call ULTIMATE.init(); {628#true} is VALID [2020-07-17 22:52:11,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,506 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {628#true} {628#true} #41#return; {628#true} is VALID [2020-07-17 22:52:11,506 INFO L263 TraceCheckUtils]: 3: Hoare triple {628#true} call #t~ret1 := main(); {628#true} is VALID [2020-07-17 22:52:11,507 INFO L280 TraceCheckUtils]: 4: Hoare triple {628#true} havoc ~i~0;~i~0 := 0; {632#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:11,508 INFO L280 TraceCheckUtils]: 5: Hoare triple {632#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {632#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:11,508 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-17 22:52:11,508 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-17 22:52:11,508 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-17 22:52:11,509 INFO L280 TraceCheckUtils]: 9: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,509 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {628#true} {632#(<= main_~i~0 0)} #45#return; {632#(<= main_~i~0 0)} is VALID [2020-07-17 22:52:11,510 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-17 22:52:11,511 INFO L280 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {637#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:11,511 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-17 22:52:11,512 INFO L280 TraceCheckUtils]: 14: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-17 22:52:11,512 INFO L280 TraceCheckUtils]: 15: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-17 22:52:11,512 INFO L280 TraceCheckUtils]: 16: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,513 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {628#true} {637#(<= main_~i~0 1)} #45#return; {637#(<= main_~i~0 1)} is VALID [2020-07-17 22:52:11,514 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-17 22:52:11,515 INFO L280 TraceCheckUtils]: 19: Hoare triple {642#(<= main_~i~0 2)} assume !!(1000000 != ~i~0); {642#(<= main_~i~0 2)} is VALID [2020-07-17 22:52:11,515 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-17 22:52:11,515 INFO L280 TraceCheckUtils]: 21: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-17 22:52:11,516 INFO L280 TraceCheckUtils]: 22: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-17 22:52:11,516 INFO L280 TraceCheckUtils]: 23: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,517 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {628#true} {642#(<= main_~i~0 2)} #45#return; {642#(<= main_~i~0 2)} is VALID [2020-07-17 22:52:11,518 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-17 22:52:11,518 INFO L280 TraceCheckUtils]: 26: Hoare triple {647#(<= main_~i~0 3)} assume !!(1000000 != ~i~0); {647#(<= main_~i~0 3)} is VALID [2020-07-17 22:52:11,519 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-17 22:52:11,520 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-17 22:52:11,521 INFO L280 TraceCheckUtils]: 29: Hoare triple {649#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {629#false} is VALID [2020-07-17 22:52:11,521 INFO L280 TraceCheckUtils]: 30: Hoare triple {629#false} assume !false; {629#false} is VALID [2020-07-17 22:52:11,523 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-17 22:52:11,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165728401] [2020-07-17 22:52:11,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885564896] [2020-07-17 22:52:11,524 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:52:11,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:52:11,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:11,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:11,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:11,705 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:52:11,743 INFO L263 TraceCheckUtils]: 0: Hoare triple {628#true} call ULTIMATE.init(); {628#true} is VALID [2020-07-17 22:52:11,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,744 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {628#true} {628#true} #41#return; {628#true} is VALID [2020-07-17 22:52:11,744 INFO L263 TraceCheckUtils]: 3: Hoare triple {628#true} call #t~ret1 := main(); {628#true} is VALID [2020-07-17 22:52:11,744 INFO L280 TraceCheckUtils]: 4: Hoare triple {628#true} havoc ~i~0;~i~0 := 0; {628#true} is VALID [2020-07-17 22:52:11,744 INFO L280 TraceCheckUtils]: 5: Hoare triple {628#true} assume !!(1000000 != ~i~0); {628#true} is VALID [2020-07-17 22:52:11,745 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-17 22:52:11,745 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-17 22:52:11,745 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-17 22:52:11,745 INFO L280 TraceCheckUtils]: 9: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,746 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {628#true} {628#true} #45#return; {628#true} is VALID [2020-07-17 22:52:11,746 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-17 22:52:11,746 INFO L280 TraceCheckUtils]: 12: Hoare triple {628#true} assume !!(1000000 != ~i~0); {628#true} is VALID [2020-07-17 22:52:11,747 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-17 22:52:11,747 INFO L280 TraceCheckUtils]: 14: Hoare triple {628#true} ~cond := #in~cond; {628#true} is VALID [2020-07-17 22:52:11,747 INFO L280 TraceCheckUtils]: 15: Hoare triple {628#true} assume !(0 == ~cond); {628#true} is VALID [2020-07-17 22:52:11,747 INFO L280 TraceCheckUtils]: 16: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-17 22:52:11,748 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {628#true} {628#true} #45#return; {628#true} is VALID [2020-07-17 22:52:11,748 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-17 22:52:11,750 INFO L280 TraceCheckUtils]: 19: Hoare triple {628#true} assume !!(1000000 != ~i~0); {710#(not (= main_~i~0 1000000))} is VALID [2020-07-17 22:52:11,750 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-17 22:52:11,751 INFO L280 TraceCheckUtils]: 21: Hoare triple {628#true} ~cond := #in~cond; {717#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:11,754 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-17 22:52:11,758 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-17 22:52:11,759 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-17 22:52:11,761 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-17 22:52:11,762 INFO L280 TraceCheckUtils]: 26: Hoare triple {731#(<= main_~i~0 1000000)} assume !!(1000000 != ~i~0); {731#(<= main_~i~0 1000000)} is VALID [2020-07-17 22:52:11,764 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-17 22:52:11,765 INFO L280 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:11,768 INFO L280 TraceCheckUtils]: 29: Hoare triple {742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {629#false} is VALID [2020-07-17 22:52:11,769 INFO L280 TraceCheckUtils]: 30: Hoare triple {629#false} assume !false; {629#false} is VALID [2020-07-17 22:52:11,770 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-17 22:52:11,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:11,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-17 22:52:11,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479509590] [2020-07-17 22:52:11,772 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-17 22:52:11,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:11,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:52:11,819 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-17 22:52:11,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:52:11,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:11,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:52:11,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:52:11,821 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 14 states. [2020-07-17 22:52:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:12,207 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-17 22:52:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:52:12,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-17 22:52:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:52:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-17 22:52:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:52:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-17 22:52:12,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-17 22:52:12,245 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-17 22:52:12,246 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:52:12,246 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:52:12,247 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-17 22:52:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:52:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:52:12,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:12,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:12,249 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:12,249 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:12,250 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:12,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:12,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:12,250 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:12,250 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:12,251 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:12,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:12,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:12,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:12,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:52:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:52:12,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-17 22:52:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:12,255 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:52:12,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:52:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:12,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:12,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:12,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:52:12,529 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:52:12,529 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:12,529 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:12,529 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:52:12,529 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:52:12,530 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:52:12,530 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:12,530 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:52:12,530 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:12,530 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:12,530 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 19) the Hoare annotation is: true [2020-07-17 22:52:12,531 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 19) no Hoare annotation was computed. [2020-07-17 22:52:12,531 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-17 22:52:12,531 INFO L268 CegarLoopResult]: For program point L16-1(lines 15 17) no Hoare annotation was computed. [2020-07-17 22:52:12,531 INFO L264 CegarLoopResult]: At program point L15-2(lines 15 17) the Hoare annotation is: (<= main_~i~0 1000000) [2020-07-17 22:52:12,531 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 19) no Hoare annotation was computed. [2020-07-17 22:52:12,531 INFO L268 CegarLoopResult]: For program point L15-3(lines 15 17) no Hoare annotation was computed. [2020-07-17 22:52:12,531 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:52:12,532 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:52:12,532 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:52:12,532 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:52:12,532 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:52:12,532 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:52:12,536 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:12,537 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:52:12,538 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:12,538 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:12,538 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:12,538 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:52:12,538 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:52:12,538 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-17 22:52:12,538 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-17 22:52:12,539 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:12,539 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:12,539 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:12,539 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:52:12,540 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-17 22:52:12,540 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-17 22:52:12,540 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:12,540 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:12,540 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:52:12,540 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:52:12,540 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-17 22:52:12,541 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:52:12,541 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:52:12,541 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-17 22:52:12,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:52:12 BoogieIcfgContainer [2020-07-17 22:52:12,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:52:12,555 INFO L168 Benchmark]: Toolchain (without parser) took 4766.23 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 103.3 MB in the beginning and 173.0 MB in the end (delta: -69.7 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:12,556 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:52:12,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.75 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 93.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:12,557 INFO L168 Benchmark]: Boogie Preprocessor took 35.35 ms. Allocated memory is still 138.4 MB. Free memory was 93.1 MB in the beginning and 91.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:12,559 INFO L168 Benchmark]: RCFGBuilder took 471.76 ms. Allocated memory was 138.4 MB in the beginning and 206.6 MB in the end (delta: 68.2 MB). Free memory was 91.5 MB in the beginning and 171.8 MB in the end (delta: -80.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:12,560 INFO L168 Benchmark]: TraceAbstraction took 3938.67 ms. Allocated memory was 206.6 MB in the beginning and 243.3 MB in the end (delta: 36.7 MB). Free memory was 171.2 MB in the beginning and 173.0 MB in the end (delta: -1.8 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:12,564 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.27 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.75 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 93.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.35 ms. Allocated memory is still 138.4 MB. Free memory was 93.1 MB in the beginning and 91.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 471.76 ms. Allocated memory was 138.4 MB in the beginning and 206.6 MB in the end (delta: 68.2 MB). Free memory was 91.5 MB in the beginning and 171.8 MB in the end (delta: -80.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3938.67 ms. Allocated memory was 206.6 MB in the beginning and 243.3 MB in the end (delta: 36.7 MB). Free memory was 171.2 MB in the beginning and 173.0 MB in the end (delta: -1.8 MB). Peak memory consumption was 34.9 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.7s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 1.3s, 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.3s 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, 1.1s 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...