/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/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:43,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:43,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:43,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:43,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:43,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:43,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:43,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:43,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:43,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:43,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:43,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:43,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:43,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:43,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:43,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:43,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:43,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:43,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:43,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:43,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:43,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:43,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:43,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:43,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:43,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:43,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:43,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:43,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:43,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:43,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:43,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:43,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:43,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:43,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:43,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:43,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:43,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:43,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:43,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:43,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:43,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:43,671 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:43,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:43,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:43,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:43,673 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:43,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:43,674 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:43,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:43,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:43,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:43,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:43,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:43,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:43,675 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:43,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:43,675 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:43,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:43,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:43,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:43,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:43,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:43,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:43,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:43,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:43,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:43,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:43,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:43,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:43,678 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:43,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:43,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:43,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:43,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:43,999 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:44,000 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:44,001 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2020-07-10 15:27:44,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dbb2389/5cff0d31085d4d408fc1a39412d12608/FLAGbf076cd27 [2020-07-10 15:27:44,558 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:44,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2020-07-10 15:27:44,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dbb2389/5cff0d31085d4d408fc1a39412d12608/FLAGbf076cd27 [2020-07-10 15:27:44,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dbb2389/5cff0d31085d4d408fc1a39412d12608 [2020-07-10 15:27:44,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:44,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:44,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:44,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:44,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:44,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55456146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44, skipping insertion in model container [2020-07-10 15:27:44,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:44,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:45,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:45,136 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:45,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:45,168 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:45,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45 WrapperNode [2020-07-10 15:27:45,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:45,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:45,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:45,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:45,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45" (1/1) ... [2020-07-10 15:27:45,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45" (1/1) ... [2020-07-10 15:27:45,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45" (1/1) ... [2020-07-10 15:27:45,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45" (1/1) ... [2020-07-10 15:27:45,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45" (1/1) ... [2020-07-10 15:27:45,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45" (1/1) ... [2020-07-10 15:27:45,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45" (1/1) ... [2020-07-10 15:27:45,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:45,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:45,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:45,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:45,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:45,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:45,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:45,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:45,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:45,669 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:45,669 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:27:45,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:45 BoogieIcfgContainer [2020-07-10 15:27:45,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:45,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:45,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:45,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:45,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:44" (1/3) ... [2020-07-10 15:27:45,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cff1a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:45, skipping insertion in model container [2020-07-10 15:27:45,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:45" (2/3) ... [2020-07-10 15:27:45,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cff1a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:45, skipping insertion in model container [2020-07-10 15:27:45,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:45" (3/3) ... [2020-07-10 15:27:45,682 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2020-07-10 15:27:45,694 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:45,702 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:45,717 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:45,747 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:45,747 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:45,747 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:45,747 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:45,747 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:45,748 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:45,748 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:45,748 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-07-10 15:27:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:27:45,799 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:45,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:45,803 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:45,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:45,818 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2020-07-10 15:27:45,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:45,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124898793] [2020-07-10 15:27:45,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-10 15:27:46,030 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2020-07-10 15:27:46,033 INFO L263 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2020-07-10 15:27:46,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-10 15:27:46,034 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2020-07-10 15:27:46,034 INFO L263 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2020-07-10 15:27:46,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {21#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {21#true} is VALID [2020-07-10 15:27:46,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2020-07-10 15:27:46,037 INFO L263 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {22#false} is VALID [2020-07-10 15:27:46,038 INFO L280 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2020-07-10 15:27:46,038 INFO L280 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2020-07-10 15:27:46,038 INFO L280 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2020-07-10 15:27:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:46,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124898793] [2020-07-10 15:27:46,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:46,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:27:46,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109463399] [2020-07-10 15:27:46,054 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:27:46,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:46,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:27:46,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:46,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:27:46,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:27:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:46,138 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-07-10 15:27:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,206 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-10 15:27:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:27:46,207 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:27:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2020-07-10 15:27:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2020-07-10 15:27:46,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2020-07-10 15:27:46,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:46,355 INFO L225 Difference]: With dead ends: 29 [2020-07-10 15:27:46,356 INFO L226 Difference]: Without dead ends: 12 [2020-07-10 15:27:46,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-10 15:27:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-10 15:27:46,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:46,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-10 15:27:46,411 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-10 15:27:46,411 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-10 15:27:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,415 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-10 15:27:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-10 15:27:46,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,416 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-10 15:27:46,416 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-10 15:27:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,420 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-10 15:27:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-10 15:27:46,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:46,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:27:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-07-10 15:27:46,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-07-10 15:27:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:46,426 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-07-10 15:27:46,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:27:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-10 15:27:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:27:46,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:46,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:46,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:46,428 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2020-07-10 15:27:46,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:46,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586744403] [2020-07-10 15:27:46,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {108#true} assume true; {108#true} is VALID [2020-07-10 15:27:46,510 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {108#true} {108#true} #32#return; {108#true} is VALID [2020-07-10 15:27:46,510 INFO L263 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2020-07-10 15:27:46,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2020-07-10 15:27:46,511 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #32#return; {108#true} is VALID [2020-07-10 15:27:46,512 INFO L263 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret1 := main(); {108#true} is VALID [2020-07-10 15:27:46,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {108#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {112#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,517 INFO L280 TraceCheckUtils]: 5: Hoare triple {112#(<= main_~i~0 1)} assume !(~i~0 <= 8); {109#false} is VALID [2020-07-10 15:27:46,518 INFO L263 TraceCheckUtils]: 6: Hoare triple {109#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {109#false} is VALID [2020-07-10 15:27:46,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2020-07-10 15:27:46,519 INFO L280 TraceCheckUtils]: 8: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2020-07-10 15:27:46,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {109#false} assume !false; {109#false} is VALID [2020-07-10 15:27:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:46,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586744403] [2020-07-10 15:27:46,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:46,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:46,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009518976] [2020-07-10 15:27:46,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:27:46,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:46,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:46,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:46,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:46,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:46,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:46,581 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2020-07-10 15:27:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,650 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-10 15:27:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:46,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:27:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2020-07-10 15:27:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2020-07-10 15:27:46,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2020-07-10 15:27:46,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:46,697 INFO L225 Difference]: With dead ends: 19 [2020-07-10 15:27:46,697 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:27:46,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:27:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-10 15:27:46,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:46,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2020-07-10 15:27:46,706 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2020-07-10 15:27:46,706 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2020-07-10 15:27:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,708 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:27:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:27:46,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,709 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2020-07-10 15:27:46,709 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2020-07-10 15:27:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,711 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:27:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:27:46,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:46,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:27:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-10 15:27:46,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2020-07-10 15:27:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:46,714 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-10 15:27:46,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:27:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:27:46,715 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:46,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:46,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:46,716 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:46,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2020-07-10 15:27:46,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:46,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723655442] [2020-07-10 15:27:46,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {193#true} assume true; {193#true} is VALID [2020-07-10 15:27:46,794 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {193#true} {193#true} #32#return; {193#true} is VALID [2020-07-10 15:27:46,795 INFO L263 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2020-07-10 15:27:46,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2020-07-10 15:27:46,796 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #32#return; {193#true} is VALID [2020-07-10 15:27:46,796 INFO L263 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2020-07-10 15:27:46,798 INFO L280 TraceCheckUtils]: 4: Hoare triple {193#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {197#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,800 INFO L280 TraceCheckUtils]: 5: Hoare triple {197#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {197#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {198#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,804 INFO L280 TraceCheckUtils]: 7: Hoare triple {198#(<= main_~i~0 2)} assume !(~i~0 <= 8); {194#false} is VALID [2020-07-10 15:27:46,804 INFO L263 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {194#false} is VALID [2020-07-10 15:27:46,804 INFO L280 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2020-07-10 15:27:46,805 INFO L280 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2020-07-10 15:27:46,805 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2020-07-10 15:27:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:46,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723655442] [2020-07-10 15:27:46,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577576112] [2020-07-10 15:27:46,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:27:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,859 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:46,933 INFO L263 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2020-07-10 15:27:46,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2020-07-10 15:27:46,934 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #32#return; {193#true} is VALID [2020-07-10 15:27:46,935 INFO L263 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2020-07-10 15:27:46,936 INFO L280 TraceCheckUtils]: 4: Hoare triple {193#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {197#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,938 INFO L280 TraceCheckUtils]: 5: Hoare triple {197#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {197#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,940 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {198#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,941 INFO L280 TraceCheckUtils]: 7: Hoare triple {198#(<= main_~i~0 2)} assume !(~i~0 <= 8); {194#false} is VALID [2020-07-10 15:27:46,942 INFO L263 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {194#false} is VALID [2020-07-10 15:27:46,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2020-07-10 15:27:46,942 INFO L280 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2020-07-10 15:27:46,943 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2020-07-10 15:27:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:46,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:46,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-10 15:27:46,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761945039] [2020-07-10 15:27:46,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-10 15:27:46,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:46,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:46,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:46,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:46,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:46,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:46,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:46,968 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2020-07-10 15:27:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,053 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 15:27:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:47,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-10 15:27:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-10 15:27:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-10 15:27:47,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2020-07-10 15:27:47,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:47,088 INFO L225 Difference]: With dead ends: 21 [2020-07-10 15:27:47,088 INFO L226 Difference]: Without dead ends: 16 [2020-07-10 15:27:47,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-10 15:27:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-10 15:27:47,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:47,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2020-07-10 15:27:47,099 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2020-07-10 15:27:47,100 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2020-07-10 15:27:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,102 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-10 15:27:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:27:47,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,103 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2020-07-10 15:27:47,103 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2020-07-10 15:27:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,105 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-10 15:27:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:27:47,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:47,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:27:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-10 15:27:47,109 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2020-07-10 15:27:47,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:47,109 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-10 15:27:47,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:27:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:27:47,110 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:47,110 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:47,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:27:47,326 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:47,327 INFO L82 PathProgramCache]: Analyzing trace with hash -513951304, now seen corresponding path program 2 times [2020-07-10 15:27:47,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:47,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144034081] [2020-07-10 15:27:47,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:47,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-10 15:27:47,417 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2020-07-10 15:27:47,417 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-10 15:27:47,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-10 15:27:47,418 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2020-07-10 15:27:47,418 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2020-07-10 15:27:47,420 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {326#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:47,421 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {326#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:47,421 INFO L280 TraceCheckUtils]: 6: Hoare triple {326#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {327#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:47,423 INFO L280 TraceCheckUtils]: 7: Hoare triple {327#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {327#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:47,424 INFO L280 TraceCheckUtils]: 8: Hoare triple {327#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {328#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:47,425 INFO L280 TraceCheckUtils]: 9: Hoare triple {328#(<= main_~i~0 3)} assume !(~i~0 <= 8); {323#false} is VALID [2020-07-10 15:27:47,425 INFO L263 TraceCheckUtils]: 10: Hoare triple {323#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {323#false} is VALID [2020-07-10 15:27:47,426 INFO L280 TraceCheckUtils]: 11: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2020-07-10 15:27:47,426 INFO L280 TraceCheckUtils]: 12: Hoare triple {323#false} assume 0 == ~cond; {323#false} is VALID [2020-07-10 15:27:47,426 INFO L280 TraceCheckUtils]: 13: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-10 15:27:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:47,427 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144034081] [2020-07-10 15:27:47,427 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829763724] [2020-07-10 15:27:47,428 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:47,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:47,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:47,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:27:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:47,463 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:47,525 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-10 15:27:47,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-10 15:27:47,526 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2020-07-10 15:27:47,526 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2020-07-10 15:27:47,527 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {326#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:47,528 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {326#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:47,529 INFO L280 TraceCheckUtils]: 6: Hoare triple {326#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {327#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:47,530 INFO L280 TraceCheckUtils]: 7: Hoare triple {327#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {327#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:47,531 INFO L280 TraceCheckUtils]: 8: Hoare triple {327#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {328#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:47,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {328#(<= main_~i~0 3)} assume !(~i~0 <= 8); {323#false} is VALID [2020-07-10 15:27:47,532 INFO L263 TraceCheckUtils]: 10: Hoare triple {323#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {323#false} is VALID [2020-07-10 15:27:47,533 INFO L280 TraceCheckUtils]: 11: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2020-07-10 15:27:47,533 INFO L280 TraceCheckUtils]: 12: Hoare triple {323#false} assume 0 == ~cond; {323#false} is VALID [2020-07-10 15:27:47,533 INFO L280 TraceCheckUtils]: 13: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-10 15:27:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:47,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:47,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-10 15:27:47,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228182027] [2020-07-10 15:27:47,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:27:47,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:47,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:47,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:47,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:47,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:47,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:47,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:47,566 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2020-07-10 15:27:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,645 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-10 15:27:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:47,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:27:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-10 15:27:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-10 15:27:47,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2020-07-10 15:27:47,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:47,683 INFO L225 Difference]: With dead ends: 23 [2020-07-10 15:27:47,684 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 15:27:47,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 15:27:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-10 15:27:47,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:47,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-10 15:27:47,697 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-10 15:27:47,697 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-10 15:27:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,699 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:27:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:27:47,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,700 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-10 15:27:47,700 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-10 15:27:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,702 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:27:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:27:47,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:47,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:27:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-10 15:27:47,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2020-07-10 15:27:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:47,706 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-10 15:27:47,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:47,706 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-10 15:27:47,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:27:47,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:47,707 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:47,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:47,909 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:47,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1178949302, now seen corresponding path program 3 times [2020-07-10 15:27:47,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:47,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901200478] [2020-07-10 15:27:47,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {468#true} assume true; {468#true} is VALID [2020-07-10 15:27:48,042 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {468#true} {468#true} #32#return; {468#true} is VALID [2020-07-10 15:27:48,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID [2020-07-10 15:27:48,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {468#true} assume true; {468#true} is VALID [2020-07-10 15:27:48,043 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {468#true} {468#true} #32#return; {468#true} is VALID [2020-07-10 15:27:48,043 INFO L263 TraceCheckUtils]: 3: Hoare triple {468#true} call #t~ret1 := main(); {468#true} is VALID [2020-07-10 15:27:48,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {468#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {472#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,045 INFO L280 TraceCheckUtils]: 5: Hoare triple {472#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {472#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {473#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,046 INFO L280 TraceCheckUtils]: 7: Hoare triple {473#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {473#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,047 INFO L280 TraceCheckUtils]: 8: Hoare triple {473#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {474#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,048 INFO L280 TraceCheckUtils]: 9: Hoare triple {474#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {474#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,048 INFO L280 TraceCheckUtils]: 10: Hoare triple {474#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {475#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,049 INFO L280 TraceCheckUtils]: 11: Hoare triple {475#(<= main_~i~0 4)} assume !(~i~0 <= 8); {469#false} is VALID [2020-07-10 15:27:48,050 INFO L263 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {469#false} is VALID [2020-07-10 15:27:48,050 INFO L280 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID [2020-07-10 15:27:48,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID [2020-07-10 15:27:48,051 INFO L280 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID [2020-07-10 15:27:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:48,052 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901200478] [2020-07-10 15:27:48,052 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995495547] [2020-07-10 15:27:48,052 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:48,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-10 15:27:48,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:48,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:27:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:48,142 INFO L263 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID [2020-07-10 15:27:48,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {468#true} assume true; {468#true} is VALID [2020-07-10 15:27:48,143 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {468#true} {468#true} #32#return; {468#true} is VALID [2020-07-10 15:27:48,143 INFO L263 TraceCheckUtils]: 3: Hoare triple {468#true} call #t~ret1 := main(); {468#true} is VALID [2020-07-10 15:27:48,144 INFO L280 TraceCheckUtils]: 4: Hoare triple {468#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {472#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {472#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {472#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {473#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,146 INFO L280 TraceCheckUtils]: 7: Hoare triple {473#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {473#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,147 INFO L280 TraceCheckUtils]: 8: Hoare triple {473#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {474#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,148 INFO L280 TraceCheckUtils]: 9: Hoare triple {474#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {474#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,150 INFO L280 TraceCheckUtils]: 10: Hoare triple {474#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {475#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,151 INFO L280 TraceCheckUtils]: 11: Hoare triple {475#(<= main_~i~0 4)} assume !(~i~0 <= 8); {469#false} is VALID [2020-07-10 15:27:48,152 INFO L263 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {469#false} is VALID [2020-07-10 15:27:48,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID [2020-07-10 15:27:48,152 INFO L280 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID [2020-07-10 15:27:48,153 INFO L280 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID [2020-07-10 15:27:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:48,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:48,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-10 15:27:48,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876763575] [2020-07-10 15:27:48,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:27:48,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:48,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:27:48,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:48,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:27:48,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:27:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:48,176 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2020-07-10 15:27:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:48,259 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2020-07-10 15:27:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:48,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:27:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2020-07-10 15:27:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2020-07-10 15:27:48,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2020-07-10 15:27:48,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:48,294 INFO L225 Difference]: With dead ends: 25 [2020-07-10 15:27:48,295 INFO L226 Difference]: Without dead ends: 20 [2020-07-10 15:27:48,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-10 15:27:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-10 15:27:48,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:48,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2020-07-10 15:27:48,308 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2020-07-10 15:27:48,308 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2020-07-10 15:27:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:48,310 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-10 15:27:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-10 15:27:48,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:48,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:48,311 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2020-07-10 15:27:48,311 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2020-07-10 15:27:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:48,313 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-10 15:27:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-10 15:27:48,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:48,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:48,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:48,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:27:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2020-07-10 15:27:48,316 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2020-07-10 15:27:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:48,317 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2020-07-10 15:27:48,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:27:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-10 15:27:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:27:48,318 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:48,318 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:48,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:48,534 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 4 times [2020-07-10 15:27:48,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:48,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43855290] [2020-07-10 15:27:48,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {631#true} assume true; {631#true} is VALID [2020-07-10 15:27:48,646 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {631#true} {631#true} #32#return; {631#true} is VALID [2020-07-10 15:27:48,647 INFO L263 TraceCheckUtils]: 0: Hoare triple {631#true} call ULTIMATE.init(); {631#true} is VALID [2020-07-10 15:27:48,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {631#true} assume true; {631#true} is VALID [2020-07-10 15:27:48,647 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {631#true} {631#true} #32#return; {631#true} is VALID [2020-07-10 15:27:48,648 INFO L263 TraceCheckUtils]: 3: Hoare triple {631#true} call #t~ret1 := main(); {631#true} is VALID [2020-07-10 15:27:48,649 INFO L280 TraceCheckUtils]: 4: Hoare triple {631#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {635#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {635#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,663 INFO L280 TraceCheckUtils]: 6: Hoare triple {635#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {636#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,667 INFO L280 TraceCheckUtils]: 7: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {636#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,676 INFO L280 TraceCheckUtils]: 8: Hoare triple {636#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {637#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,677 INFO L280 TraceCheckUtils]: 9: Hoare triple {637#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {637#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,678 INFO L280 TraceCheckUtils]: 10: Hoare triple {637#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {638#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,679 INFO L280 TraceCheckUtils]: 11: Hoare triple {638#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {638#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,684 INFO L280 TraceCheckUtils]: 12: Hoare triple {638#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {639#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,686 INFO L280 TraceCheckUtils]: 13: Hoare triple {639#(<= main_~i~0 5)} assume !(~i~0 <= 8); {632#false} is VALID [2020-07-10 15:27:48,686 INFO L263 TraceCheckUtils]: 14: Hoare triple {632#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {632#false} is VALID [2020-07-10 15:27:48,687 INFO L280 TraceCheckUtils]: 15: Hoare triple {632#false} ~cond := #in~cond; {632#false} is VALID [2020-07-10 15:27:48,687 INFO L280 TraceCheckUtils]: 16: Hoare triple {632#false} assume 0 == ~cond; {632#false} is VALID [2020-07-10 15:27:48,687 INFO L280 TraceCheckUtils]: 17: Hoare triple {632#false} assume !false; {632#false} is VALID [2020-07-10 15:27:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:48,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43855290] [2020-07-10 15:27:48,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537189591] [2020-07-10 15:27:48,689 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:48,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:27:48,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:48,726 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,739 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:48,824 INFO L263 TraceCheckUtils]: 0: Hoare triple {631#true} call ULTIMATE.init(); {631#true} is VALID [2020-07-10 15:27:48,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {631#true} assume true; {631#true} is VALID [2020-07-10 15:27:48,825 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {631#true} {631#true} #32#return; {631#true} is VALID [2020-07-10 15:27:48,825 INFO L263 TraceCheckUtils]: 3: Hoare triple {631#true} call #t~ret1 := main(); {631#true} is VALID [2020-07-10 15:27:48,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {631#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {635#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,828 INFO L280 TraceCheckUtils]: 5: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {635#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {635#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {636#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {636#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,832 INFO L280 TraceCheckUtils]: 8: Hoare triple {636#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {637#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,834 INFO L280 TraceCheckUtils]: 9: Hoare triple {637#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {637#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,835 INFO L280 TraceCheckUtils]: 10: Hoare triple {637#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {638#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,836 INFO L280 TraceCheckUtils]: 11: Hoare triple {638#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {638#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,837 INFO L280 TraceCheckUtils]: 12: Hoare triple {638#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {639#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,839 INFO L280 TraceCheckUtils]: 13: Hoare triple {639#(<= main_~i~0 5)} assume !(~i~0 <= 8); {632#false} is VALID [2020-07-10 15:27:48,839 INFO L263 TraceCheckUtils]: 14: Hoare triple {632#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {632#false} is VALID [2020-07-10 15:27:48,839 INFO L280 TraceCheckUtils]: 15: Hoare triple {632#false} ~cond := #in~cond; {632#false} is VALID [2020-07-10 15:27:48,840 INFO L280 TraceCheckUtils]: 16: Hoare triple {632#false} assume 0 == ~cond; {632#false} is VALID [2020-07-10 15:27:48,840 INFO L280 TraceCheckUtils]: 17: Hoare triple {632#false} assume !false; {632#false} is VALID [2020-07-10 15:27:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:48,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:48,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-10 15:27:48,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655314211] [2020-07-10 15:27:48,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-10 15:27:48,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:48,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:27:48,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:48,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:27:48,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:48,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:27:48,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:48,878 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2020-07-10 15:27:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:48,969 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-10 15:27:48,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:27:48,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-10 15:27:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-07-10 15:27:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-07-10 15:27:48,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2020-07-10 15:27:49,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:49,020 INFO L225 Difference]: With dead ends: 27 [2020-07-10 15:27:49,020 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:27:49,021 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:27:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-10 15:27:49,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:49,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-10 15:27:49,031 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-10 15:27:49,031 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-10 15:27:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,034 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-10 15:27:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-10 15:27:49,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:49,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:49,035 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-10 15:27:49,035 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-10 15:27:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,037 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-10 15:27:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-10 15:27:49,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:49,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:49,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:49,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:27:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-10 15:27:49,039 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2020-07-10 15:27:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:49,040 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-10 15:27:49,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:27:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 15:27:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:27:49,041 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:49,041 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:49,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:49,255 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:49,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1299094066, now seen corresponding path program 5 times [2020-07-10 15:27:49,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:49,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015439365] [2020-07-10 15:27:49,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:49,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-10 15:27:49,354 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {811#true} {811#true} #32#return; {811#true} is VALID [2020-07-10 15:27:49,354 INFO L263 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {811#true} is VALID [2020-07-10 15:27:49,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-10 15:27:49,354 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #32#return; {811#true} is VALID [2020-07-10 15:27:49,354 INFO L263 TraceCheckUtils]: 3: Hoare triple {811#true} call #t~ret1 := main(); {811#true} is VALID [2020-07-10 15:27:49,355 INFO L280 TraceCheckUtils]: 4: Hoare triple {811#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {815#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:49,355 INFO L280 TraceCheckUtils]: 5: Hoare triple {815#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {815#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:49,356 INFO L280 TraceCheckUtils]: 6: Hoare triple {815#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {816#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:49,357 INFO L280 TraceCheckUtils]: 7: Hoare triple {816#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {816#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:49,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {816#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {817#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:49,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {817#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {817#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:49,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {817#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {818#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,360 INFO L280 TraceCheckUtils]: 11: Hoare triple {818#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {818#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,361 INFO L280 TraceCheckUtils]: 12: Hoare triple {818#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {819#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,362 INFO L280 TraceCheckUtils]: 13: Hoare triple {819#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {819#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,363 INFO L280 TraceCheckUtils]: 14: Hoare triple {819#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {820#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,363 INFO L280 TraceCheckUtils]: 15: Hoare triple {820#(<= main_~i~0 6)} assume !(~i~0 <= 8); {812#false} is VALID [2020-07-10 15:27:49,364 INFO L263 TraceCheckUtils]: 16: Hoare triple {812#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {812#false} is VALID [2020-07-10 15:27:49,364 INFO L280 TraceCheckUtils]: 17: Hoare triple {812#false} ~cond := #in~cond; {812#false} is VALID [2020-07-10 15:27:49,364 INFO L280 TraceCheckUtils]: 18: Hoare triple {812#false} assume 0 == ~cond; {812#false} is VALID [2020-07-10 15:27:49,365 INFO L280 TraceCheckUtils]: 19: Hoare triple {812#false} assume !false; {812#false} is VALID [2020-07-10 15:27:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:49,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015439365] [2020-07-10 15:27:49,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947783215] [2020-07-10 15:27:49,366 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:49,386 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-10 15:27:49,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:49,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:27:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:49,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:49,487 INFO L263 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {811#true} is VALID [2020-07-10 15:27:49,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-10 15:27:49,487 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #32#return; {811#true} is VALID [2020-07-10 15:27:49,488 INFO L263 TraceCheckUtils]: 3: Hoare triple {811#true} call #t~ret1 := main(); {811#true} is VALID [2020-07-10 15:27:49,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {811#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {815#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:49,489 INFO L280 TraceCheckUtils]: 5: Hoare triple {815#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {815#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:49,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {815#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {816#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:49,491 INFO L280 TraceCheckUtils]: 7: Hoare triple {816#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {816#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:49,491 INFO L280 TraceCheckUtils]: 8: Hoare triple {816#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {817#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:49,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {817#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {817#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:49,493 INFO L280 TraceCheckUtils]: 10: Hoare triple {817#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {818#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,493 INFO L280 TraceCheckUtils]: 11: Hoare triple {818#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {818#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,497 INFO L280 TraceCheckUtils]: 12: Hoare triple {818#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {819#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {819#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {819#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,498 INFO L280 TraceCheckUtils]: 14: Hoare triple {819#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {820#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,499 INFO L280 TraceCheckUtils]: 15: Hoare triple {820#(<= main_~i~0 6)} assume !(~i~0 <= 8); {812#false} is VALID [2020-07-10 15:27:49,499 INFO L263 TraceCheckUtils]: 16: Hoare triple {812#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {812#false} is VALID [2020-07-10 15:27:49,500 INFO L280 TraceCheckUtils]: 17: Hoare triple {812#false} ~cond := #in~cond; {812#false} is VALID [2020-07-10 15:27:49,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {812#false} assume 0 == ~cond; {812#false} is VALID [2020-07-10 15:27:49,500 INFO L280 TraceCheckUtils]: 19: Hoare triple {812#false} assume !false; {812#false} is VALID [2020-07-10 15:27:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:49,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:49,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-10 15:27:49,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807783483] [2020-07-10 15:27:49,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-07-10 15:27:49,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:49,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:27:49,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:49,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:27:49,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:49,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:27:49,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:27:49,533 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2020-07-10 15:27:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,626 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-10 15:27:49,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:27:49,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-07-10 15:27:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 15:27:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 15:27:49,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-10 15:27:49,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:49,666 INFO L225 Difference]: With dead ends: 29 [2020-07-10 15:27:49,667 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 15:27:49,667 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:27:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 15:27:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-10 15:27:49,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:49,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-10 15:27:49,679 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-10 15:27:49,680 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-10 15:27:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,682 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-10 15:27:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-10 15:27:49,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:49,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:49,683 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-10 15:27:49,683 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-10 15:27:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,685 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-10 15:27:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-10 15:27:49,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:49,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:49,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:49,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:27:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-10 15:27:49,687 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2020-07-10 15:27:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:49,688 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-10 15:27:49,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:27:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-10 15:27:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:27:49,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:49,689 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:49,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 15:27:49,897 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash -241172304, now seen corresponding path program 6 times [2020-07-10 15:27:49,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:49,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561065044] [2020-07-10 15:27:49,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,006 INFO L280 TraceCheckUtils]: 0: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-10 15:27:50,007 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1008#true} {1008#true} #32#return; {1008#true} is VALID [2020-07-10 15:27:50,007 INFO L263 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2020-07-10 15:27:50,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-10 15:27:50,007 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1008#true} {1008#true} #32#return; {1008#true} is VALID [2020-07-10 15:27:50,007 INFO L263 TraceCheckUtils]: 3: Hoare triple {1008#true} call #t~ret1 := main(); {1008#true} is VALID [2020-07-10 15:27:50,008 INFO L280 TraceCheckUtils]: 4: Hoare triple {1008#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1012#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {1012#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1012#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,013 INFO L280 TraceCheckUtils]: 6: Hoare triple {1012#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1013#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,014 INFO L280 TraceCheckUtils]: 7: Hoare triple {1013#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1013#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,014 INFO L280 TraceCheckUtils]: 8: Hoare triple {1013#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1014#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:50,015 INFO L280 TraceCheckUtils]: 9: Hoare triple {1014#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1014#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:50,015 INFO L280 TraceCheckUtils]: 10: Hoare triple {1014#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1015#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:50,016 INFO L280 TraceCheckUtils]: 11: Hoare triple {1015#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1015#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:50,016 INFO L280 TraceCheckUtils]: 12: Hoare triple {1015#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1016#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:50,017 INFO L280 TraceCheckUtils]: 13: Hoare triple {1016#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1016#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:50,021 INFO L280 TraceCheckUtils]: 14: Hoare triple {1016#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1017#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:50,022 INFO L280 TraceCheckUtils]: 15: Hoare triple {1017#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1017#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:50,022 INFO L280 TraceCheckUtils]: 16: Hoare triple {1017#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1018#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:50,023 INFO L280 TraceCheckUtils]: 17: Hoare triple {1018#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1009#false} is VALID [2020-07-10 15:27:50,023 INFO L263 TraceCheckUtils]: 18: Hoare triple {1009#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1009#false} is VALID [2020-07-10 15:27:50,024 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#false} ~cond := #in~cond; {1009#false} is VALID [2020-07-10 15:27:50,024 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#false} assume 0 == ~cond; {1009#false} is VALID [2020-07-10 15:27:50,024 INFO L280 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2020-07-10 15:27:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:50,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561065044] [2020-07-10 15:27:50,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144984892] [2020-07-10 15:27:50,025 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:50,058 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-10 15:27:50,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:50,059 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:27:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:50,164 INFO L263 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2020-07-10 15:27:50,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-10 15:27:50,165 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1008#true} {1008#true} #32#return; {1008#true} is VALID [2020-07-10 15:27:50,166 INFO L263 TraceCheckUtils]: 3: Hoare triple {1008#true} call #t~ret1 := main(); {1008#true} is VALID [2020-07-10 15:27:50,168 INFO L280 TraceCheckUtils]: 4: Hoare triple {1008#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1012#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,169 INFO L280 TraceCheckUtils]: 5: Hoare triple {1012#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1012#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {1012#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1013#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,170 INFO L280 TraceCheckUtils]: 7: Hoare triple {1013#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1013#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,172 INFO L280 TraceCheckUtils]: 8: Hoare triple {1013#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1014#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:50,172 INFO L280 TraceCheckUtils]: 9: Hoare triple {1014#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1014#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:50,173 INFO L280 TraceCheckUtils]: 10: Hoare triple {1014#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1015#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:50,174 INFO L280 TraceCheckUtils]: 11: Hoare triple {1015#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1015#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:50,175 INFO L280 TraceCheckUtils]: 12: Hoare triple {1015#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1016#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:50,176 INFO L280 TraceCheckUtils]: 13: Hoare triple {1016#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1016#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:50,177 INFO L280 TraceCheckUtils]: 14: Hoare triple {1016#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1017#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:50,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {1017#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1017#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:50,185 INFO L280 TraceCheckUtils]: 16: Hoare triple {1017#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1018#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:50,186 INFO L280 TraceCheckUtils]: 17: Hoare triple {1018#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1009#false} is VALID [2020-07-10 15:27:50,186 INFO L263 TraceCheckUtils]: 18: Hoare triple {1009#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1009#false} is VALID [2020-07-10 15:27:50,186 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#false} ~cond := #in~cond; {1009#false} is VALID [2020-07-10 15:27:50,186 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#false} assume 0 == ~cond; {1009#false} is VALID [2020-07-10 15:27:50,186 INFO L280 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2020-07-10 15:27:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:50,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:50,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-07-10 15:27:50,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820591598] [2020-07-10 15:27:50,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-10 15:27:50,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:50,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:27:50,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:50,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:27:50,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:27:50,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:27:50,227 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2020-07-10 15:27:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:50,358 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-10 15:27:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:27:50,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-10 15:27:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-10 15:27:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-10 15:27:50,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2020-07-10 15:27:50,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:50,399 INFO L225 Difference]: With dead ends: 31 [2020-07-10 15:27:50,400 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 15:27:50,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:27:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 15:27:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-10 15:27:50,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:50,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-10 15:27:50,415 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-10 15:27:50,415 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-10 15:27:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:50,417 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 15:27:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-10 15:27:50,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:50,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:50,418 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-10 15:27:50,418 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-10 15:27:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:50,420 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 15:27:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-10 15:27:50,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:50,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:50,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:50,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:27:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2020-07-10 15:27:50,423 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2020-07-10 15:27:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:50,423 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2020-07-10 15:27:50,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:27:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-10 15:27:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:27:50,424 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:50,424 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:50,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:50,635 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:50,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1326563246, now seen corresponding path program 7 times [2020-07-10 15:27:50,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:50,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899756892] [2020-07-10 15:27:50,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {1222#true} assume true; {1222#true} is VALID [2020-07-10 15:27:50,777 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1222#true} {1222#true} #32#return; {1222#true} is VALID [2020-07-10 15:27:50,777 INFO L263 TraceCheckUtils]: 0: Hoare triple {1222#true} call ULTIMATE.init(); {1222#true} is VALID [2020-07-10 15:27:50,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {1222#true} assume true; {1222#true} is VALID [2020-07-10 15:27:50,777 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1222#true} {1222#true} #32#return; {1222#true} is VALID [2020-07-10 15:27:50,778 INFO L263 TraceCheckUtils]: 3: Hoare triple {1222#true} call #t~ret1 := main(); {1222#true} is VALID [2020-07-10 15:27:50,778 INFO L280 TraceCheckUtils]: 4: Hoare triple {1222#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1226#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1226#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,780 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1227#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,780 INFO L280 TraceCheckUtils]: 7: Hoare triple {1227#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1227#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,782 INFO L280 TraceCheckUtils]: 8: Hoare triple {1227#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1228#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:50,783 INFO L280 TraceCheckUtils]: 9: Hoare triple {1228#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1228#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:50,784 INFO L280 TraceCheckUtils]: 10: Hoare triple {1228#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1229#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:50,786 INFO L280 TraceCheckUtils]: 11: Hoare triple {1229#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1229#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:50,789 INFO L280 TraceCheckUtils]: 12: Hoare triple {1229#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1230#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:50,791 INFO L280 TraceCheckUtils]: 13: Hoare triple {1230#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1230#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:50,792 INFO L280 TraceCheckUtils]: 14: Hoare triple {1230#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1231#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:50,794 INFO L280 TraceCheckUtils]: 15: Hoare triple {1231#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1231#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:50,796 INFO L280 TraceCheckUtils]: 16: Hoare triple {1231#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1232#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:50,800 INFO L280 TraceCheckUtils]: 17: Hoare triple {1232#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1232#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:50,802 INFO L280 TraceCheckUtils]: 18: Hoare triple {1232#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1233#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:50,802 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1223#false} is VALID [2020-07-10 15:27:50,802 INFO L263 TraceCheckUtils]: 20: Hoare triple {1223#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1223#false} is VALID [2020-07-10 15:27:50,803 INFO L280 TraceCheckUtils]: 21: Hoare triple {1223#false} ~cond := #in~cond; {1223#false} is VALID [2020-07-10 15:27:50,803 INFO L280 TraceCheckUtils]: 22: Hoare triple {1223#false} assume 0 == ~cond; {1223#false} is VALID [2020-07-10 15:27:50,803 INFO L280 TraceCheckUtils]: 23: Hoare triple {1223#false} assume !false; {1223#false} is VALID [2020-07-10 15:27:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:50,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899756892] [2020-07-10 15:27:50,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123692112] [2020-07-10 15:27:50,804 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,837 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:27:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:50,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {1222#true} call ULTIMATE.init(); {1222#true} is VALID [2020-07-10 15:27:50,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {1222#true} assume true; {1222#true} is VALID [2020-07-10 15:27:50,953 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1222#true} {1222#true} #32#return; {1222#true} is VALID [2020-07-10 15:27:50,954 INFO L263 TraceCheckUtils]: 3: Hoare triple {1222#true} call #t~ret1 := main(); {1222#true} is VALID [2020-07-10 15:27:50,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {1222#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1226#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1226#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,957 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1227#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,958 INFO L280 TraceCheckUtils]: 7: Hoare triple {1227#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1227#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {1227#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1228#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:50,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {1228#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1228#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:50,960 INFO L280 TraceCheckUtils]: 10: Hoare triple {1228#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1229#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:50,961 INFO L280 TraceCheckUtils]: 11: Hoare triple {1229#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1229#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:50,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {1229#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1230#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:50,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {1230#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1230#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:50,964 INFO L280 TraceCheckUtils]: 14: Hoare triple {1230#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1231#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:50,965 INFO L280 TraceCheckUtils]: 15: Hoare triple {1231#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1231#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:50,966 INFO L280 TraceCheckUtils]: 16: Hoare triple {1231#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1232#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:50,967 INFO L280 TraceCheckUtils]: 17: Hoare triple {1232#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1232#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:50,968 INFO L280 TraceCheckUtils]: 18: Hoare triple {1232#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1233#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:50,969 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1223#false} is VALID [2020-07-10 15:27:50,969 INFO L263 TraceCheckUtils]: 20: Hoare triple {1223#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1223#false} is VALID [2020-07-10 15:27:50,969 INFO L280 TraceCheckUtils]: 21: Hoare triple {1223#false} ~cond := #in~cond; {1223#false} is VALID [2020-07-10 15:27:50,969 INFO L280 TraceCheckUtils]: 22: Hoare triple {1223#false} assume 0 == ~cond; {1223#false} is VALID [2020-07-10 15:27:50,970 INFO L280 TraceCheckUtils]: 23: Hoare triple {1223#false} assume !false; {1223#false} is VALID [2020-07-10 15:27:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:50,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:50,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-07-10 15:27:50,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848849783] [2020-07-10 15:27:50,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:27:50,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:50,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:27:51,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:51,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:27:51,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:51,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:27:51,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:27:51,003 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2020-07-10 15:27:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:51,101 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2020-07-10 15:27:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:27:51,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:27:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2020-07-10 15:27:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2020-07-10 15:27:51,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2020-07-10 15:27:51,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:51,145 INFO L225 Difference]: With dead ends: 32 [2020-07-10 15:27:51,145 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 15:27:51,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:27:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 15:27:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-10 15:27:51,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:51,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-10 15:27:51,160 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 15:27:51,160 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 15:27:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:51,162 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-10 15:27:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 15:27:51,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:51,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:51,163 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 15:27:51,163 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 15:27:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:51,165 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-10 15:27:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 15:27:51,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:51,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:51,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:51,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:27:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-10 15:27:51,168 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2020-07-10 15:27:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:51,168 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-10 15:27:51,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:27:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 15:27:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:27:51,169 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:51,169 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:51,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:51,370 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 8 times [2020-07-10 15:27:51,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:51,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202469348] [2020-07-10 15:27:51,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:51,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {1450#true} assume true; {1450#true} is VALID [2020-07-10 15:27:51,701 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1450#true} {1450#true} #32#return; {1450#true} is VALID [2020-07-10 15:27:51,701 INFO L263 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2020-07-10 15:27:51,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {1450#true} assume true; {1450#true} is VALID [2020-07-10 15:27:51,702 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1450#true} {1450#true} #32#return; {1450#true} is VALID [2020-07-10 15:27:51,702 INFO L263 TraceCheckUtils]: 3: Hoare triple {1450#true} call #t~ret1 := main(); {1450#true} is VALID [2020-07-10 15:27:51,702 INFO L280 TraceCheckUtils]: 4: Hoare triple {1450#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1454#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 15:27:51,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {1454#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-10 15:27:51,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-10 15:27:51,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-10 15:27:51,705 INFO L280 TraceCheckUtils]: 8: Hoare triple {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-10 15:27:51,706 INFO L280 TraceCheckUtils]: 9: Hoare triple {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-10 15:27:51,707 INFO L280 TraceCheckUtils]: 10: Hoare triple {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-10 15:27:51,707 INFO L280 TraceCheckUtils]: 11: Hoare triple {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-10 15:27:51,708 INFO L280 TraceCheckUtils]: 12: Hoare triple {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-10 15:27:51,709 INFO L280 TraceCheckUtils]: 13: Hoare triple {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-10 15:27:51,711 INFO L280 TraceCheckUtils]: 14: Hoare triple {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-10 15:27:51,712 INFO L280 TraceCheckUtils]: 15: Hoare triple {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-10 15:27:51,713 INFO L280 TraceCheckUtils]: 16: Hoare triple {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-10 15:27:51,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-10 15:27:51,714 INFO L280 TraceCheckUtils]: 18: Hoare triple {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-10 15:27:51,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 15:27:51,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 15:27:51,716 INFO L280 TraceCheckUtils]: 21: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} assume !(~i~0 <= 8); {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 15:27:51,723 INFO L263 TraceCheckUtils]: 22: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1463#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:27:51,724 INFO L280 TraceCheckUtils]: 23: Hoare triple {1463#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1464#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:27:51,725 INFO L280 TraceCheckUtils]: 24: Hoare triple {1464#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1451#false} is VALID [2020-07-10 15:27:51,725 INFO L280 TraceCheckUtils]: 25: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2020-07-10 15:27:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:51,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202469348] [2020-07-10 15:27:51,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432354816] [2020-07-10 15:27:51,729 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:51,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:51,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:51,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-10 15:27:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:51,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:51,927 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:52,000 INFO L263 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2020-07-10 15:27:52,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {1450#true} assume true; {1450#true} is VALID [2020-07-10 15:27:52,001 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1450#true} {1450#true} #32#return; {1450#true} is VALID [2020-07-10 15:27:52,001 INFO L263 TraceCheckUtils]: 3: Hoare triple {1450#true} call #t~ret1 := main(); {1450#true} is VALID [2020-07-10 15:27:52,002 INFO L280 TraceCheckUtils]: 4: Hoare triple {1450#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1454#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 15:27:52,003 INFO L280 TraceCheckUtils]: 5: Hoare triple {1454#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-10 15:27:52,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-10 15:27:52,006 INFO L280 TraceCheckUtils]: 7: Hoare triple {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-10 15:27:52,007 INFO L280 TraceCheckUtils]: 8: Hoare triple {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-10 15:27:52,008 INFO L280 TraceCheckUtils]: 9: Hoare triple {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-10 15:27:52,010 INFO L280 TraceCheckUtils]: 10: Hoare triple {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-10 15:27:52,011 INFO L280 TraceCheckUtils]: 11: Hoare triple {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-10 15:27:52,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-10 15:27:52,014 INFO L280 TraceCheckUtils]: 13: Hoare triple {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-10 15:27:52,016 INFO L280 TraceCheckUtils]: 14: Hoare triple {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-10 15:27:52,017 INFO L280 TraceCheckUtils]: 15: Hoare triple {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-10 15:27:52,018 INFO L280 TraceCheckUtils]: 16: Hoare triple {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-10 15:27:52,019 INFO L280 TraceCheckUtils]: 17: Hoare triple {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-10 15:27:52,021 INFO L280 TraceCheckUtils]: 18: Hoare triple {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-10 15:27:52,022 INFO L280 TraceCheckUtils]: 19: Hoare triple {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 15:27:52,023 INFO L280 TraceCheckUtils]: 20: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 15:27:52,024 INFO L280 TraceCheckUtils]: 21: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} assume !(~i~0 <= 8); {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 15:27:52,025 INFO L263 TraceCheckUtils]: 22: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1534#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:52,026 INFO L280 TraceCheckUtils]: 23: Hoare triple {1534#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1538#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:52,027 INFO L280 TraceCheckUtils]: 24: Hoare triple {1538#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1451#false} is VALID [2020-07-10 15:27:52,028 INFO L280 TraceCheckUtils]: 25: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2020-07-10 15:27:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:52,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:52,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2020-07-10 15:27:52,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093978492] [2020-07-10 15:27:52,032 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-10 15:27:52,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:52,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 15:27:52,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:52,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 15:27:52,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:52,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 15:27:52,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:27:52,075 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2020-07-10 15:27:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:52,569 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 15:27:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:27:52,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-10 15:27:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:27:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2020-07-10 15:27:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:27:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2020-07-10 15:27:52,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 34 transitions. [2020-07-10 15:27:52,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:52,632 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:27:52,633 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:27:52,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:27:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:27:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:27:52,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:52,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:52,668 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:52,668 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:52,670 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-10 15:27:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-10 15:27:52,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:52,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:52,671 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:52,671 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:52,673 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-10 15:27:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-10 15:27:52,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:52,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:52,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:52,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:52,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:27:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2020-07-10 15:27:52,685 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2020-07-10 15:27:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:52,686 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2020-07-10 15:27:52,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 15:27:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-10 15:27:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:52,687 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:52,690 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:52,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-10 15:27:52,907 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 9 times [2020-07-10 15:27:52,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:52,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799436043] [2020-07-10 15:27:52,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:53,081 INFO L280 TraceCheckUtils]: 0: Hoare triple {1701#true} assume true; {1701#true} is VALID [2020-07-10 15:27:53,081 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1701#true} {1701#true} #32#return; {1701#true} is VALID [2020-07-10 15:27:53,081 INFO L263 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2020-07-10 15:27:53,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {1701#true} assume true; {1701#true} is VALID [2020-07-10 15:27:53,082 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1701#true} {1701#true} #32#return; {1701#true} is VALID [2020-07-10 15:27:53,082 INFO L263 TraceCheckUtils]: 3: Hoare triple {1701#true} call #t~ret1 := main(); {1701#true} is VALID [2020-07-10 15:27:53,082 INFO L280 TraceCheckUtils]: 4: Hoare triple {1701#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1705#(<= 1 main_~i~0)} is VALID [2020-07-10 15:27:53,083 INFO L280 TraceCheckUtils]: 5: Hoare triple {1705#(<= 1 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1705#(<= 1 main_~i~0)} is VALID [2020-07-10 15:27:53,083 INFO L280 TraceCheckUtils]: 6: Hoare triple {1705#(<= 1 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1706#(<= 2 main_~i~0)} is VALID [2020-07-10 15:27:53,084 INFO L280 TraceCheckUtils]: 7: Hoare triple {1706#(<= 2 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1706#(<= 2 main_~i~0)} is VALID [2020-07-10 15:27:53,086 INFO L280 TraceCheckUtils]: 8: Hoare triple {1706#(<= 2 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1707#(<= 3 main_~i~0)} is VALID [2020-07-10 15:27:53,086 INFO L280 TraceCheckUtils]: 9: Hoare triple {1707#(<= 3 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1707#(<= 3 main_~i~0)} is VALID [2020-07-10 15:27:53,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {1707#(<= 3 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1708#(<= 4 main_~i~0)} is VALID [2020-07-10 15:27:53,087 INFO L280 TraceCheckUtils]: 11: Hoare triple {1708#(<= 4 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1708#(<= 4 main_~i~0)} is VALID [2020-07-10 15:27:53,088 INFO L280 TraceCheckUtils]: 12: Hoare triple {1708#(<= 4 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1709#(<= 5 main_~i~0)} is VALID [2020-07-10 15:27:53,088 INFO L280 TraceCheckUtils]: 13: Hoare triple {1709#(<= 5 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1709#(<= 5 main_~i~0)} is VALID [2020-07-10 15:27:53,089 INFO L280 TraceCheckUtils]: 14: Hoare triple {1709#(<= 5 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1710#(<= 6 main_~i~0)} is VALID [2020-07-10 15:27:53,089 INFO L280 TraceCheckUtils]: 15: Hoare triple {1710#(<= 6 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1710#(<= 6 main_~i~0)} is VALID [2020-07-10 15:27:53,090 INFO L280 TraceCheckUtils]: 16: Hoare triple {1710#(<= 6 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1711#(<= 7 main_~i~0)} is VALID [2020-07-10 15:27:53,090 INFO L280 TraceCheckUtils]: 17: Hoare triple {1711#(<= 7 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1711#(<= 7 main_~i~0)} is VALID [2020-07-10 15:27:53,091 INFO L280 TraceCheckUtils]: 18: Hoare triple {1711#(<= 7 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1712#(<= 8 main_~i~0)} is VALID [2020-07-10 15:27:53,091 INFO L280 TraceCheckUtils]: 19: Hoare triple {1712#(<= 8 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1712#(<= 8 main_~i~0)} is VALID [2020-07-10 15:27:53,092 INFO L280 TraceCheckUtils]: 20: Hoare triple {1712#(<= 8 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1713#(<= 9 main_~i~0)} is VALID [2020-07-10 15:27:53,093 INFO L280 TraceCheckUtils]: 21: Hoare triple {1713#(<= 9 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1702#false} is VALID [2020-07-10 15:27:53,093 INFO L280 TraceCheckUtils]: 22: Hoare triple {1702#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1702#false} is VALID [2020-07-10 15:27:53,093 INFO L280 TraceCheckUtils]: 23: Hoare triple {1702#false} assume !(~i~0 <= 8); {1702#false} is VALID [2020-07-10 15:27:53,093 INFO L263 TraceCheckUtils]: 24: Hoare triple {1702#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1702#false} is VALID [2020-07-10 15:27:53,093 INFO L280 TraceCheckUtils]: 25: Hoare triple {1702#false} ~cond := #in~cond; {1702#false} is VALID [2020-07-10 15:27:53,093 INFO L280 TraceCheckUtils]: 26: Hoare triple {1702#false} assume 0 == ~cond; {1702#false} is VALID [2020-07-10 15:27:53,094 INFO L280 TraceCheckUtils]: 27: Hoare triple {1702#false} assume !false; {1702#false} is VALID [2020-07-10 15:27:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:53,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799436043] [2020-07-10 15:27:53,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:53,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 15:27:53,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940252560] [2020-07-10 15:27:53,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:53,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:53,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:53,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:53,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:53,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:53,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:53,138 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2020-07-10 15:27:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:53,270 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-10 15:27:53,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:27:53,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2020-07-10 15:27:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2020-07-10 15:27:53,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 29 transitions. [2020-07-10 15:27:53,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:53,311 INFO L225 Difference]: With dead ends: 29 [2020-07-10 15:27:53,311 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:27:53,312 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:27:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:27:53,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:53,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:53,313 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:53,313 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:53,314 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:53,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:53,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:53,315 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:53,315 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:53,315 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:53,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:53,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:53,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:53,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:27:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:27:53,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2020-07-10 15:27:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:53,317 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:27:53,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:53,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:53,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:27:53,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:27:53,483 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:27:53,483 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:53,483 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:53,484 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:27:53,484 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:27:53,484 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:53,484 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-10 15:27:53,484 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2020-07-10 15:27:53,484 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2020-07-10 15:27:53,484 INFO L268 CegarLoopResult]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2020-07-10 15:27:53,485 INFO L264 CegarLoopResult]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 8 main_~sn~0) (<= 5 main_~i~0) (<= main_~sn~0 8) (<= main_~i~0 5)) (and (<= main_~i~0 3) (<= 4 main_~sn~0) (<= 3 main_~i~0) (<= main_~sn~0 4)) (and (<= main_~sn~0 0) (<= 0 main_~sn~0) (<= main_~i~0 1) (<= 1 main_~i~0)) (and (<= main_~sn~0 6) (<= main_~i~0 4) (<= 6 main_~sn~0) (<= 4 main_~i~0)) (and (<= 14 main_~sn~0) (<= main_~i~0 8) (<= 8 main_~i~0) (<= main_~sn~0 14)) (and (<= main_~sn~0 16) (<= 9 main_~i~0) (<= 16 main_~sn~0)) (and (<= main_~sn~0 10) (<= 10 main_~sn~0) (<= 6 main_~i~0) (<= main_~i~0 6)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0)) (and (<= 12 main_~sn~0) (<= main_~i~0 7) (<= 7 main_~i~0) (<= main_~sn~0 12))) [2020-07-10 15:27:53,485 INFO L264 CegarLoopResult]: At program point L13-4(lines 13 15) the Hoare annotation is: (and (<= main_~sn~0 16) (<= 16 main_~sn~0)) [2020-07-10 15:27:53,485 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 15:27:53,485 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:27:53,485 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:27:53,485 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:27:53,486 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-10 15:27:53,486 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:27:53,491 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:53,493 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:53,493 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:53,493 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:53,496 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-10 15:27:53,496 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:53,496 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:53,496 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:53,496 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:53,496 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-10 15:27:53,497 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:53,497 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:53,497 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:27:53,497 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:53,497 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:53,497 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:53,497 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:53,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:53 BoogieIcfgContainer [2020-07-10 15:27:53,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:53,521 INFO L168 Benchmark]: Toolchain (without parser) took 8590.17 ms. Allocated memory was 143.7 MB in the beginning and 286.8 MB in the end (delta: 143.1 MB). Free memory was 101.7 MB in the beginning and 200.3 MB in the end (delta: -98.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:53,522 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:53,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.84 ms. Allocated memory is still 143.7 MB. Free memory was 101.5 MB in the beginning and 92.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:53,523 INFO L168 Benchmark]: Boogie Preprocessor took 37.42 ms. Allocated memory is still 143.7 MB. Free memory was 92.0 MB in the beginning and 90.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:53,524 INFO L168 Benchmark]: RCFGBuilder took 465.29 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.4 MB in the beginning and 167.2 MB in the end (delta: -76.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:53,524 INFO L168 Benchmark]: TraceAbstraction took 7837.76 ms. Allocated memory was 201.3 MB in the beginning and 286.8 MB in the end (delta: 85.5 MB). Free memory was 166.5 MB in the beginning and 200.3 MB in the end (delta: -33.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:53,527 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.29 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 236.84 ms. Allocated memory is still 143.7 MB. Free memory was 101.5 MB in the beginning and 92.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.42 ms. Allocated memory is still 143.7 MB. Free memory was 92.0 MB in the beginning and 90.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 465.29 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.4 MB in the beginning and 167.2 MB in the end (delta: -76.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7837.76 ms. Allocated memory was 201.3 MB in the beginning and 286.8 MB in the end (delta: 85.5 MB). Free memory was 166.5 MB in the beginning and 200.3 MB in the end (delta: -33.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 13]: Loop Invariant Derived loop invariant: ((((((((((8 <= sn && 5 <= i) && sn <= 8) && i <= 5) || (((i <= 3 && 4 <= sn) && 3 <= i) && sn <= 4)) || (((sn <= 0 && 0 <= sn) && i <= 1) && 1 <= i)) || (((sn <= 6 && i <= 4) && 6 <= sn) && 4 <= i)) || (((14 <= sn && i <= 8) && 8 <= i) && sn <= 14)) || ((sn <= 16 && 9 <= i) && 16 <= sn)) || (((sn <= 10 && 10 <= sn) && 6 <= i) && i <= 6)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn)) || (((12 <= sn && i <= 7) && 7 <= i) && sn <= 12) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.5s, OverallIterations: 11, TraceHistogramMax: 9, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 120 SDtfs, 38 SDslu, 424 SDs, 0 SdLazy, 293 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 27 NumberOfFragments, 127 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 352 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 17729 SizeOfPredicates, 8 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 81/489 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...