/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:34:27,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:34:27,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:34:27,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:34:27,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:34:27,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:34:27,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:34:27,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:34:27,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:34:27,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:34:27,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:34:27,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:34:27,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:34:27,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:34:27,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:34:27,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:34:27,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:34:27,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:34:27,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:34:27,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:34:27,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:34:27,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:34:27,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:34:27,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:34:27,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:34:27,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:34:27,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:34:27,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:34:27,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:34:27,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:34:27,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:34:27,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:34:27,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:34:27,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:34:27,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:34:27,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:34:27,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:34:27,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:34:27,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:34:27,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:34:27,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:34:27,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 06:34:27,713 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:34:27,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:34:27,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:34:27,715 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:34:27,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:34:27,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:34:27,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:34:27,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:34:27,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:34:27,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:34:27,717 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:34:27,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:34:27,717 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:34:27,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:34:27,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:34:27,718 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:34:27,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:34:27,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:34:27,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:34:27,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:34:27,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:34:27,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:34:27,719 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 06:34:28,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:34:28,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:34:28,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:34:28,056 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:34:28,057 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:34:28,058 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-18 06:34:28,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524639085/def4f6deae374207834a57345bb057d3/FLAGbd7878b6b [2020-07-18 06:34:28,767 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:34:28,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2020-07-18 06:34:28,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524639085/def4f6deae374207834a57345bb057d3/FLAGbd7878b6b [2020-07-18 06:34:29,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524639085/def4f6deae374207834a57345bb057d3 [2020-07-18 06:34:29,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:34:29,118 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:34:29,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:34:29,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:34:29,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:34:29,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:34:29" (1/1) ... [2020-07-18 06:34:29,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e138d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29, skipping insertion in model container [2020-07-18 06:34:29,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:34:29" (1/1) ... [2020-07-18 06:34:29,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:34:29,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:34:29,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:34:29,343 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:34:29,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:34:29,382 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:34:29,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29 WrapperNode [2020-07-18 06:34:29,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:34:29,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:34:29,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:34:29,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:34:29,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29" (1/1) ... [2020-07-18 06:34:29,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29" (1/1) ... [2020-07-18 06:34:29,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29" (1/1) ... [2020-07-18 06:34:29,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29" (1/1) ... [2020-07-18 06:34:29,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29" (1/1) ... [2020-07-18 06:34:29,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29" (1/1) ... [2020-07-18 06:34:29,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29" (1/1) ... [2020-07-18 06:34:29,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:34:29,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:34:29,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:34:29,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:34:29,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29" (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-18 06:34:29,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:34:29,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:34:29,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:34:29,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:34:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:34:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:34:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:34:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:34:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:34:29,831 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:34:29,832 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 06:34:29,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:34:29 BoogieIcfgContainer [2020-07-18 06:34:29,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:34:29,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:34:29,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:34:29,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:34:29,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:34:29" (1/3) ... [2020-07-18 06:34:29,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23be9601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:34:29, skipping insertion in model container [2020-07-18 06:34:29,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:29" (2/3) ... [2020-07-18 06:34:29,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23be9601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:34:29, skipping insertion in model container [2020-07-18 06:34:29,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:34:29" (3/3) ... [2020-07-18 06:34:29,858 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2020-07-18 06:34:29,878 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:34:29,888 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:34:29,909 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:34:29,939 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:34:29,939 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:34:29,940 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:34:29,940 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:34:29,940 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:34:29,940 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:34:29,941 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:34:29,941 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:34:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-18 06:34:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-18 06:34:29,973 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:29,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:29,975 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash 129992897, now seen corresponding path program 1 times [2020-07-18 06:34:30,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:30,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [610012555] [2020-07-18 06:34:30,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:30,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-18 06:34:30,145 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #37#return; {26#true} is VALID [2020-07-18 06:34:30,147 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-18 06:34:30,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-18 06:34:30,148 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #37#return; {26#true} is VALID [2020-07-18 06:34:30,148 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret1 := main(); {26#true} is VALID [2020-07-18 06:34:30,148 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~i~0; {26#true} is VALID [2020-07-18 06:34:30,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} ~sn~0 := 0; {26#true} is VALID [2020-07-18 06:34:30,149 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} ~i~0 := 1; {26#true} is VALID [2020-07-18 06:34:30,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2020-07-18 06:34:30,152 INFO L263 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {27#false} is VALID [2020-07-18 06:34:30,152 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-18 06:34:30,153 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-18 06:34:30,153 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-18 06:34:30,155 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-18 06:34:30,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [610012555] [2020-07-18 06:34:30,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:30,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 06:34:30,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305390962] [2020-07-18 06:34:30,168 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-18 06:34:30,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:30,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 06:34:30,230 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-18 06:34:30,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 06:34:30,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 06:34:30,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 06:34:30,245 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2020-07-18 06:34:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:30,374 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-18 06:34:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 06:34:30,375 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-18 06:34:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:34:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2020-07-18 06:34:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:34:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2020-07-18 06:34:30,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2020-07-18 06:34:30,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:30,503 INFO L225 Difference]: With dead ends: 34 [2020-07-18 06:34:30,504 INFO L226 Difference]: Without dead ends: 17 [2020-07-18 06:34:30,509 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-18 06:34:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-18 06:34:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-18 06:34:30,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:30,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-18 06:34:30,582 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-18 06:34:30,583 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-18 06:34:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:30,587 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-18 06:34:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-18 06:34:30,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:30,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:30,589 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-18 06:34:30,589 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-18 06:34:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:30,593 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-18 06:34:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-18 06:34:30,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:30,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:30,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:30,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 06:34:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-18 06:34:30,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2020-07-18 06:34:30,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:30,601 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-18 06:34:30,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 06:34:30,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2020-07-18 06:34:30,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-18 06:34:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-18 06:34:30,637 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:30,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:30,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:34:30,638 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:30,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:30,639 INFO L82 PathProgramCache]: Analyzing trace with hash 121681208, now seen corresponding path program 1 times [2020-07-18 06:34:30,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:30,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584295997] [2020-07-18 06:34:30,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:30,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-18 06:34:30,712 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {168#true} {168#true} #37#return; {168#true} is VALID [2020-07-18 06:34:30,713 INFO L263 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2020-07-18 06:34:30,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-18 06:34:30,714 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #37#return; {168#true} is VALID [2020-07-18 06:34:30,714 INFO L263 TraceCheckUtils]: 3: Hoare triple {168#true} call #t~ret1 := main(); {168#true} is VALID [2020-07-18 06:34:30,715 INFO L280 TraceCheckUtils]: 4: Hoare triple {168#true} havoc ~i~0; {168#true} is VALID [2020-07-18 06:34:30,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {168#true} ~sn~0 := 0; {168#true} is VALID [2020-07-18 06:34:30,717 INFO L280 TraceCheckUtils]: 6: Hoare triple {168#true} ~i~0 := 1; {172#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:30,719 INFO L280 TraceCheckUtils]: 7: Hoare triple {172#(<= main_~i~0 1)} assume !(~i~0 <= 8); {169#false} is VALID [2020-07-18 06:34:30,720 INFO L263 TraceCheckUtils]: 8: Hoare triple {169#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {169#false} is VALID [2020-07-18 06:34:30,720 INFO L280 TraceCheckUtils]: 9: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2020-07-18 06:34:30,721 INFO L280 TraceCheckUtils]: 10: Hoare triple {169#false} assume 0 == ~cond; {169#false} is VALID [2020-07-18 06:34:30,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {169#false} assume !false; {169#false} is VALID [2020-07-18 06:34:30,722 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-18 06:34:30,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584295997] [2020-07-18 06:34:30,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:30,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 06:34:30,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058353241] [2020-07-18 06:34:30,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-18 06:34:30,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:30,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 06:34:30,748 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-18 06:34:30,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 06:34:30,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 06:34:30,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:34:30,750 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2020-07-18 06:34:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:30,834 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-18 06:34:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 06:34:30,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-18 06:34:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:34:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-18 06:34:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:34:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-18 06:34:30,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2020-07-18 06:34:30,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:30,889 INFO L225 Difference]: With dead ends: 26 [2020-07-18 06:34:30,889 INFO L226 Difference]: Without dead ends: 21 [2020-07-18 06:34:30,891 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-18 06:34:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-18 06:34:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2020-07-18 06:34:30,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:30,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 18 states. [2020-07-18 06:34:30,910 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 18 states. [2020-07-18 06:34:30,910 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 18 states. [2020-07-18 06:34:30,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:30,913 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-18 06:34:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-18 06:34:30,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:30,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:30,914 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 21 states. [2020-07-18 06:34:30,915 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 21 states. [2020-07-18 06:34:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:30,917 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-18 06:34:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-18 06:34:30,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:30,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:30,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:30,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-18 06:34:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-07-18 06:34:30,921 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2020-07-18 06:34:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:30,922 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-07-18 06:34:30,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 06:34:30,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2020-07-18 06:34:30,953 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-18 06:34:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-18 06:34:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-18 06:34:30,954 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:30,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:30,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:34:30,955 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:30,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash -917865259, now seen corresponding path program 1 times [2020-07-18 06:34:30,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:30,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [133429966] [2020-07-18 06:34:30,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:31,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-18 06:34:31,047 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {305#true} {305#true} #37#return; {305#true} is VALID [2020-07-18 06:34:31,047 INFO L263 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2020-07-18 06:34:31,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-18 06:34:31,048 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} #37#return; {305#true} is VALID [2020-07-18 06:34:31,049 INFO L263 TraceCheckUtils]: 3: Hoare triple {305#true} call #t~ret1 := main(); {305#true} is VALID [2020-07-18 06:34:31,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {305#true} havoc ~i~0; {305#true} is VALID [2020-07-18 06:34:31,049 INFO L280 TraceCheckUtils]: 5: Hoare triple {305#true} ~sn~0 := 0; {305#true} is VALID [2020-07-18 06:34:31,051 INFO L280 TraceCheckUtils]: 6: Hoare triple {305#true} ~i~0 := 1; {309#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:31,052 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {309#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:31,054 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {309#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:31,056 INFO L280 TraceCheckUtils]: 9: Hoare triple {309#(<= main_~i~0 1)} #t~post0 := ~i~0; {310#(<= |main_#t~post0| 1)} is VALID [2020-07-18 06:34:31,058 INFO L280 TraceCheckUtils]: 10: Hoare triple {310#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {311#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:31,073 INFO L280 TraceCheckUtils]: 11: Hoare triple {311#(<= main_~i~0 2)} havoc #t~post0; {311#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:31,075 INFO L280 TraceCheckUtils]: 12: Hoare triple {311#(<= main_~i~0 2)} assume !(~i~0 <= 8); {306#false} is VALID [2020-07-18 06:34:31,076 INFO L263 TraceCheckUtils]: 13: Hoare triple {306#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {306#false} is VALID [2020-07-18 06:34:31,076 INFO L280 TraceCheckUtils]: 14: Hoare triple {306#false} ~cond := #in~cond; {306#false} is VALID [2020-07-18 06:34:31,076 INFO L280 TraceCheckUtils]: 15: Hoare triple {306#false} assume 0 == ~cond; {306#false} is VALID [2020-07-18 06:34:31,077 INFO L280 TraceCheckUtils]: 16: Hoare triple {306#false} assume !false; {306#false} is VALID [2020-07-18 06:34:31,078 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-18 06:34:31,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [133429966] [2020-07-18 06:34:31,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:31,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-18 06:34:31,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097053227] [2020-07-18 06:34:31,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-18 06:34:31,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:31,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:34:31,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:31,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:34:31,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:31,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:34:31,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:34:31,120 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2020-07-18 06:34:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:31,285 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-18 06:34:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 06:34:31,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-18 06:34:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-18 06:34:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-18 06:34:31,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2020-07-18 06:34:31,339 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-18 06:34:31,341 INFO L225 Difference]: With dead ends: 31 [2020-07-18 06:34:31,342 INFO L226 Difference]: Without dead ends: 26 [2020-07-18 06:34:31,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:34:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-18 06:34:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2020-07-18 06:34:31,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:31,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 23 states. [2020-07-18 06:34:31,376 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 23 states. [2020-07-18 06:34:31,376 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 23 states. [2020-07-18 06:34:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:31,379 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-18 06:34:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-18 06:34:31,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:31,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:31,380 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states. [2020-07-18 06:34:31,380 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 26 states. [2020-07-18 06:34:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:31,383 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-18 06:34:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-18 06:34:31,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:31,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:31,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:31,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 06:34:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-18 06:34:31,387 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2020-07-18 06:34:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:31,387 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-18 06:34:31,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:34:31,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2020-07-18 06:34:31,417 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-18 06:34:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-18 06:34:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-18 06:34:31,419 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:31,419 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:31,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:34:31,420 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2060587176, now seen corresponding path program 2 times [2020-07-18 06:34:31,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:31,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1888301948] [2020-07-18 06:34:31,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:31,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-18 06:34:31,579 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {478#true} {478#true} #37#return; {478#true} is VALID [2020-07-18 06:34:31,579 INFO L263 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2020-07-18 06:34:31,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-18 06:34:31,580 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} #37#return; {478#true} is VALID [2020-07-18 06:34:31,580 INFO L263 TraceCheckUtils]: 3: Hoare triple {478#true} call #t~ret1 := main(); {478#true} is VALID [2020-07-18 06:34:31,580 INFO L280 TraceCheckUtils]: 4: Hoare triple {478#true} havoc ~i~0; {478#true} is VALID [2020-07-18 06:34:31,581 INFO L280 TraceCheckUtils]: 5: Hoare triple {478#true} ~sn~0 := 0; {478#true} is VALID [2020-07-18 06:34:31,582 INFO L280 TraceCheckUtils]: 6: Hoare triple {478#true} ~i~0 := 1; {482#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:31,583 INFO L280 TraceCheckUtils]: 7: Hoare triple {482#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {482#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:31,583 INFO L280 TraceCheckUtils]: 8: Hoare triple {482#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {482#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:31,585 INFO L280 TraceCheckUtils]: 9: Hoare triple {482#(<= main_~i~0 1)} #t~post0 := ~i~0; {483#(<= |main_#t~post0| 1)} is VALID [2020-07-18 06:34:31,586 INFO L280 TraceCheckUtils]: 10: Hoare triple {483#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {484#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:31,586 INFO L280 TraceCheckUtils]: 11: Hoare triple {484#(<= main_~i~0 2)} havoc #t~post0; {484#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:31,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {484#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {484#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:31,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {484#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {484#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:31,589 INFO L280 TraceCheckUtils]: 14: Hoare triple {484#(<= main_~i~0 2)} #t~post0 := ~i~0; {485#(<= |main_#t~post0| 2)} is VALID [2020-07-18 06:34:31,591 INFO L280 TraceCheckUtils]: 15: Hoare triple {485#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {486#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:31,592 INFO L280 TraceCheckUtils]: 16: Hoare triple {486#(<= main_~i~0 3)} havoc #t~post0; {486#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:31,593 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#(<= main_~i~0 3)} assume !(~i~0 <= 8); {479#false} is VALID [2020-07-18 06:34:31,593 INFO L263 TraceCheckUtils]: 18: Hoare triple {479#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {479#false} is VALID [2020-07-18 06:34:31,593 INFO L280 TraceCheckUtils]: 19: Hoare triple {479#false} ~cond := #in~cond; {479#false} is VALID [2020-07-18 06:34:31,593 INFO L280 TraceCheckUtils]: 20: Hoare triple {479#false} assume 0 == ~cond; {479#false} is VALID [2020-07-18 06:34:31,594 INFO L280 TraceCheckUtils]: 21: Hoare triple {479#false} assume !false; {479#false} is VALID [2020-07-18 06:34:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:31,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1888301948] [2020-07-18 06:34:31,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:31,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 06:34:31,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411969693] [2020-07-18 06:34:31,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-18 06:34:31,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:31,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 06:34:31,627 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-18 06:34:31,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 06:34:31,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 06:34:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:34:31,628 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2020-07-18 06:34:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:31,929 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-18 06:34:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 06:34:31,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-18 06:34:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:34:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2020-07-18 06:34:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:34:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2020-07-18 06:34:31,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2020-07-18 06:34:31,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:32,000 INFO L225 Difference]: With dead ends: 36 [2020-07-18 06:34:32,001 INFO L226 Difference]: Without dead ends: 31 [2020-07-18 06:34:32,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-18 06:34:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-18 06:34:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-18 06:34:32,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:32,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-18 06:34:32,052 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-18 06:34:32,052 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-18 06:34:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:32,059 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-18 06:34:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-18 06:34:32,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:32,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:32,064 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-18 06:34:32,064 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-18 06:34:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:32,071 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-18 06:34:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-18 06:34:32,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:32,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:32,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:32,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 06:34:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-18 06:34:32,080 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2020-07-18 06:34:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:32,080 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-18 06:34:32,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 06:34:32,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-18 06:34:32,120 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-18 06:34:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-18 06:34:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 06:34:32,122 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:32,122 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:32,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 06:34:32,123 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 657233589, now seen corresponding path program 3 times [2020-07-18 06:34:32,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:32,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [361040607] [2020-07-18 06:34:32,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:32,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {687#true} assume true; {687#true} is VALID [2020-07-18 06:34:32,271 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {687#true} {687#true} #37#return; {687#true} is VALID [2020-07-18 06:34:32,271 INFO L263 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {687#true} is VALID [2020-07-18 06:34:32,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {687#true} assume true; {687#true} is VALID [2020-07-18 06:34:32,272 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {687#true} {687#true} #37#return; {687#true} is VALID [2020-07-18 06:34:32,272 INFO L263 TraceCheckUtils]: 3: Hoare triple {687#true} call #t~ret1 := main(); {687#true} is VALID [2020-07-18 06:34:32,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {687#true} havoc ~i~0; {687#true} is VALID [2020-07-18 06:34:32,273 INFO L280 TraceCheckUtils]: 5: Hoare triple {687#true} ~sn~0 := 0; {687#true} is VALID [2020-07-18 06:34:32,274 INFO L280 TraceCheckUtils]: 6: Hoare triple {687#true} ~i~0 := 1; {691#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:32,275 INFO L280 TraceCheckUtils]: 7: Hoare triple {691#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {691#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:32,276 INFO L280 TraceCheckUtils]: 8: Hoare triple {691#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {691#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:32,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {691#(<= main_~i~0 1)} #t~post0 := ~i~0; {692#(<= |main_#t~post0| 1)} is VALID [2020-07-18 06:34:32,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {692#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {693#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:32,281 INFO L280 TraceCheckUtils]: 11: Hoare triple {693#(<= main_~i~0 2)} havoc #t~post0; {693#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:32,282 INFO L280 TraceCheckUtils]: 12: Hoare triple {693#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {693#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:32,283 INFO L280 TraceCheckUtils]: 13: Hoare triple {693#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {693#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:32,284 INFO L280 TraceCheckUtils]: 14: Hoare triple {693#(<= main_~i~0 2)} #t~post0 := ~i~0; {694#(<= |main_#t~post0| 2)} is VALID [2020-07-18 06:34:32,286 INFO L280 TraceCheckUtils]: 15: Hoare triple {694#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {695#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:32,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {695#(<= main_~i~0 3)} havoc #t~post0; {695#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:32,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {695#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {695#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:32,289 INFO L280 TraceCheckUtils]: 18: Hoare triple {695#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {695#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:32,290 INFO L280 TraceCheckUtils]: 19: Hoare triple {695#(<= main_~i~0 3)} #t~post0 := ~i~0; {696#(<= |main_#t~post0| 3)} is VALID [2020-07-18 06:34:32,291 INFO L280 TraceCheckUtils]: 20: Hoare triple {696#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {697#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:32,292 INFO L280 TraceCheckUtils]: 21: Hoare triple {697#(<= main_~i~0 4)} havoc #t~post0; {697#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:32,294 INFO L280 TraceCheckUtils]: 22: Hoare triple {697#(<= main_~i~0 4)} assume !(~i~0 <= 8); {688#false} is VALID [2020-07-18 06:34:32,295 INFO L263 TraceCheckUtils]: 23: Hoare triple {688#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {688#false} is VALID [2020-07-18 06:34:32,295 INFO L280 TraceCheckUtils]: 24: Hoare triple {688#false} ~cond := #in~cond; {688#false} is VALID [2020-07-18 06:34:32,295 INFO L280 TraceCheckUtils]: 25: Hoare triple {688#false} assume 0 == ~cond; {688#false} is VALID [2020-07-18 06:34:32,296 INFO L280 TraceCheckUtils]: 26: Hoare triple {688#false} assume !false; {688#false} is VALID [2020-07-18 06:34:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:32,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [361040607] [2020-07-18 06:34:32,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:32,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 06:34:32,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457682212] [2020-07-18 06:34:32,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-18 06:34:32,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:32,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 06:34:32,347 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-18 06:34:32,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 06:34:32,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:32,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 06:34:32,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-18 06:34:32,348 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2020-07-18 06:34:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:32,661 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-18 06:34:32,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 06:34:32,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-18 06:34:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:34:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2020-07-18 06:34:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:34:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2020-07-18 06:34:32,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2020-07-18 06:34:32,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:32,717 INFO L225 Difference]: With dead ends: 41 [2020-07-18 06:34:32,718 INFO L226 Difference]: Without dead ends: 36 [2020-07-18 06:34:32,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2020-07-18 06:34:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-18 06:34:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-18 06:34:32,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:32,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-18 06:34:32,752 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-18 06:34:32,752 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-18 06:34:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:32,754 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-18 06:34:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-18 06:34:32,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:32,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:32,756 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-18 06:34:32,756 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-18 06:34:32,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:32,759 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-18 06:34:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-18 06:34:32,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:32,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:32,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:32,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-18 06:34:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2020-07-18 06:34:32,762 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2020-07-18 06:34:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:32,763 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2020-07-18 06:34:32,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 06:34:32,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2020-07-18 06:34:32,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2020-07-18 06:34:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 06:34:32,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:32,802 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:32,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 06:34:32,803 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:32,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:32,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1410268808, now seen corresponding path program 4 times [2020-07-18 06:34:32,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:32,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1044973301] [2020-07-18 06:34:32,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:32,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {932#true} assume true; {932#true} is VALID [2020-07-18 06:34:32,973 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {932#true} {932#true} #37#return; {932#true} is VALID [2020-07-18 06:34:32,974 INFO L263 TraceCheckUtils]: 0: Hoare triple {932#true} call ULTIMATE.init(); {932#true} is VALID [2020-07-18 06:34:32,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {932#true} assume true; {932#true} is VALID [2020-07-18 06:34:32,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {932#true} {932#true} #37#return; {932#true} is VALID [2020-07-18 06:34:32,974 INFO L263 TraceCheckUtils]: 3: Hoare triple {932#true} call #t~ret1 := main(); {932#true} is VALID [2020-07-18 06:34:32,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {932#true} havoc ~i~0; {932#true} is VALID [2020-07-18 06:34:32,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {932#true} ~sn~0 := 0; {932#true} is VALID [2020-07-18 06:34:32,976 INFO L280 TraceCheckUtils]: 6: Hoare triple {932#true} ~i~0 := 1; {936#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:32,977 INFO L280 TraceCheckUtils]: 7: Hoare triple {936#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {936#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:32,978 INFO L280 TraceCheckUtils]: 8: Hoare triple {936#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {936#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:32,979 INFO L280 TraceCheckUtils]: 9: Hoare triple {936#(<= main_~i~0 1)} #t~post0 := ~i~0; {937#(<= |main_#t~post0| 1)} is VALID [2020-07-18 06:34:32,980 INFO L280 TraceCheckUtils]: 10: Hoare triple {937#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {938#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:32,982 INFO L280 TraceCheckUtils]: 11: Hoare triple {938#(<= main_~i~0 2)} havoc #t~post0; {938#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:32,983 INFO L280 TraceCheckUtils]: 12: Hoare triple {938#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {938#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:32,984 INFO L280 TraceCheckUtils]: 13: Hoare triple {938#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {938#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:32,985 INFO L280 TraceCheckUtils]: 14: Hoare triple {938#(<= main_~i~0 2)} #t~post0 := ~i~0; {939#(<= |main_#t~post0| 2)} is VALID [2020-07-18 06:34:32,986 INFO L280 TraceCheckUtils]: 15: Hoare triple {939#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {940#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:32,986 INFO L280 TraceCheckUtils]: 16: Hoare triple {940#(<= main_~i~0 3)} havoc #t~post0; {940#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:32,987 INFO L280 TraceCheckUtils]: 17: Hoare triple {940#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {940#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:32,988 INFO L280 TraceCheckUtils]: 18: Hoare triple {940#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {940#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:32,989 INFO L280 TraceCheckUtils]: 19: Hoare triple {940#(<= main_~i~0 3)} #t~post0 := ~i~0; {941#(<= |main_#t~post0| 3)} is VALID [2020-07-18 06:34:32,991 INFO L280 TraceCheckUtils]: 20: Hoare triple {941#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {942#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:32,992 INFO L280 TraceCheckUtils]: 21: Hoare triple {942#(<= main_~i~0 4)} havoc #t~post0; {942#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:33,008 INFO L280 TraceCheckUtils]: 22: Hoare triple {942#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {942#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:33,012 INFO L280 TraceCheckUtils]: 23: Hoare triple {942#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {942#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:33,013 INFO L280 TraceCheckUtils]: 24: Hoare triple {942#(<= main_~i~0 4)} #t~post0 := ~i~0; {943#(<= |main_#t~post0| 4)} is VALID [2020-07-18 06:34:33,015 INFO L280 TraceCheckUtils]: 25: Hoare triple {943#(<= |main_#t~post0| 4)} ~i~0 := 1 + #t~post0; {944#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:33,016 INFO L280 TraceCheckUtils]: 26: Hoare triple {944#(<= main_~i~0 5)} havoc #t~post0; {944#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:33,018 INFO L280 TraceCheckUtils]: 27: Hoare triple {944#(<= main_~i~0 5)} assume !(~i~0 <= 8); {933#false} is VALID [2020-07-18 06:34:33,019 INFO L263 TraceCheckUtils]: 28: Hoare triple {933#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {933#false} is VALID [2020-07-18 06:34:33,019 INFO L280 TraceCheckUtils]: 29: Hoare triple {933#false} ~cond := #in~cond; {933#false} is VALID [2020-07-18 06:34:33,019 INFO L280 TraceCheckUtils]: 30: Hoare triple {933#false} assume 0 == ~cond; {933#false} is VALID [2020-07-18 06:34:33,019 INFO L280 TraceCheckUtils]: 31: Hoare triple {933#false} assume !false; {933#false} is VALID [2020-07-18 06:34:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:33,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1044973301] [2020-07-18 06:34:33,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:33,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 06:34:33,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327031330] [2020-07-18 06:34:33,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2020-07-18 06:34:33,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:33,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 06:34:33,071 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-18 06:34:33,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 06:34:33,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:33,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 06:34:33,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-18 06:34:33,073 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2020-07-18 06:34:33,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:33,426 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-18 06:34:33,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-18 06:34:33,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2020-07-18 06:34:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2020-07-18 06:34:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2020-07-18 06:34:33,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2020-07-18 06:34:33,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:33,483 INFO L225 Difference]: With dead ends: 46 [2020-07-18 06:34:33,484 INFO L226 Difference]: Without dead ends: 41 [2020-07-18 06:34:33,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2020-07-18 06:34:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-18 06:34:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-07-18 06:34:33,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:33,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2020-07-18 06:34:33,537 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2020-07-18 06:34:33,537 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2020-07-18 06:34:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:33,539 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-18 06:34:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-18 06:34:33,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:33,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:33,541 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2020-07-18 06:34:33,541 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2020-07-18 06:34:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:33,543 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-18 06:34:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-18 06:34:33,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:33,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:33,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:33,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-18 06:34:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-18 06:34:33,547 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2020-07-18 06:34:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:33,547 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-18 06:34:33,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 06:34:33,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-18 06:34:33,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-18 06:34:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 06:34:33,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:33,595 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:33,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 06:34:33,596 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:33,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1340090219, now seen corresponding path program 5 times [2020-07-18 06:34:33,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:33,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084190201] [2020-07-18 06:34:33,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:33,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {1213#true} assume true; {1213#true} is VALID [2020-07-18 06:34:33,806 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1213#true} {1213#true} #37#return; {1213#true} is VALID [2020-07-18 06:34:33,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {1213#true} call ULTIMATE.init(); {1213#true} is VALID [2020-07-18 06:34:33,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {1213#true} assume true; {1213#true} is VALID [2020-07-18 06:34:33,806 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1213#true} {1213#true} #37#return; {1213#true} is VALID [2020-07-18 06:34:33,806 INFO L263 TraceCheckUtils]: 3: Hoare triple {1213#true} call #t~ret1 := main(); {1213#true} is VALID [2020-07-18 06:34:33,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {1213#true} havoc ~i~0; {1213#true} is VALID [2020-07-18 06:34:33,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {1213#true} ~sn~0 := 0; {1213#true} is VALID [2020-07-18 06:34:33,807 INFO L280 TraceCheckUtils]: 6: Hoare triple {1213#true} ~i~0 := 1; {1217#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:33,808 INFO L280 TraceCheckUtils]: 7: Hoare triple {1217#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1217#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:33,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {1217#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1217#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:33,809 INFO L280 TraceCheckUtils]: 9: Hoare triple {1217#(<= main_~i~0 1)} #t~post0 := ~i~0; {1218#(<= |main_#t~post0| 1)} is VALID [2020-07-18 06:34:33,810 INFO L280 TraceCheckUtils]: 10: Hoare triple {1218#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {1219#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:33,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {1219#(<= main_~i~0 2)} havoc #t~post0; {1219#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:33,812 INFO L280 TraceCheckUtils]: 12: Hoare triple {1219#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1219#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:33,812 INFO L280 TraceCheckUtils]: 13: Hoare triple {1219#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1219#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:33,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {1219#(<= main_~i~0 2)} #t~post0 := ~i~0; {1220#(<= |main_#t~post0| 2)} is VALID [2020-07-18 06:34:33,814 INFO L280 TraceCheckUtils]: 15: Hoare triple {1220#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {1221#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:33,814 INFO L280 TraceCheckUtils]: 16: Hoare triple {1221#(<= main_~i~0 3)} havoc #t~post0; {1221#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:33,815 INFO L280 TraceCheckUtils]: 17: Hoare triple {1221#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1221#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:33,815 INFO L280 TraceCheckUtils]: 18: Hoare triple {1221#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1221#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:33,816 INFO L280 TraceCheckUtils]: 19: Hoare triple {1221#(<= main_~i~0 3)} #t~post0 := ~i~0; {1222#(<= |main_#t~post0| 3)} is VALID [2020-07-18 06:34:33,817 INFO L280 TraceCheckUtils]: 20: Hoare triple {1222#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {1223#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:33,818 INFO L280 TraceCheckUtils]: 21: Hoare triple {1223#(<= main_~i~0 4)} havoc #t~post0; {1223#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:33,818 INFO L280 TraceCheckUtils]: 22: Hoare triple {1223#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1223#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:33,819 INFO L280 TraceCheckUtils]: 23: Hoare triple {1223#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {1223#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:33,820 INFO L280 TraceCheckUtils]: 24: Hoare triple {1223#(<= main_~i~0 4)} #t~post0 := ~i~0; {1224#(<= |main_#t~post0| 4)} is VALID [2020-07-18 06:34:33,820 INFO L280 TraceCheckUtils]: 25: Hoare triple {1224#(<= |main_#t~post0| 4)} ~i~0 := 1 + #t~post0; {1225#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:33,821 INFO L280 TraceCheckUtils]: 26: Hoare triple {1225#(<= main_~i~0 5)} havoc #t~post0; {1225#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:33,821 INFO L280 TraceCheckUtils]: 27: Hoare triple {1225#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1225#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:33,823 INFO L280 TraceCheckUtils]: 28: Hoare triple {1225#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {1225#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:33,824 INFO L280 TraceCheckUtils]: 29: Hoare triple {1225#(<= main_~i~0 5)} #t~post0 := ~i~0; {1226#(<= |main_#t~post0| 5)} is VALID [2020-07-18 06:34:33,827 INFO L280 TraceCheckUtils]: 30: Hoare triple {1226#(<= |main_#t~post0| 5)} ~i~0 := 1 + #t~post0; {1227#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:33,834 INFO L280 TraceCheckUtils]: 31: Hoare triple {1227#(<= main_~i~0 6)} havoc #t~post0; {1227#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:33,835 INFO L280 TraceCheckUtils]: 32: Hoare triple {1227#(<= main_~i~0 6)} assume !(~i~0 <= 8); {1214#false} is VALID [2020-07-18 06:34:33,835 INFO L263 TraceCheckUtils]: 33: Hoare triple {1214#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1214#false} is VALID [2020-07-18 06:34:33,836 INFO L280 TraceCheckUtils]: 34: Hoare triple {1214#false} ~cond := #in~cond; {1214#false} is VALID [2020-07-18 06:34:33,836 INFO L280 TraceCheckUtils]: 35: Hoare triple {1214#false} assume 0 == ~cond; {1214#false} is VALID [2020-07-18 06:34:33,836 INFO L280 TraceCheckUtils]: 36: Hoare triple {1214#false} assume !false; {1214#false} is VALID [2020-07-18 06:34:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:33,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084190201] [2020-07-18 06:34:33,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:33,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 06:34:33,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722428158] [2020-07-18 06:34:33,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-18 06:34:33,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:33,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 06:34:33,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:33,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 06:34:33,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 06:34:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-18 06:34:33,905 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 13 states. [2020-07-18 06:34:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:34,385 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-18 06:34:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-18 06:34:34,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-18 06:34:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2020-07-18 06:34:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2020-07-18 06:34:34,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 51 transitions. [2020-07-18 06:34:34,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:34,466 INFO L225 Difference]: With dead ends: 51 [2020-07-18 06:34:34,466 INFO L226 Difference]: Without dead ends: 46 [2020-07-18 06:34:34,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2020-07-18 06:34:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-18 06:34:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2020-07-18 06:34:34,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:34,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 43 states. [2020-07-18 06:34:34,524 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 43 states. [2020-07-18 06:34:34,525 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 43 states. [2020-07-18 06:34:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:34,527 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-18 06:34:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-18 06:34:34,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:34,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:34,528 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 46 states. [2020-07-18 06:34:34,528 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 46 states. [2020-07-18 06:34:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:34,533 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-18 06:34:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-18 06:34:34,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:34,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:34,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:34,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-18 06:34:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2020-07-18 06:34:34,536 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 37 [2020-07-18 06:34:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:34,536 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2020-07-18 06:34:34,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 06:34:34,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2020-07-18 06:34:34,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-18 06:34:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-18 06:34:34,586 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:34,586 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:34,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 06:34:34,587 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:34,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash 740027288, now seen corresponding path program 6 times [2020-07-18 06:34:34,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:34,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089211728] [2020-07-18 06:34:34,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:34,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-18 06:34:34,809 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1530#true} {1530#true} #37#return; {1530#true} is VALID [2020-07-18 06:34:34,810 INFO L263 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2020-07-18 06:34:34,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-18 06:34:34,810 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1530#true} {1530#true} #37#return; {1530#true} is VALID [2020-07-18 06:34:34,811 INFO L263 TraceCheckUtils]: 3: Hoare triple {1530#true} call #t~ret1 := main(); {1530#true} is VALID [2020-07-18 06:34:34,811 INFO L280 TraceCheckUtils]: 4: Hoare triple {1530#true} havoc ~i~0; {1530#true} is VALID [2020-07-18 06:34:34,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {1530#true} ~sn~0 := 0; {1530#true} is VALID [2020-07-18 06:34:34,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {1530#true} ~i~0 := 1; {1534#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:34,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {1534#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1534#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:34,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {1534#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1534#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:34,814 INFO L280 TraceCheckUtils]: 9: Hoare triple {1534#(<= main_~i~0 1)} #t~post0 := ~i~0; {1535#(<= |main_#t~post0| 1)} is VALID [2020-07-18 06:34:34,815 INFO L280 TraceCheckUtils]: 10: Hoare triple {1535#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {1536#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:34,816 INFO L280 TraceCheckUtils]: 11: Hoare triple {1536#(<= main_~i~0 2)} havoc #t~post0; {1536#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:34,816 INFO L280 TraceCheckUtils]: 12: Hoare triple {1536#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1536#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:34,817 INFO L280 TraceCheckUtils]: 13: Hoare triple {1536#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1536#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:34,818 INFO L280 TraceCheckUtils]: 14: Hoare triple {1536#(<= main_~i~0 2)} #t~post0 := ~i~0; {1537#(<= |main_#t~post0| 2)} is VALID [2020-07-18 06:34:34,819 INFO L280 TraceCheckUtils]: 15: Hoare triple {1537#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {1538#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:34,820 INFO L280 TraceCheckUtils]: 16: Hoare triple {1538#(<= main_~i~0 3)} havoc #t~post0; {1538#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:34,822 INFO L280 TraceCheckUtils]: 17: Hoare triple {1538#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1538#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:34,823 INFO L280 TraceCheckUtils]: 18: Hoare triple {1538#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1538#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:34,824 INFO L280 TraceCheckUtils]: 19: Hoare triple {1538#(<= main_~i~0 3)} #t~post0 := ~i~0; {1539#(<= |main_#t~post0| 3)} is VALID [2020-07-18 06:34:34,825 INFO L280 TraceCheckUtils]: 20: Hoare triple {1539#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {1540#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:34,825 INFO L280 TraceCheckUtils]: 21: Hoare triple {1540#(<= main_~i~0 4)} havoc #t~post0; {1540#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:34,825 INFO L280 TraceCheckUtils]: 22: Hoare triple {1540#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1540#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:34,826 INFO L280 TraceCheckUtils]: 23: Hoare triple {1540#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {1540#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:34,826 INFO L280 TraceCheckUtils]: 24: Hoare triple {1540#(<= main_~i~0 4)} #t~post0 := ~i~0; {1541#(<= |main_#t~post0| 4)} is VALID [2020-07-18 06:34:34,827 INFO L280 TraceCheckUtils]: 25: Hoare triple {1541#(<= |main_#t~post0| 4)} ~i~0 := 1 + #t~post0; {1542#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:34,828 INFO L280 TraceCheckUtils]: 26: Hoare triple {1542#(<= main_~i~0 5)} havoc #t~post0; {1542#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:34,830 INFO L280 TraceCheckUtils]: 27: Hoare triple {1542#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1542#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:34,835 INFO L280 TraceCheckUtils]: 28: Hoare triple {1542#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {1542#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:34,835 INFO L280 TraceCheckUtils]: 29: Hoare triple {1542#(<= main_~i~0 5)} #t~post0 := ~i~0; {1543#(<= |main_#t~post0| 5)} is VALID [2020-07-18 06:34:34,836 INFO L280 TraceCheckUtils]: 30: Hoare triple {1543#(<= |main_#t~post0| 5)} ~i~0 := 1 + #t~post0; {1544#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:34,837 INFO L280 TraceCheckUtils]: 31: Hoare triple {1544#(<= main_~i~0 6)} havoc #t~post0; {1544#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:34,838 INFO L280 TraceCheckUtils]: 32: Hoare triple {1544#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1544#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:34,838 INFO L280 TraceCheckUtils]: 33: Hoare triple {1544#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {1544#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:34,839 INFO L280 TraceCheckUtils]: 34: Hoare triple {1544#(<= main_~i~0 6)} #t~post0 := ~i~0; {1545#(<= |main_#t~post0| 6)} is VALID [2020-07-18 06:34:34,839 INFO L280 TraceCheckUtils]: 35: Hoare triple {1545#(<= |main_#t~post0| 6)} ~i~0 := 1 + #t~post0; {1546#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:34,840 INFO L280 TraceCheckUtils]: 36: Hoare triple {1546#(<= main_~i~0 7)} havoc #t~post0; {1546#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:34,841 INFO L280 TraceCheckUtils]: 37: Hoare triple {1546#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1531#false} is VALID [2020-07-18 06:34:34,841 INFO L263 TraceCheckUtils]: 38: Hoare triple {1531#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1531#false} is VALID [2020-07-18 06:34:34,841 INFO L280 TraceCheckUtils]: 39: Hoare triple {1531#false} ~cond := #in~cond; {1531#false} is VALID [2020-07-18 06:34:34,842 INFO L280 TraceCheckUtils]: 40: Hoare triple {1531#false} assume 0 == ~cond; {1531#false} is VALID [2020-07-18 06:34:34,842 INFO L280 TraceCheckUtils]: 41: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2020-07-18 06:34:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:34,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089211728] [2020-07-18 06:34:34,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:34,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-18 06:34:34,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277751199] [2020-07-18 06:34:34,845 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-18 06:34:34,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:34,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 06:34:34,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:34,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 06:34:34,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:34,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 06:34:34,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-18 06:34:34,913 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 15 states. [2020-07-18 06:34:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:35,449 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-07-18 06:34:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 06:34:35,450 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-18 06:34:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 06:34:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2020-07-18 06:34:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 06:34:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2020-07-18 06:34:35,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2020-07-18 06:34:35,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:35,541 INFO L225 Difference]: With dead ends: 56 [2020-07-18 06:34:35,542 INFO L226 Difference]: Without dead ends: 51 [2020-07-18 06:34:35,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2020-07-18 06:34:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-18 06:34:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2020-07-18 06:34:35,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:35,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 48 states. [2020-07-18 06:34:35,601 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 48 states. [2020-07-18 06:34:35,601 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 48 states. [2020-07-18 06:34:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:35,607 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-18 06:34:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-18 06:34:35,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:35,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:35,608 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 51 states. [2020-07-18 06:34:35,609 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 51 states. [2020-07-18 06:34:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:35,612 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-18 06:34:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-18 06:34:35,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:35,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:35,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:35,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 06:34:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-07-18 06:34:35,616 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 42 [2020-07-18 06:34:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:35,617 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-07-18 06:34:35,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 06:34:35,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2020-07-18 06:34:35,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-18 06:34:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 06:34:35,685 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:35,685 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:35,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 06:34:35,685 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:35,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:35,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1053966965, now seen corresponding path program 7 times [2020-07-18 06:34:35,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:35,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [976547365] [2020-07-18 06:34:35,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:36,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {1883#true} assume true; {1883#true} is VALID [2020-07-18 06:34:36,016 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1883#true} {1883#true} #37#return; {1883#true} is VALID [2020-07-18 06:34:36,016 INFO L263 TraceCheckUtils]: 0: Hoare triple {1883#true} call ULTIMATE.init(); {1883#true} is VALID [2020-07-18 06:34:36,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {1883#true} assume true; {1883#true} is VALID [2020-07-18 06:34:36,017 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1883#true} {1883#true} #37#return; {1883#true} is VALID [2020-07-18 06:34:36,017 INFO L263 TraceCheckUtils]: 3: Hoare triple {1883#true} call #t~ret1 := main(); {1883#true} is VALID [2020-07-18 06:34:36,017 INFO L280 TraceCheckUtils]: 4: Hoare triple {1883#true} havoc ~i~0; {1883#true} is VALID [2020-07-18 06:34:36,018 INFO L280 TraceCheckUtils]: 5: Hoare triple {1883#true} ~sn~0 := 0; {1883#true} is VALID [2020-07-18 06:34:36,019 INFO L280 TraceCheckUtils]: 6: Hoare triple {1883#true} ~i~0 := 1; {1887#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:36,020 INFO L280 TraceCheckUtils]: 7: Hoare triple {1887#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1887#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:36,021 INFO L280 TraceCheckUtils]: 8: Hoare triple {1887#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1887#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:36,022 INFO L280 TraceCheckUtils]: 9: Hoare triple {1887#(<= main_~i~0 1)} #t~post0 := ~i~0; {1888#(<= |main_#t~post0| 1)} is VALID [2020-07-18 06:34:36,023 INFO L280 TraceCheckUtils]: 10: Hoare triple {1888#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {1889#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:36,024 INFO L280 TraceCheckUtils]: 11: Hoare triple {1889#(<= main_~i~0 2)} havoc #t~post0; {1889#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:36,025 INFO L280 TraceCheckUtils]: 12: Hoare triple {1889#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1889#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:36,026 INFO L280 TraceCheckUtils]: 13: Hoare triple {1889#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1889#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:36,027 INFO L280 TraceCheckUtils]: 14: Hoare triple {1889#(<= main_~i~0 2)} #t~post0 := ~i~0; {1890#(<= |main_#t~post0| 2)} is VALID [2020-07-18 06:34:36,028 INFO L280 TraceCheckUtils]: 15: Hoare triple {1890#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {1891#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:36,029 INFO L280 TraceCheckUtils]: 16: Hoare triple {1891#(<= main_~i~0 3)} havoc #t~post0; {1891#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:36,029 INFO L280 TraceCheckUtils]: 17: Hoare triple {1891#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1891#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:36,030 INFO L280 TraceCheckUtils]: 18: Hoare triple {1891#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1891#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:36,031 INFO L280 TraceCheckUtils]: 19: Hoare triple {1891#(<= main_~i~0 3)} #t~post0 := ~i~0; {1892#(<= |main_#t~post0| 3)} is VALID [2020-07-18 06:34:36,032 INFO L280 TraceCheckUtils]: 20: Hoare triple {1892#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {1893#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:36,033 INFO L280 TraceCheckUtils]: 21: Hoare triple {1893#(<= main_~i~0 4)} havoc #t~post0; {1893#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:36,034 INFO L280 TraceCheckUtils]: 22: Hoare triple {1893#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1893#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:36,035 INFO L280 TraceCheckUtils]: 23: Hoare triple {1893#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {1893#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:36,037 INFO L280 TraceCheckUtils]: 24: Hoare triple {1893#(<= main_~i~0 4)} #t~post0 := ~i~0; {1894#(<= |main_#t~post0| 4)} is VALID [2020-07-18 06:34:36,038 INFO L280 TraceCheckUtils]: 25: Hoare triple {1894#(<= |main_#t~post0| 4)} ~i~0 := 1 + #t~post0; {1895#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:36,040 INFO L280 TraceCheckUtils]: 26: Hoare triple {1895#(<= main_~i~0 5)} havoc #t~post0; {1895#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:36,041 INFO L280 TraceCheckUtils]: 27: Hoare triple {1895#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1895#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:36,041 INFO L280 TraceCheckUtils]: 28: Hoare triple {1895#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {1895#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:36,042 INFO L280 TraceCheckUtils]: 29: Hoare triple {1895#(<= main_~i~0 5)} #t~post0 := ~i~0; {1896#(<= |main_#t~post0| 5)} is VALID [2020-07-18 06:34:36,043 INFO L280 TraceCheckUtils]: 30: Hoare triple {1896#(<= |main_#t~post0| 5)} ~i~0 := 1 + #t~post0; {1897#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:36,044 INFO L280 TraceCheckUtils]: 31: Hoare triple {1897#(<= main_~i~0 6)} havoc #t~post0; {1897#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:36,044 INFO L280 TraceCheckUtils]: 32: Hoare triple {1897#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1897#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:36,045 INFO L280 TraceCheckUtils]: 33: Hoare triple {1897#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {1897#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:36,047 INFO L280 TraceCheckUtils]: 34: Hoare triple {1897#(<= main_~i~0 6)} #t~post0 := ~i~0; {1898#(<= |main_#t~post0| 6)} is VALID [2020-07-18 06:34:36,056 INFO L280 TraceCheckUtils]: 35: Hoare triple {1898#(<= |main_#t~post0| 6)} ~i~0 := 1 + #t~post0; {1899#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:36,061 INFO L280 TraceCheckUtils]: 36: Hoare triple {1899#(<= main_~i~0 7)} havoc #t~post0; {1899#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:36,064 INFO L280 TraceCheckUtils]: 37: Hoare triple {1899#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1899#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:36,065 INFO L280 TraceCheckUtils]: 38: Hoare triple {1899#(<= main_~i~0 7)} ~sn~0 := 2 + ~sn~0; {1899#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:36,066 INFO L280 TraceCheckUtils]: 39: Hoare triple {1899#(<= main_~i~0 7)} #t~post0 := ~i~0; {1900#(<= |main_#t~post0| 7)} is VALID [2020-07-18 06:34:36,067 INFO L280 TraceCheckUtils]: 40: Hoare triple {1900#(<= |main_#t~post0| 7)} ~i~0 := 1 + #t~post0; {1901#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:36,067 INFO L280 TraceCheckUtils]: 41: Hoare triple {1901#(<= main_~i~0 8)} havoc #t~post0; {1901#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:36,068 INFO L280 TraceCheckUtils]: 42: Hoare triple {1901#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1884#false} is VALID [2020-07-18 06:34:36,069 INFO L263 TraceCheckUtils]: 43: Hoare triple {1884#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1884#false} is VALID [2020-07-18 06:34:36,069 INFO L280 TraceCheckUtils]: 44: Hoare triple {1884#false} ~cond := #in~cond; {1884#false} is VALID [2020-07-18 06:34:36,069 INFO L280 TraceCheckUtils]: 45: Hoare triple {1884#false} assume 0 == ~cond; {1884#false} is VALID [2020-07-18 06:34:36,069 INFO L280 TraceCheckUtils]: 46: Hoare triple {1884#false} assume !false; {1884#false} is VALID [2020-07-18 06:34:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:36,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [976547365] [2020-07-18 06:34:36,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:36,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-18 06:34:36,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907011300] [2020-07-18 06:34:36,077 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2020-07-18 06:34:36,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:36,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-18 06:34:36,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:36,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-18 06:34:36,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:36,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-18 06:34:36,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-18 06:34:36,143 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2020-07-18 06:34:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:36,753 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-18 06:34:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-18 06:34:36,753 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2020-07-18 06:34:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 06:34:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 58 transitions. [2020-07-18 06:34:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 06:34:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 58 transitions. [2020-07-18 06:34:36,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 58 transitions. [2020-07-18 06:34:36,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:36,836 INFO L225 Difference]: With dead ends: 58 [2020-07-18 06:34:36,837 INFO L226 Difference]: Without dead ends: 53 [2020-07-18 06:34:36,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2020-07-18 06:34:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-18 06:34:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-18 06:34:36,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:36,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-18 06:34:36,911 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-18 06:34:36,911 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-18 06:34:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:36,915 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-07-18 06:34:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-18 06:34:36,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:36,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:36,916 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-18 06:34:36,916 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-18 06:34:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:36,919 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-07-18 06:34:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-18 06:34:36,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:36,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:36,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:36,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-18 06:34:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2020-07-18 06:34:36,932 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2020-07-18 06:34:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:36,933 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2020-07-18 06:34:36,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-18 06:34:36,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2020-07-18 06:34:36,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-18 06:34:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 06:34:36,995 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:36,995 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:36,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 06:34:36,995 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1480544840, now seen corresponding path program 8 times [2020-07-18 06:34:36,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:36,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [110187308] [2020-07-18 06:34:36,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:37,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {2260#true} assume true; {2260#true} is VALID [2020-07-18 06:34:37,366 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2260#true} {2260#true} #37#return; {2260#true} is VALID [2020-07-18 06:34:37,366 INFO L263 TraceCheckUtils]: 0: Hoare triple {2260#true} call ULTIMATE.init(); {2260#true} is VALID [2020-07-18 06:34:37,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {2260#true} assume true; {2260#true} is VALID [2020-07-18 06:34:37,367 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2260#true} {2260#true} #37#return; {2260#true} is VALID [2020-07-18 06:34:37,367 INFO L263 TraceCheckUtils]: 3: Hoare triple {2260#true} call #t~ret1 := main(); {2260#true} is VALID [2020-07-18 06:34:37,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {2260#true} havoc ~i~0; {2260#true} is VALID [2020-07-18 06:34:37,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {2260#true} ~sn~0 := 0; {2264#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 06:34:37,377 INFO L280 TraceCheckUtils]: 6: Hoare triple {2264#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {2264#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 06:34:37,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {2264#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= 8); {2264#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 06:34:37,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {2264#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~sn~0 := 2 + ~sn~0; {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-18 06:34:37,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post0 := ~i~0; {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-18 06:34:37,380 INFO L280 TraceCheckUtils]: 10: Hoare triple {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} ~i~0 := 1 + #t~post0; {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-18 06:34:37,381 INFO L280 TraceCheckUtils]: 11: Hoare triple {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} havoc #t~post0; {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-18 06:34:37,382 INFO L280 TraceCheckUtils]: 12: Hoare triple {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8); {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-18 06:34:37,384 INFO L280 TraceCheckUtils]: 13: Hoare triple {2265#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} ~sn~0 := 2 + ~sn~0; {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-18 06:34:37,385 INFO L280 TraceCheckUtils]: 14: Hoare triple {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post0 := ~i~0; {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-18 06:34:37,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} ~i~0 := 1 + #t~post0; {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-18 06:34:37,387 INFO L280 TraceCheckUtils]: 16: Hoare triple {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} havoc #t~post0; {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-18 06:34:37,388 INFO L280 TraceCheckUtils]: 17: Hoare triple {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= 8); {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-18 06:34:37,390 INFO L280 TraceCheckUtils]: 18: Hoare triple {2266#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} ~sn~0 := 2 + ~sn~0; {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-18 06:34:37,391 INFO L280 TraceCheckUtils]: 19: Hoare triple {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} #t~post0 := ~i~0; {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-18 06:34:37,392 INFO L280 TraceCheckUtils]: 20: Hoare triple {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} ~i~0 := 1 + #t~post0; {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-18 06:34:37,392 INFO L280 TraceCheckUtils]: 21: Hoare triple {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} havoc #t~post0; {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-18 06:34:37,393 INFO L280 TraceCheckUtils]: 22: Hoare triple {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} assume !!(~i~0 <= 8); {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-18 06:34:37,396 INFO L280 TraceCheckUtils]: 23: Hoare triple {2267#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} ~sn~0 := 2 + ~sn~0; {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-18 06:34:37,397 INFO L280 TraceCheckUtils]: 24: Hoare triple {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} #t~post0 := ~i~0; {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-18 06:34:37,399 INFO L280 TraceCheckUtils]: 25: Hoare triple {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} ~i~0 := 1 + #t~post0; {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-18 06:34:37,400 INFO L280 TraceCheckUtils]: 26: Hoare triple {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} havoc #t~post0; {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-18 06:34:37,401 INFO L280 TraceCheckUtils]: 27: Hoare triple {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} assume !!(~i~0 <= 8); {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-18 06:34:37,403 INFO L280 TraceCheckUtils]: 28: Hoare triple {2268#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} ~sn~0 := 2 + ~sn~0; {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-18 06:34:37,404 INFO L280 TraceCheckUtils]: 29: Hoare triple {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} #t~post0 := ~i~0; {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-18 06:34:37,405 INFO L280 TraceCheckUtils]: 30: Hoare triple {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} ~i~0 := 1 + #t~post0; {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-18 06:34:37,406 INFO L280 TraceCheckUtils]: 31: Hoare triple {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} havoc #t~post0; {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-18 06:34:37,407 INFO L280 TraceCheckUtils]: 32: Hoare triple {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} assume !!(~i~0 <= 8); {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-18 06:34:37,407 INFO L280 TraceCheckUtils]: 33: Hoare triple {2269#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} ~sn~0 := 2 + ~sn~0; {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-18 06:34:37,408 INFO L280 TraceCheckUtils]: 34: Hoare triple {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post0 := ~i~0; {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-18 06:34:37,409 INFO L280 TraceCheckUtils]: 35: Hoare triple {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} ~i~0 := 1 + #t~post0; {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-18 06:34:37,409 INFO L280 TraceCheckUtils]: 36: Hoare triple {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} havoc #t~post0; {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-18 06:34:37,413 INFO L280 TraceCheckUtils]: 37: Hoare triple {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8); {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-18 06:34:37,414 INFO L280 TraceCheckUtils]: 38: Hoare triple {2270#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} ~sn~0 := 2 + ~sn~0; {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-18 06:34:37,415 INFO L280 TraceCheckUtils]: 39: Hoare triple {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post0 := ~i~0; {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-18 06:34:37,418 INFO L280 TraceCheckUtils]: 40: Hoare triple {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} ~i~0 := 1 + #t~post0; {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-18 06:34:37,421 INFO L280 TraceCheckUtils]: 41: Hoare triple {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} havoc #t~post0; {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-18 06:34:37,422 INFO L280 TraceCheckUtils]: 42: Hoare triple {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8); {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-18 06:34:37,422 INFO L280 TraceCheckUtils]: 43: Hoare triple {2271#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} ~sn~0 := 2 + ~sn~0; {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 06:34:37,423 INFO L280 TraceCheckUtils]: 44: Hoare triple {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} #t~post0 := ~i~0; {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 06:34:37,425 INFO L280 TraceCheckUtils]: 45: Hoare triple {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} ~i~0 := 1 + #t~post0; {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 06:34:37,425 INFO L280 TraceCheckUtils]: 46: Hoare triple {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} havoc #t~post0; {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 06:34:37,426 INFO L280 TraceCheckUtils]: 47: Hoare triple {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} assume !(~i~0 <= 8); {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 06:34:37,427 INFO L263 TraceCheckUtils]: 48: Hoare triple {2272#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2273#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:37,428 INFO L280 TraceCheckUtils]: 49: Hoare triple {2273#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2274#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:37,429 INFO L280 TraceCheckUtils]: 50: Hoare triple {2274#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2261#false} is VALID [2020-07-18 06:34:37,429 INFO L280 TraceCheckUtils]: 51: Hoare triple {2261#false} assume !false; {2261#false} is VALID [2020-07-18 06:34:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:37,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [110187308] [2020-07-18 06:34:37,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:37,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 06:34:37,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820581539] [2020-07-18 06:34:37,438 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-18 06:34:37,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:37,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 06:34:37,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:37,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 06:34:37,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:37,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 06:34:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-07-18 06:34:37,511 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 13 states. [2020-07-18 06:34:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:38,293 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2020-07-18 06:34:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-18 06:34:38,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-18 06:34:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2020-07-18 06:34:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2020-07-18 06:34:38,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2020-07-18 06:34:38,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:38,379 INFO L225 Difference]: With dead ends: 64 [2020-07-18 06:34:38,379 INFO L226 Difference]: Without dead ends: 59 [2020-07-18 06:34:38,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-18 06:34:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-18 06:34:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-07-18 06:34:38,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:38,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2020-07-18 06:34:38,505 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2020-07-18 06:34:38,505 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2020-07-18 06:34:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:38,507 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-18 06:34:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2020-07-18 06:34:38,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:38,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:38,508 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2020-07-18 06:34:38,508 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2020-07-18 06:34:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:38,510 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-18 06:34:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2020-07-18 06:34:38,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:38,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:38,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:38,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-18 06:34:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2020-07-18 06:34:38,513 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 52 [2020-07-18 06:34:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:38,513 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2020-07-18 06:34:38,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 06:34:38,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2020-07-18 06:34:38,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2020-07-18 06:34:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-18 06:34:38,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:38,585 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:38,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 06:34:38,585 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1401826219, now seen corresponding path program 9 times [2020-07-18 06:34:38,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:38,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227943646] [2020-07-18 06:34:38,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:38,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {2641#true} assume true; {2641#true} is VALID [2020-07-18 06:34:38,889 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2641#true} {2641#true} #37#return; {2641#true} is VALID [2020-07-18 06:34:38,889 INFO L263 TraceCheckUtils]: 0: Hoare triple {2641#true} call ULTIMATE.init(); {2641#true} is VALID [2020-07-18 06:34:38,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {2641#true} assume true; {2641#true} is VALID [2020-07-18 06:34:38,889 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2641#true} {2641#true} #37#return; {2641#true} is VALID [2020-07-18 06:34:38,889 INFO L263 TraceCheckUtils]: 3: Hoare triple {2641#true} call #t~ret1 := main(); {2641#true} is VALID [2020-07-18 06:34:38,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {2641#true} havoc ~i~0; {2641#true} is VALID [2020-07-18 06:34:38,890 INFO L280 TraceCheckUtils]: 5: Hoare triple {2641#true} ~sn~0 := 0; {2641#true} is VALID [2020-07-18 06:34:38,890 INFO L280 TraceCheckUtils]: 6: Hoare triple {2641#true} ~i~0 := 1; {2645#(<= 1 main_~i~0)} is VALID [2020-07-18 06:34:38,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {2645#(<= 1 main_~i~0)} assume !!(~i~0 <= 8); {2645#(<= 1 main_~i~0)} is VALID [2020-07-18 06:34:38,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {2645#(<= 1 main_~i~0)} ~sn~0 := 2 + ~sn~0; {2645#(<= 1 main_~i~0)} is VALID [2020-07-18 06:34:38,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {2645#(<= 1 main_~i~0)} #t~post0 := ~i~0; {2646#(<= 1 |main_#t~post0|)} is VALID [2020-07-18 06:34:38,893 INFO L280 TraceCheckUtils]: 10: Hoare triple {2646#(<= 1 |main_#t~post0|)} ~i~0 := 1 + #t~post0; {2647#(<= 2 main_~i~0)} is VALID [2020-07-18 06:34:38,893 INFO L280 TraceCheckUtils]: 11: Hoare triple {2647#(<= 2 main_~i~0)} havoc #t~post0; {2647#(<= 2 main_~i~0)} is VALID [2020-07-18 06:34:38,893 INFO L280 TraceCheckUtils]: 12: Hoare triple {2647#(<= 2 main_~i~0)} assume !!(~i~0 <= 8); {2647#(<= 2 main_~i~0)} is VALID [2020-07-18 06:34:38,894 INFO L280 TraceCheckUtils]: 13: Hoare triple {2647#(<= 2 main_~i~0)} ~sn~0 := 2 + ~sn~0; {2647#(<= 2 main_~i~0)} is VALID [2020-07-18 06:34:38,894 INFO L280 TraceCheckUtils]: 14: Hoare triple {2647#(<= 2 main_~i~0)} #t~post0 := ~i~0; {2648#(<= 2 |main_#t~post0|)} is VALID [2020-07-18 06:34:38,895 INFO L280 TraceCheckUtils]: 15: Hoare triple {2648#(<= 2 |main_#t~post0|)} ~i~0 := 1 + #t~post0; {2649#(<= 3 main_~i~0)} is VALID [2020-07-18 06:34:38,896 INFO L280 TraceCheckUtils]: 16: Hoare triple {2649#(<= 3 main_~i~0)} havoc #t~post0; {2649#(<= 3 main_~i~0)} is VALID [2020-07-18 06:34:38,896 INFO L280 TraceCheckUtils]: 17: Hoare triple {2649#(<= 3 main_~i~0)} assume !!(~i~0 <= 8); {2649#(<= 3 main_~i~0)} is VALID [2020-07-18 06:34:38,897 INFO L280 TraceCheckUtils]: 18: Hoare triple {2649#(<= 3 main_~i~0)} ~sn~0 := 2 + ~sn~0; {2649#(<= 3 main_~i~0)} is VALID [2020-07-18 06:34:38,897 INFO L280 TraceCheckUtils]: 19: Hoare triple {2649#(<= 3 main_~i~0)} #t~post0 := ~i~0; {2650#(<= 3 |main_#t~post0|)} is VALID [2020-07-18 06:34:38,898 INFO L280 TraceCheckUtils]: 20: Hoare triple {2650#(<= 3 |main_#t~post0|)} ~i~0 := 1 + #t~post0; {2651#(<= 4 main_~i~0)} is VALID [2020-07-18 06:34:38,902 INFO L280 TraceCheckUtils]: 21: Hoare triple {2651#(<= 4 main_~i~0)} havoc #t~post0; {2651#(<= 4 main_~i~0)} is VALID [2020-07-18 06:34:38,905 INFO L280 TraceCheckUtils]: 22: Hoare triple {2651#(<= 4 main_~i~0)} assume !!(~i~0 <= 8); {2651#(<= 4 main_~i~0)} is VALID [2020-07-18 06:34:38,906 INFO L280 TraceCheckUtils]: 23: Hoare triple {2651#(<= 4 main_~i~0)} ~sn~0 := 2 + ~sn~0; {2651#(<= 4 main_~i~0)} is VALID [2020-07-18 06:34:38,907 INFO L280 TraceCheckUtils]: 24: Hoare triple {2651#(<= 4 main_~i~0)} #t~post0 := ~i~0; {2652#(<= 4 |main_#t~post0|)} is VALID [2020-07-18 06:34:38,908 INFO L280 TraceCheckUtils]: 25: Hoare triple {2652#(<= 4 |main_#t~post0|)} ~i~0 := 1 + #t~post0; {2653#(<= 5 main_~i~0)} is VALID [2020-07-18 06:34:38,909 INFO L280 TraceCheckUtils]: 26: Hoare triple {2653#(<= 5 main_~i~0)} havoc #t~post0; {2653#(<= 5 main_~i~0)} is VALID [2020-07-18 06:34:38,909 INFO L280 TraceCheckUtils]: 27: Hoare triple {2653#(<= 5 main_~i~0)} assume !!(~i~0 <= 8); {2653#(<= 5 main_~i~0)} is VALID [2020-07-18 06:34:38,910 INFO L280 TraceCheckUtils]: 28: Hoare triple {2653#(<= 5 main_~i~0)} ~sn~0 := 2 + ~sn~0; {2653#(<= 5 main_~i~0)} is VALID [2020-07-18 06:34:38,911 INFO L280 TraceCheckUtils]: 29: Hoare triple {2653#(<= 5 main_~i~0)} #t~post0 := ~i~0; {2654#(<= 5 |main_#t~post0|)} is VALID [2020-07-18 06:34:38,912 INFO L280 TraceCheckUtils]: 30: Hoare triple {2654#(<= 5 |main_#t~post0|)} ~i~0 := 1 + #t~post0; {2655#(<= 6 main_~i~0)} is VALID [2020-07-18 06:34:38,913 INFO L280 TraceCheckUtils]: 31: Hoare triple {2655#(<= 6 main_~i~0)} havoc #t~post0; {2655#(<= 6 main_~i~0)} is VALID [2020-07-18 06:34:38,913 INFO L280 TraceCheckUtils]: 32: Hoare triple {2655#(<= 6 main_~i~0)} assume !!(~i~0 <= 8); {2655#(<= 6 main_~i~0)} is VALID [2020-07-18 06:34:38,914 INFO L280 TraceCheckUtils]: 33: Hoare triple {2655#(<= 6 main_~i~0)} ~sn~0 := 2 + ~sn~0; {2655#(<= 6 main_~i~0)} is VALID [2020-07-18 06:34:38,915 INFO L280 TraceCheckUtils]: 34: Hoare triple {2655#(<= 6 main_~i~0)} #t~post0 := ~i~0; {2656#(<= 6 |main_#t~post0|)} is VALID [2020-07-18 06:34:38,915 INFO L280 TraceCheckUtils]: 35: Hoare triple {2656#(<= 6 |main_#t~post0|)} ~i~0 := 1 + #t~post0; {2657#(<= 7 main_~i~0)} is VALID [2020-07-18 06:34:38,916 INFO L280 TraceCheckUtils]: 36: Hoare triple {2657#(<= 7 main_~i~0)} havoc #t~post0; {2657#(<= 7 main_~i~0)} is VALID [2020-07-18 06:34:38,916 INFO L280 TraceCheckUtils]: 37: Hoare triple {2657#(<= 7 main_~i~0)} assume !!(~i~0 <= 8); {2657#(<= 7 main_~i~0)} is VALID [2020-07-18 06:34:38,917 INFO L280 TraceCheckUtils]: 38: Hoare triple {2657#(<= 7 main_~i~0)} ~sn~0 := 2 + ~sn~0; {2657#(<= 7 main_~i~0)} is VALID [2020-07-18 06:34:38,917 INFO L280 TraceCheckUtils]: 39: Hoare triple {2657#(<= 7 main_~i~0)} #t~post0 := ~i~0; {2658#(<= 7 |main_#t~post0|)} is VALID [2020-07-18 06:34:38,918 INFO L280 TraceCheckUtils]: 40: Hoare triple {2658#(<= 7 |main_#t~post0|)} ~i~0 := 1 + #t~post0; {2659#(<= 8 main_~i~0)} is VALID [2020-07-18 06:34:38,919 INFO L280 TraceCheckUtils]: 41: Hoare triple {2659#(<= 8 main_~i~0)} havoc #t~post0; {2659#(<= 8 main_~i~0)} is VALID [2020-07-18 06:34:38,919 INFO L280 TraceCheckUtils]: 42: Hoare triple {2659#(<= 8 main_~i~0)} assume !!(~i~0 <= 8); {2659#(<= 8 main_~i~0)} is VALID [2020-07-18 06:34:38,919 INFO L280 TraceCheckUtils]: 43: Hoare triple {2659#(<= 8 main_~i~0)} ~sn~0 := 2 + ~sn~0; {2659#(<= 8 main_~i~0)} is VALID [2020-07-18 06:34:38,920 INFO L280 TraceCheckUtils]: 44: Hoare triple {2659#(<= 8 main_~i~0)} #t~post0 := ~i~0; {2660#(<= 8 |main_#t~post0|)} is VALID [2020-07-18 06:34:38,920 INFO L280 TraceCheckUtils]: 45: Hoare triple {2660#(<= 8 |main_#t~post0|)} ~i~0 := 1 + #t~post0; {2661#(<= 9 main_~i~0)} is VALID [2020-07-18 06:34:38,921 INFO L280 TraceCheckUtils]: 46: Hoare triple {2661#(<= 9 main_~i~0)} havoc #t~post0; {2661#(<= 9 main_~i~0)} is VALID [2020-07-18 06:34:38,922 INFO L280 TraceCheckUtils]: 47: Hoare triple {2661#(<= 9 main_~i~0)} assume !!(~i~0 <= 8); {2642#false} is VALID [2020-07-18 06:34:38,922 INFO L280 TraceCheckUtils]: 48: Hoare triple {2642#false} ~sn~0 := 2 + ~sn~0; {2642#false} is VALID [2020-07-18 06:34:38,922 INFO L280 TraceCheckUtils]: 49: Hoare triple {2642#false} #t~post0 := ~i~0; {2642#false} is VALID [2020-07-18 06:34:38,922 INFO L280 TraceCheckUtils]: 50: Hoare triple {2642#false} ~i~0 := 1 + #t~post0; {2642#false} is VALID [2020-07-18 06:34:38,923 INFO L280 TraceCheckUtils]: 51: Hoare triple {2642#false} havoc #t~post0; {2642#false} is VALID [2020-07-18 06:34:38,923 INFO L280 TraceCheckUtils]: 52: Hoare triple {2642#false} assume !(~i~0 <= 8); {2642#false} is VALID [2020-07-18 06:34:38,923 INFO L263 TraceCheckUtils]: 53: Hoare triple {2642#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2642#false} is VALID [2020-07-18 06:34:38,923 INFO L280 TraceCheckUtils]: 54: Hoare triple {2642#false} ~cond := #in~cond; {2642#false} is VALID [2020-07-18 06:34:38,923 INFO L280 TraceCheckUtils]: 55: Hoare triple {2642#false} assume 0 == ~cond; {2642#false} is VALID [2020-07-18 06:34:38,924 INFO L280 TraceCheckUtils]: 56: Hoare triple {2642#false} assume !false; {2642#false} is VALID [2020-07-18 06:34:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:38,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227943646] [2020-07-18 06:34:38,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:38,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-18 06:34:38,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445271562] [2020-07-18 06:34:38,929 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2020-07-18 06:34:38,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:38,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-18 06:34:39,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:39,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-18 06:34:39,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:39,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-18 06:34:39,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-18 06:34:39,006 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 19 states. [2020-07-18 06:34:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:39,667 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-18 06:34:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-18 06:34:39,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2020-07-18 06:34:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-18 06:34:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 58 transitions. [2020-07-18 06:34:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-18 06:34:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 58 transitions. [2020-07-18 06:34:39,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 58 transitions. [2020-07-18 06:34:39,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:39,748 INFO L225 Difference]: With dead ends: 58 [2020-07-18 06:34:39,748 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 06:34:39,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2020-07-18 06:34:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 06:34:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 06:34:39,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:39,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 06:34:39,751 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:34:39,751 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:34:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:39,752 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:34:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:34:39,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:39,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:39,752 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:34:39,752 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:34:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:39,753 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:34:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:34:39,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:39,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:39,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:39,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 06:34:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 06:34:39,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-07-18 06:34:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:39,754 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 06:34:39,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-18 06:34:39,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 06:34:39,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:34:39,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:39,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 06:34:39,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 06:34:40,378 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:34:40,378 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:34:40,378 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:34:40,378 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 06:34:40,378 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 06:34:40,378 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:34:40,378 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-18 06:34:40,379 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: true [2020-07-18 06:34:40,379 INFO L264 CegarLoopResult]: At program point L14(line 14) 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 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-18 06:34:40,379 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~sn~0 0) (<= 0 main_~sn~0)) [2020-07-18 06:34:40,379 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 17) the Hoare annotation is: true [2020-07-18 06:34:40,380 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 06:34:40,380 INFO L264 CegarLoopResult]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 14 main_~sn~0) (<= main_~i~0 7) (<= 7 main_~i~0) (<= main_~sn~0 14)) (and (<= main_~sn~0 16) (<= main_~i~0 8) (<= 8 main_~i~0) (<= 16 main_~sn~0)) (and (<= main_~sn~0 2) (<= 2 main_~sn~0) (<= main_~i~0 1) (<= 1 main_~i~0)) (and (<= 8 main_~sn~0) (<= main_~i~0 4) (<= main_~sn~0 8) (<= 4 main_~i~0)) (and (<= main_~i~0 3) (<= main_~sn~0 6) (<= 3 main_~i~0) (<= 6 main_~sn~0)) (and (<= 5 main_~i~0) (<= main_~i~0 5) (<= main_~sn~0 10) (<= 10 main_~sn~0)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= 4 main_~sn~0) (<= main_~sn~0 4)) (and (<= 12 main_~sn~0) (<= main_~sn~0 12) (<= 6 main_~i~0) (<= main_~i~0 6))) [2020-07-18 06:34:40,381 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (or (and (<= |main_#t~post0| 1) (<= 1 |main_#t~post0|) (<= main_~sn~0 2) (<= 2 main_~sn~0) (<= main_~i~0 1) (<= 1 main_~i~0)) (and (<= 12 main_~sn~0) (<= |main_#t~post0| 6) (<= main_~sn~0 12) (<= 6 |main_#t~post0|) (<= 6 main_~i~0) (<= main_~i~0 6)) (and (<= 2 main_~i~0) (<= 2 |main_#t~post0|) (<= main_~i~0 2) (<= 4 main_~sn~0) (<= |main_#t~post0| 2) (<= main_~sn~0 4)) (and (<= 8 |main_#t~post0|) (<= main_~sn~0 16) (<= main_~i~0 8) (<= 8 main_~i~0) (<= 16 main_~sn~0)) (and (<= 7 |main_#t~post0|) (<= 14 main_~sn~0) (<= main_~i~0 7) (<= 7 main_~i~0) (<= |main_#t~post0| 7) (<= main_~sn~0 14)) (and (<= |main_#t~post0| 5) (<= 5 |main_#t~post0|) (<= 5 main_~i~0) (<= main_~i~0 5) (<= main_~sn~0 10) (<= 10 main_~sn~0)) (and (<= main_~i~0 3) (<= main_~sn~0 6) (<= |main_#t~post0| 3) (<= 3 main_~i~0) (<= 6 main_~sn~0) (<= 3 |main_#t~post0|)) (and (<= 8 main_~sn~0) (<= |main_#t~post0| 4) (<= main_~i~0 4) (<= 4 |main_#t~post0|) (<= main_~sn~0 8) (<= 4 main_~i~0))) [2020-07-18 06:34:40,381 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (or (and (<= 12 main_~sn~0) (<= main_~i~0 7) (<= 7 main_~i~0) (<= |main_#t~post0| 6) (<= main_~sn~0 12) (<= 6 |main_#t~post0|)) (and (<= main_~i~0 3) (<= 2 |main_#t~post0|) (<= 4 main_~sn~0) (<= 3 main_~i~0) (<= |main_#t~post0| 2) (<= main_~sn~0 4)) (and (<= 2 main_~i~0) (<= |main_#t~post0| 1) (<= 1 |main_#t~post0|) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0)) (and (<= |main_#t~post0| 5) (<= 5 |main_#t~post0|) (<= main_~sn~0 10) (<= 10 main_~sn~0) (<= 6 main_~i~0) (<= main_~i~0 6)) (and (<= main_~sn~0 6) (<= main_~i~0 4) (<= |main_#t~post0| 3) (<= 6 main_~sn~0) (<= 4 main_~i~0) (<= 3 |main_#t~post0|)) (and (<= 8 |main_#t~post0|) (<= main_~sn~0 16) (<= 9 main_~i~0) (<= 16 main_~sn~0)) (and (<= 7 |main_#t~post0|) (<= 14 main_~sn~0) (<= main_~i~0 8) (<= |main_#t~post0| 7) (<= 8 main_~i~0) (<= main_~sn~0 14)) (and (<= 8 main_~sn~0) (<= |main_#t~post0| 4) (<= 5 main_~i~0) (<= 4 |main_#t~post0|) (<= main_~sn~0 8) (<= main_~i~0 5))) [2020-07-18 06:34:40,381 INFO L264 CegarLoopResult]: At program point L13-6(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 (<= main_~sn~0 16) (<= 9 main_~i~0) (<= 16 main_~sn~0)) (and (<= 14 main_~sn~0) (<= main_~i~0 8) (<= 8 main_~i~0) (<= main_~sn~0 14)) (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-18 06:34:40,382 INFO L264 CegarLoopResult]: At program point L13-7(lines 13 15) the Hoare annotation is: (and (<= main_~sn~0 16) (<= 16 main_~sn~0)) [2020-07-18 06:34:40,382 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-18 06:34:40,382 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 3 8) the Hoare annotation is: true [2020-07-18 06:34:40,382 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:34:40,382 INFO L264 CegarLoopResult]: At program point L4(lines 4 6) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 06:34:40,382 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:34:40,382 INFO L271 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2020-07-18 06:34:40,403 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 06:34:40,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:34:40 BoogieIcfgContainer [2020-07-18 06:34:40,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:34:40,428 INFO L168 Benchmark]: Toolchain (without parser) took 11310.56 ms. Allocated memory was 136.8 MB in the beginning and 345.5 MB in the end (delta: 208.7 MB). Free memory was 102.3 MB in the beginning and 218.6 MB in the end (delta: -116.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:40,428 INFO L168 Benchmark]: CDTParser took 1.17 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 06:34:40,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.07 ms. Allocated memory is still 136.8 MB. Free memory was 101.9 MB in the beginning and 92.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:40,430 INFO L168 Benchmark]: Boogie Preprocessor took 41.81 ms. Allocated memory is still 136.8 MB. Free memory was 92.4 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:40,430 INFO L168 Benchmark]: RCFGBuilder took 415.63 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.9 MB in the beginning and 166.3 MB in the end (delta: -75.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:40,431 INFO L168 Benchmark]: TraceAbstraction took 10579.73 ms. Allocated memory was 200.8 MB in the beginning and 345.5 MB in the end (delta: 144.7 MB). Free memory was 165.6 MB in the beginning and 218.6 MB in the end (delta: -53.0 MB). Peak memory consumption was 91.7 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:40,435 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 1.17 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 264.07 ms. Allocated memory is still 136.8 MB. Free memory was 101.9 MB in the beginning and 92.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.81 ms. Allocated memory is still 136.8 MB. Free memory was 92.4 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 415.63 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.9 MB in the beginning and 166.3 MB in the end (delta: -75.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10579.73 ms. Allocated memory was 200.8 MB in the beginning and 345.5 MB in the end (delta: 144.7 MB). Free memory was 165.6 MB in the beginning and 218.6 MB in the end (delta: -53.0 MB). Peak memory consumption was 91.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)) || ((sn <= 16 && 9 <= i) && 16 <= sn)) || (((14 <= sn && i <= 8) && 8 <= i) && sn <= 14)) || (((sn <= 10 && 10 <= sn) && 6 <= i) && i <= 6)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn)) || (((12 <= sn && i <= 7) && 7 <= i) && sn <= 12) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.8s, OverallIterations: 11, TraceHistogramMax: 9, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 203 SDtfs, 125 SDslu, 1195 SDs, 0 SdLazy, 540 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 22 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 83 PreInvPairs, 149 NumberOfFragments, 663 HoareAnnotationTreeSize, 83 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 41998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 189/645 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...