/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-8fc6572 [2020-07-11 02:28:05,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:28:05,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:28:05,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:28:05,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:28:05,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:28:05,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:28:05,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:28:05,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:28:05,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:28:05,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:28:05,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:28:05,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:28:05,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:28:05,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:28:05,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:28:05,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:28:05,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:28:05,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:28:05,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:28:05,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:28:05,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:28:05,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:28:05,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:28:05,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:28:05,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:28:05,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:28:05,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:28:05,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:28:05,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:28:05,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:28:05,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:28:05,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:28:05,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:28:05,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:28:05,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:28:05,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:28:05,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:28:05,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:28:05,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:28:05,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:28:05,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:28:05,351 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:28:05,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:28:05,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:28:05,353 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:28:05,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:28:05,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:28:05,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:28:05,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:28:05,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:28:05,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:28:05,354 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:28:05,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:28:05,355 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:28:05,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:28:05,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:28:05,355 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:28:05,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:28:05,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:28:05,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:28:05,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:28:05,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:28:05,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:28:05,357 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-11 02:28:05,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:28:05,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:28:05,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:28:05,715 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:28:05,716 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:28:05,717 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-11 02:28:05,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d423bc75/bf1c3d2655434bc1a9b45fbb13ad5011/FLAG131f7f6ce [2020-07-11 02:28:06,243 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:28:06,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2020-07-11 02:28:06,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d423bc75/bf1c3d2655434bc1a9b45fbb13ad5011/FLAG131f7f6ce [2020-07-11 02:28:06,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d423bc75/bf1c3d2655434bc1a9b45fbb13ad5011 [2020-07-11 02:28:06,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:28:06,649 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:28:06,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:28:06,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:28:06,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:28:06,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:28:06" (1/1) ... [2020-07-11 02:28:06,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f89a8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06, skipping insertion in model container [2020-07-11 02:28:06,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:28:06" (1/1) ... [2020-07-11 02:28:06,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:28:06,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:28:06,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:28:06,897 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:28:06,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:28:06,926 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:28:06,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06 WrapperNode [2020-07-11 02:28:06,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:28:06,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:28:06,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:28:06,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:28:06,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06" (1/1) ... [2020-07-11 02:28:06,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06" (1/1) ... [2020-07-11 02:28:06,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06" (1/1) ... [2020-07-11 02:28:06,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06" (1/1) ... [2020-07-11 02:28:06,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06" (1/1) ... [2020-07-11 02:28:06,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06" (1/1) ... [2020-07-11 02:28:06,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06" (1/1) ... [2020-07-11 02:28:07,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:28:07,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:28:07,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:28:07,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:28:07,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06" (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-11 02:28:07,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:28:07,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:28:07,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:28:07,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:28:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:28:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:28:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:28:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:28:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:28:07,336 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:28:07,337 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:28:07,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:28:07 BoogieIcfgContainer [2020-07-11 02:28:07,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:28:07,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:28:07,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:28:07,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:28:07,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:28:06" (1/3) ... [2020-07-11 02:28:07,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e7b544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:28:07, skipping insertion in model container [2020-07-11 02:28:07,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:06" (2/3) ... [2020-07-11 02:28:07,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e7b544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:28:07, skipping insertion in model container [2020-07-11 02:28:07,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:28:07" (3/3) ... [2020-07-11 02:28:07,350 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2020-07-11 02:28:07,367 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:28:07,378 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:28:07,397 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:28:07,423 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:28:07,423 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:28:07,423 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:28:07,423 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:28:07,423 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:28:07,423 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:28:07,424 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:28:07,424 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:28:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-11 02:28:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-11 02:28:07,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:07,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:07,450 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:07,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:07,457 INFO L82 PathProgramCache]: Analyzing trace with hash 129992897, now seen corresponding path program 1 times [2020-07-11 02:28:07,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:07,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1367491389] [2020-07-11 02:28:07,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:07,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-11 02:28:07,602 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #37#return; {26#true} is VALID [2020-07-11 02:28:07,604 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-11 02:28:07,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-11 02:28:07,605 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #37#return; {26#true} is VALID [2020-07-11 02:28:07,605 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret1 := main(); {26#true} is VALID [2020-07-11 02:28:07,606 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~i~0; {26#true} is VALID [2020-07-11 02:28:07,606 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} ~sn~0 := 0; {26#true} is VALID [2020-07-11 02:28:07,607 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} ~i~0 := 1; {26#true} is VALID [2020-07-11 02:28:07,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2020-07-11 02:28:07,609 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-11 02:28:07,609 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-11 02:28:07,610 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-11 02:28:07,610 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-11 02:28:07,611 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-11 02:28:07,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1367491389] [2020-07-11 02:28:07,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:28:07,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-11 02:28:07,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901060592] [2020-07-11 02:28:07,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-11 02:28:07,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:07,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-11 02:28:07,688 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-11 02:28:07,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-11 02:28:07,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-11 02:28:07,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:28:07,702 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2020-07-11 02:28:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:07,802 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-11 02:28:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-11 02:28:07,803 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-11 02:28:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:28:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2020-07-11 02:28:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:28:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2020-07-11 02:28:07,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2020-07-11 02:28:07,893 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-11 02:28:07,904 INFO L225 Difference]: With dead ends: 34 [2020-07-11 02:28:07,904 INFO L226 Difference]: Without dead ends: 17 [2020-07-11 02:28:07,908 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-11 02:28:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-11 02:28:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-11 02:28:07,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:07,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-11 02:28:07,967 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-11 02:28:07,967 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-11 02:28:07,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:07,971 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-11 02:28:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-11 02:28:07,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:07,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:07,973 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-11 02:28:07,973 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-11 02:28:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:07,977 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-11 02:28:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-11 02:28:07,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:07,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:07,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:07,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:28:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-11 02:28:07,982 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2020-07-11 02:28:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:07,983 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-11 02:28:07,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-11 02:28:07,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2020-07-11 02:28:08,014 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-11 02:28:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-11 02:28:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-11 02:28:08,016 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:08,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:08,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:28:08,017 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:08,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash 121681208, now seen corresponding path program 1 times [2020-07-11 02:28:08,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:08,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1286996118] [2020-07-11 02:28:08,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:08,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-11 02:28:08,080 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {168#true} {168#true} #37#return; {168#true} is VALID [2020-07-11 02:28:08,080 INFO L263 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2020-07-11 02:28:08,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-11 02:28:08,081 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #37#return; {168#true} is VALID [2020-07-11 02:28:08,082 INFO L263 TraceCheckUtils]: 3: Hoare triple {168#true} call #t~ret1 := main(); {168#true} is VALID [2020-07-11 02:28:08,082 INFO L280 TraceCheckUtils]: 4: Hoare triple {168#true} havoc ~i~0; {168#true} is VALID [2020-07-11 02:28:08,082 INFO L280 TraceCheckUtils]: 5: Hoare triple {168#true} ~sn~0 := 0; {168#true} is VALID [2020-07-11 02:28:08,084 INFO L280 TraceCheckUtils]: 6: Hoare triple {168#true} ~i~0 := 1; {172#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:08,085 INFO L280 TraceCheckUtils]: 7: Hoare triple {172#(<= main_~i~0 1)} assume !(~i~0 <= 8); {169#false} is VALID [2020-07-11 02:28:08,086 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-11 02:28:08,086 INFO L280 TraceCheckUtils]: 9: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2020-07-11 02:28:08,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {169#false} assume 0 == ~cond; {169#false} is VALID [2020-07-11 02:28:08,087 INFO L280 TraceCheckUtils]: 11: Hoare triple {169#false} assume !false; {169#false} is VALID [2020-07-11 02:28:08,088 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-11 02:28:08,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1286996118] [2020-07-11 02:28:08,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:28:08,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:28:08,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883737657] [2020-07-11 02:28:08,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-11 02:28:08,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:08,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:28:08,110 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-11 02:28:08,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:28:08,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:08,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:28:08,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:28:08,111 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2020-07-11 02:28:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,181 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-11 02:28:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:28:08,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-11 02:28:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:28:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-11 02:28:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:28:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-11 02:28:08,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2020-07-11 02:28:08,227 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-11 02:28:08,229 INFO L225 Difference]: With dead ends: 26 [2020-07-11 02:28:08,229 INFO L226 Difference]: Without dead ends: 21 [2020-07-11 02:28:08,231 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-11 02:28:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-11 02:28:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2020-07-11 02:28:08,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:08,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 18 states. [2020-07-11 02:28:08,246 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 18 states. [2020-07-11 02:28:08,246 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 18 states. [2020-07-11 02:28:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,249 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-11 02:28:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-11 02:28:08,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:08,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:08,250 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 21 states. [2020-07-11 02:28:08,251 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 21 states. [2020-07-11 02:28:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,253 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-11 02:28:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-11 02:28:08,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:08,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:08,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:08,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-11 02:28:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-07-11 02:28:08,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2020-07-11 02:28:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:08,257 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-07-11 02:28:08,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:28:08,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2020-07-11 02:28:08,287 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-11 02:28:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-11 02:28:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-11 02:28:08,288 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:08,288 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:08,288 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:28:08,289 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash -917865259, now seen corresponding path program 1 times [2020-07-11 02:28:08,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:08,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1396172625] [2020-07-11 02:28:08,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:08,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-11 02:28:08,374 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {305#true} {305#true} #37#return; {305#true} is VALID [2020-07-11 02:28:08,375 INFO L263 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2020-07-11 02:28:08,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-11 02:28:08,375 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} #37#return; {305#true} is VALID [2020-07-11 02:28:08,376 INFO L263 TraceCheckUtils]: 3: Hoare triple {305#true} call #t~ret1 := main(); {305#true} is VALID [2020-07-11 02:28:08,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {305#true} havoc ~i~0; {305#true} is VALID [2020-07-11 02:28:08,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {305#true} ~sn~0 := 0; {305#true} is VALID [2020-07-11 02:28:08,378 INFO L280 TraceCheckUtils]: 6: Hoare triple {305#true} ~i~0 := 1; {309#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:08,379 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {309#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:08,380 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-11 02:28:08,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {309#(<= main_~i~0 1)} #t~post0 := ~i~0; {310#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:08,382 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-11 02:28:08,383 INFO L280 TraceCheckUtils]: 11: Hoare triple {311#(<= main_~i~0 2)} havoc #t~post0; {311#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:08,384 INFO L280 TraceCheckUtils]: 12: Hoare triple {311#(<= main_~i~0 2)} assume !(~i~0 <= 8); {306#false} is VALID [2020-07-11 02:28:08,385 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-11 02:28:08,385 INFO L280 TraceCheckUtils]: 14: Hoare triple {306#false} ~cond := #in~cond; {306#false} is VALID [2020-07-11 02:28:08,385 INFO L280 TraceCheckUtils]: 15: Hoare triple {306#false} assume 0 == ~cond; {306#false} is VALID [2020-07-11 02:28:08,386 INFO L280 TraceCheckUtils]: 16: Hoare triple {306#false} assume !false; {306#false} is VALID [2020-07-11 02:28:08,387 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-11 02:28:08,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1396172625] [2020-07-11 02:28:08,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:08,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-11 02:28:08,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436758630] [2020-07-11 02:28:08,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-11 02:28:08,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:08,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:28:08,415 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-11 02:28:08,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:28:08,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:28:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:28:08,416 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2020-07-11 02:28:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,564 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-11 02:28:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:28:08,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-11 02:28:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:28:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-11 02:28:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:28:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-11 02:28:08,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2020-07-11 02:28:08,608 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-11 02:28:08,610 INFO L225 Difference]: With dead ends: 31 [2020-07-11 02:28:08,610 INFO L226 Difference]: Without dead ends: 26 [2020-07-11 02:28:08,611 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-11 02:28:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-11 02:28:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2020-07-11 02:28:08,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:08,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 23 states. [2020-07-11 02:28:08,633 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 23 states. [2020-07-11 02:28:08,634 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 23 states. [2020-07-11 02:28:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,636 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-11 02:28:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-11 02:28:08,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:08,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:08,637 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states. [2020-07-11 02:28:08,637 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 26 states. [2020-07-11 02:28:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,641 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-11 02:28:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-11 02:28:08,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:08,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:08,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:08,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-11 02:28:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-11 02:28:08,644 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2020-07-11 02:28:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:08,645 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-11 02:28:08,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:28:08,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2020-07-11 02:28:08,675 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-11 02:28:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-11 02:28:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-11 02:28:08,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:08,676 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:08,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:28:08,677 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2060587176, now seen corresponding path program 2 times [2020-07-11 02:28:08,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:08,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1225486553] [2020-07-11 02:28:08,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:08,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-11 02:28:08,777 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {478#true} {478#true} #37#return; {478#true} is VALID [2020-07-11 02:28:08,778 INFO L263 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2020-07-11 02:28:08,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-11 02:28:08,778 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} #37#return; {478#true} is VALID [2020-07-11 02:28:08,779 INFO L263 TraceCheckUtils]: 3: Hoare triple {478#true} call #t~ret1 := main(); {478#true} is VALID [2020-07-11 02:28:08,779 INFO L280 TraceCheckUtils]: 4: Hoare triple {478#true} havoc ~i~0; {478#true} is VALID [2020-07-11 02:28:08,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {478#true} ~sn~0 := 0; {478#true} is VALID [2020-07-11 02:28:08,780 INFO L280 TraceCheckUtils]: 6: Hoare triple {478#true} ~i~0 := 1; {482#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:08,781 INFO L280 TraceCheckUtils]: 7: Hoare triple {482#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {482#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:08,781 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-11 02:28:08,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {482#(<= main_~i~0 1)} #t~post0 := ~i~0; {483#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:08,783 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-11 02:28:08,784 INFO L280 TraceCheckUtils]: 11: Hoare triple {484#(<= main_~i~0 2)} havoc #t~post0; {484#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:08,785 INFO L280 TraceCheckUtils]: 12: Hoare triple {484#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {484#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:08,786 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-11 02:28:08,787 INFO L280 TraceCheckUtils]: 14: Hoare triple {484#(<= main_~i~0 2)} #t~post0 := ~i~0; {485#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:08,788 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-11 02:28:08,789 INFO L280 TraceCheckUtils]: 16: Hoare triple {486#(<= main_~i~0 3)} havoc #t~post0; {486#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:08,790 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#(<= main_~i~0 3)} assume !(~i~0 <= 8); {479#false} is VALID [2020-07-11 02:28:08,790 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-11 02:28:08,790 INFO L280 TraceCheckUtils]: 19: Hoare triple {479#false} ~cond := #in~cond; {479#false} is VALID [2020-07-11 02:28:08,791 INFO L280 TraceCheckUtils]: 20: Hoare triple {479#false} assume 0 == ~cond; {479#false} is VALID [2020-07-11 02:28:08,791 INFO L280 TraceCheckUtils]: 21: Hoare triple {479#false} assume !false; {479#false} is VALID [2020-07-11 02:28:08,792 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-11 02:28:08,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1225486553] [2020-07-11 02:28:08,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:08,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 02:28:08,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198671800] [2020-07-11 02:28:08,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-11 02:28:08,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:08,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:28:08,822 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-11 02:28:08,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:28:08,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:28:08,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:28:08,823 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2020-07-11 02:28:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:09,017 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-11 02:28:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:28:09,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-11 02:28:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:28:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2020-07-11 02:28:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:28:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2020-07-11 02:28:09,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2020-07-11 02:28:09,068 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-11 02:28:09,070 INFO L225 Difference]: With dead ends: 36 [2020-07-11 02:28:09,070 INFO L226 Difference]: Without dead ends: 31 [2020-07-11 02:28:09,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:28:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-11 02:28:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-11 02:28:09,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:09,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-11 02:28:09,100 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-11 02:28:09,101 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-11 02:28:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:09,103 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-11 02:28:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-11 02:28:09,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:09,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:09,104 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-11 02:28:09,105 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-11 02:28:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:09,107 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-11 02:28:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-11 02:28:09,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:09,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:09,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:09,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 02:28:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-11 02:28:09,111 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2020-07-11 02:28:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:09,112 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-11 02:28:09,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:28:09,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-11 02:28:09,148 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-11 02:28:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 02:28:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 02:28:09,149 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:09,150 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:09,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:28:09,150 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:09,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash 657233589, now seen corresponding path program 3 times [2020-07-11 02:28:09,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:09,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947968383] [2020-07-11 02:28:09,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:09,284 INFO L280 TraceCheckUtils]: 0: Hoare triple {687#true} assume true; {687#true} is VALID [2020-07-11 02:28:09,284 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {687#true} {687#true} #37#return; {687#true} is VALID [2020-07-11 02:28:09,285 INFO L263 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {687#true} is VALID [2020-07-11 02:28:09,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {687#true} assume true; {687#true} is VALID [2020-07-11 02:28:09,285 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {687#true} {687#true} #37#return; {687#true} is VALID [2020-07-11 02:28:09,285 INFO L263 TraceCheckUtils]: 3: Hoare triple {687#true} call #t~ret1 := main(); {687#true} is VALID [2020-07-11 02:28:09,286 INFO L280 TraceCheckUtils]: 4: Hoare triple {687#true} havoc ~i~0; {687#true} is VALID [2020-07-11 02:28:09,286 INFO L280 TraceCheckUtils]: 5: Hoare triple {687#true} ~sn~0 := 0; {687#true} is VALID [2020-07-11 02:28:09,287 INFO L280 TraceCheckUtils]: 6: Hoare triple {687#true} ~i~0 := 1; {691#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,287 INFO L280 TraceCheckUtils]: 7: Hoare triple {691#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {691#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,288 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-11 02:28:09,289 INFO L280 TraceCheckUtils]: 9: Hoare triple {691#(<= main_~i~0 1)} #t~post0 := ~i~0; {692#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:09,290 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-11 02:28:09,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {693#(<= main_~i~0 2)} havoc #t~post0; {693#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,291 INFO L280 TraceCheckUtils]: 12: Hoare triple {693#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {693#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,292 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-11 02:28:09,293 INFO L280 TraceCheckUtils]: 14: Hoare triple {693#(<= main_~i~0 2)} #t~post0 := ~i~0; {694#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:09,294 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-11 02:28:09,295 INFO L280 TraceCheckUtils]: 16: Hoare triple {695#(<= main_~i~0 3)} havoc #t~post0; {695#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {695#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {695#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,296 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-11 02:28:09,297 INFO L280 TraceCheckUtils]: 19: Hoare triple {695#(<= main_~i~0 3)} #t~post0 := ~i~0; {696#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:09,298 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-11 02:28:09,299 INFO L280 TraceCheckUtils]: 21: Hoare triple {697#(<= main_~i~0 4)} havoc #t~post0; {697#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:09,300 INFO L280 TraceCheckUtils]: 22: Hoare triple {697#(<= main_~i~0 4)} assume !(~i~0 <= 8); {688#false} is VALID [2020-07-11 02:28:09,300 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-11 02:28:09,301 INFO L280 TraceCheckUtils]: 24: Hoare triple {688#false} ~cond := #in~cond; {688#false} is VALID [2020-07-11 02:28:09,301 INFO L280 TraceCheckUtils]: 25: Hoare triple {688#false} assume 0 == ~cond; {688#false} is VALID [2020-07-11 02:28:09,301 INFO L280 TraceCheckUtils]: 26: Hoare triple {688#false} assume !false; {688#false} is VALID [2020-07-11 02:28:09,303 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-11 02:28:09,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1947968383] [2020-07-11 02:28:09,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:09,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 02:28:09,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733355339] [2020-07-11 02:28:09,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-11 02:28:09,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:09,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:28:09,334 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-11 02:28:09,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:28:09,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:28:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:28:09,336 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2020-07-11 02:28:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:09,574 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-11 02:28:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:28:09,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-11 02:28:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:28:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2020-07-11 02:28:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:28:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2020-07-11 02:28:09,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2020-07-11 02:28:09,622 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-11 02:28:09,623 INFO L225 Difference]: With dead ends: 41 [2020-07-11 02:28:09,623 INFO L226 Difference]: Without dead ends: 36 [2020-07-11 02:28:09,624 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-11 02:28:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-11 02:28:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-11 02:28:09,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:09,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-11 02:28:09,652 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-11 02:28:09,652 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-11 02:28:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:09,655 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-11 02:28:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-11 02:28:09,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:09,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:09,656 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-11 02:28:09,656 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-11 02:28:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:09,658 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-11 02:28:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-11 02:28:09,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:09,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:09,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:09,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-11 02:28:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2020-07-11 02:28:09,662 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2020-07-11 02:28:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:09,662 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2020-07-11 02:28:09,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:28:09,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2020-07-11 02:28:09,696 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-11 02:28:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2020-07-11 02:28:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-11 02:28:09,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:09,697 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:09,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:28:09,698 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:09,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:09,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1410268808, now seen corresponding path program 4 times [2020-07-11 02:28:09,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:09,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [792628206] [2020-07-11 02:28:09,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:09,827 INFO L280 TraceCheckUtils]: 0: Hoare triple {932#true} assume true; {932#true} is VALID [2020-07-11 02:28:09,827 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {932#true} {932#true} #37#return; {932#true} is VALID [2020-07-11 02:28:09,828 INFO L263 TraceCheckUtils]: 0: Hoare triple {932#true} call ULTIMATE.init(); {932#true} is VALID [2020-07-11 02:28:09,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {932#true} assume true; {932#true} is VALID [2020-07-11 02:28:09,828 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {932#true} {932#true} #37#return; {932#true} is VALID [2020-07-11 02:28:09,829 INFO L263 TraceCheckUtils]: 3: Hoare triple {932#true} call #t~ret1 := main(); {932#true} is VALID [2020-07-11 02:28:09,829 INFO L280 TraceCheckUtils]: 4: Hoare triple {932#true} havoc ~i~0; {932#true} is VALID [2020-07-11 02:28:09,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {932#true} ~sn~0 := 0; {932#true} is VALID [2020-07-11 02:28:09,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {932#true} ~i~0 := 1; {936#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {936#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {936#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,831 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-11 02:28:09,832 INFO L280 TraceCheckUtils]: 9: Hoare triple {936#(<= main_~i~0 1)} #t~post0 := ~i~0; {937#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:09,833 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-11 02:28:09,834 INFO L280 TraceCheckUtils]: 11: Hoare triple {938#(<= main_~i~0 2)} havoc #t~post0; {938#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,835 INFO L280 TraceCheckUtils]: 12: Hoare triple {938#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {938#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,835 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-11 02:28:09,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {938#(<= main_~i~0 2)} #t~post0 := ~i~0; {939#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:09,837 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-11 02:28:09,838 INFO L280 TraceCheckUtils]: 16: Hoare triple {940#(<= main_~i~0 3)} havoc #t~post0; {940#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,838 INFO L280 TraceCheckUtils]: 17: Hoare triple {940#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {940#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,839 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-11 02:28:09,840 INFO L280 TraceCheckUtils]: 19: Hoare triple {940#(<= main_~i~0 3)} #t~post0 := ~i~0; {941#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:09,850 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-11 02:28:09,851 INFO L280 TraceCheckUtils]: 21: Hoare triple {942#(<= main_~i~0 4)} havoc #t~post0; {942#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:09,851 INFO L280 TraceCheckUtils]: 22: Hoare triple {942#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {942#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:09,852 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-11 02:28:09,853 INFO L280 TraceCheckUtils]: 24: Hoare triple {942#(<= main_~i~0 4)} #t~post0 := ~i~0; {943#(<= |main_#t~post0| 4)} is VALID [2020-07-11 02:28:09,854 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-11 02:28:09,854 INFO L280 TraceCheckUtils]: 26: Hoare triple {944#(<= main_~i~0 5)} havoc #t~post0; {944#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:09,855 INFO L280 TraceCheckUtils]: 27: Hoare triple {944#(<= main_~i~0 5)} assume !(~i~0 <= 8); {933#false} is VALID [2020-07-11 02:28:09,855 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-11 02:28:09,856 INFO L280 TraceCheckUtils]: 29: Hoare triple {933#false} ~cond := #in~cond; {933#false} is VALID [2020-07-11 02:28:09,856 INFO L280 TraceCheckUtils]: 30: Hoare triple {933#false} assume 0 == ~cond; {933#false} is VALID [2020-07-11 02:28:09,856 INFO L280 TraceCheckUtils]: 31: Hoare triple {933#false} assume !false; {933#false} is VALID [2020-07-11 02:28:09,858 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-11 02:28:09,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [792628206] [2020-07-11 02:28:09,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:09,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:28:09,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72143224] [2020-07-11 02:28:09,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2020-07-11 02:28:09,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:09,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:28:09,894 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-11 02:28:09,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:28:09,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:28:09,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:28:09,896 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2020-07-11 02:28:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:10,207 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-11 02:28:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-11 02:28:10,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2020-07-11 02:28:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:28:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2020-07-11 02:28:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:28:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2020-07-11 02:28:10,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2020-07-11 02:28:10,264 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-11 02:28:10,265 INFO L225 Difference]: With dead ends: 46 [2020-07-11 02:28:10,266 INFO L226 Difference]: Without dead ends: 41 [2020-07-11 02:28:10,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2020-07-11 02:28:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-11 02:28:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-07-11 02:28:10,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:10,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2020-07-11 02:28:10,315 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2020-07-11 02:28:10,316 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2020-07-11 02:28:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:10,318 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-11 02:28:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-11 02:28:10,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:10,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:10,319 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2020-07-11 02:28:10,319 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2020-07-11 02:28:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:10,322 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-11 02:28:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-11 02:28:10,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:10,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:10,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:10,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-11 02:28:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-11 02:28:10,327 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2020-07-11 02:28:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:10,327 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-11 02:28:10,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:28:10,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-11 02:28:10,376 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-11 02:28:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-11 02:28:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:28:10,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:10,378 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:10,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:28:10,378 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:10,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1340090219, now seen corresponding path program 5 times [2020-07-11 02:28:10,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:10,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91240532] [2020-07-11 02:28:10,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:10,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {1213#true} assume true; {1213#true} is VALID [2020-07-11 02:28:10,586 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1213#true} {1213#true} #37#return; {1213#true} is VALID [2020-07-11 02:28:10,587 INFO L263 TraceCheckUtils]: 0: Hoare triple {1213#true} call ULTIMATE.init(); {1213#true} is VALID [2020-07-11 02:28:10,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {1213#true} assume true; {1213#true} is VALID [2020-07-11 02:28:10,587 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1213#true} {1213#true} #37#return; {1213#true} is VALID [2020-07-11 02:28:10,587 INFO L263 TraceCheckUtils]: 3: Hoare triple {1213#true} call #t~ret1 := main(); {1213#true} is VALID [2020-07-11 02:28:10,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {1213#true} havoc ~i~0; {1213#true} is VALID [2020-07-11 02:28:10,588 INFO L280 TraceCheckUtils]: 5: Hoare triple {1213#true} ~sn~0 := 0; {1213#true} is VALID [2020-07-11 02:28:10,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {1213#true} ~i~0 := 1; {1217#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:10,588 INFO L280 TraceCheckUtils]: 7: Hoare triple {1217#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1217#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:10,589 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-11 02:28:10,589 INFO L280 TraceCheckUtils]: 9: Hoare triple {1217#(<= main_~i~0 1)} #t~post0 := ~i~0; {1218#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:10,590 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-11 02:28:10,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {1219#(<= main_~i~0 2)} havoc #t~post0; {1219#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:10,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {1219#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1219#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:10,592 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-11 02:28:10,592 INFO L280 TraceCheckUtils]: 14: Hoare triple {1219#(<= main_~i~0 2)} #t~post0 := ~i~0; {1220#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:10,593 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-11 02:28:10,593 INFO L280 TraceCheckUtils]: 16: Hoare triple {1221#(<= main_~i~0 3)} havoc #t~post0; {1221#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:10,594 INFO L280 TraceCheckUtils]: 17: Hoare triple {1221#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1221#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:10,595 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-11 02:28:10,595 INFO L280 TraceCheckUtils]: 19: Hoare triple {1221#(<= main_~i~0 3)} #t~post0 := ~i~0; {1222#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:10,596 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-11 02:28:10,596 INFO L280 TraceCheckUtils]: 21: Hoare triple {1223#(<= main_~i~0 4)} havoc #t~post0; {1223#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:10,597 INFO L280 TraceCheckUtils]: 22: Hoare triple {1223#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1223#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:10,597 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-11 02:28:10,598 INFO L280 TraceCheckUtils]: 24: Hoare triple {1223#(<= main_~i~0 4)} #t~post0 := ~i~0; {1224#(<= |main_#t~post0| 4)} is VALID [2020-07-11 02:28:10,598 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-11 02:28:10,599 INFO L280 TraceCheckUtils]: 26: Hoare triple {1225#(<= main_~i~0 5)} havoc #t~post0; {1225#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:10,599 INFO L280 TraceCheckUtils]: 27: Hoare triple {1225#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1225#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:10,600 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-11 02:28:10,601 INFO L280 TraceCheckUtils]: 29: Hoare triple {1225#(<= main_~i~0 5)} #t~post0 := ~i~0; {1226#(<= |main_#t~post0| 5)} is VALID [2020-07-11 02:28:10,601 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-11 02:28:10,608 INFO L280 TraceCheckUtils]: 31: Hoare triple {1227#(<= main_~i~0 6)} havoc #t~post0; {1227#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:10,609 INFO L280 TraceCheckUtils]: 32: Hoare triple {1227#(<= main_~i~0 6)} assume !(~i~0 <= 8); {1214#false} is VALID [2020-07-11 02:28:10,609 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-11 02:28:10,609 INFO L280 TraceCheckUtils]: 34: Hoare triple {1214#false} ~cond := #in~cond; {1214#false} is VALID [2020-07-11 02:28:10,609 INFO L280 TraceCheckUtils]: 35: Hoare triple {1214#false} assume 0 == ~cond; {1214#false} is VALID [2020-07-11 02:28:10,610 INFO L280 TraceCheckUtils]: 36: Hoare triple {1214#false} assume !false; {1214#false} is VALID [2020-07-11 02:28:10,611 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-11 02:28:10,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [91240532] [2020-07-11 02:28:10,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:10,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:28:10,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263756917] [2020-07-11 02:28:10,613 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-11 02:28:10,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:10,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:28:10,664 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-11 02:28:10,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:28:10,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:10,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:28:10,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:28:10,665 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 13 states. [2020-07-11 02:28:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:11,061 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-11 02:28:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 02:28:11,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-11 02:28:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:28:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2020-07-11 02:28:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:28:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2020-07-11 02:28:11,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 51 transitions. [2020-07-11 02:28:11,132 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-11 02:28:11,134 INFO L225 Difference]: With dead ends: 51 [2020-07-11 02:28:11,134 INFO L226 Difference]: Without dead ends: 46 [2020-07-11 02:28:11,136 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-11 02:28:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-11 02:28:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2020-07-11 02:28:11,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:11,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 43 states. [2020-07-11 02:28:11,182 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 43 states. [2020-07-11 02:28:11,182 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 43 states. [2020-07-11 02:28:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:11,184 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-11 02:28:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-11 02:28:11,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:11,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:11,185 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 46 states. [2020-07-11 02:28:11,186 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 46 states. [2020-07-11 02:28:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:11,187 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-11 02:28:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-11 02:28:11,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:11,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:11,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:11,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-11 02:28:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2020-07-11 02:28:11,190 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 37 [2020-07-11 02:28:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:11,191 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2020-07-11 02:28:11,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:28:11,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2020-07-11 02:28:11,227 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-11 02:28:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-11 02:28:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 02:28:11,229 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:11,229 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:11,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:28:11,230 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash 740027288, now seen corresponding path program 6 times [2020-07-11 02:28:11,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:11,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291054129] [2020-07-11 02:28:11,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:11,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-11 02:28:11,438 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1530#true} {1530#true} #37#return; {1530#true} is VALID [2020-07-11 02:28:11,438 INFO L263 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2020-07-11 02:28:11,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-11 02:28:11,438 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1530#true} {1530#true} #37#return; {1530#true} is VALID [2020-07-11 02:28:11,438 INFO L263 TraceCheckUtils]: 3: Hoare triple {1530#true} call #t~ret1 := main(); {1530#true} is VALID [2020-07-11 02:28:11,439 INFO L280 TraceCheckUtils]: 4: Hoare triple {1530#true} havoc ~i~0; {1530#true} is VALID [2020-07-11 02:28:11,439 INFO L280 TraceCheckUtils]: 5: Hoare triple {1530#true} ~sn~0 := 0; {1530#true} is VALID [2020-07-11 02:28:11,439 INFO L280 TraceCheckUtils]: 6: Hoare triple {1530#true} ~i~0 := 1; {1534#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:11,440 INFO L280 TraceCheckUtils]: 7: Hoare triple {1534#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1534#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:11,440 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-11 02:28:11,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {1534#(<= main_~i~0 1)} #t~post0 := ~i~0; {1535#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:11,441 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-11 02:28:11,442 INFO L280 TraceCheckUtils]: 11: Hoare triple {1536#(<= main_~i~0 2)} havoc #t~post0; {1536#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:11,442 INFO L280 TraceCheckUtils]: 12: Hoare triple {1536#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1536#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:11,443 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-11 02:28:11,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {1536#(<= main_~i~0 2)} #t~post0 := ~i~0; {1537#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:11,444 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-11 02:28:11,444 INFO L280 TraceCheckUtils]: 16: Hoare triple {1538#(<= main_~i~0 3)} havoc #t~post0; {1538#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:11,447 INFO L280 TraceCheckUtils]: 17: Hoare triple {1538#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1538#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:11,448 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-11 02:28:11,448 INFO L280 TraceCheckUtils]: 19: Hoare triple {1538#(<= main_~i~0 3)} #t~post0 := ~i~0; {1539#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:11,449 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-11 02:28:11,449 INFO L280 TraceCheckUtils]: 21: Hoare triple {1540#(<= main_~i~0 4)} havoc #t~post0; {1540#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:11,450 INFO L280 TraceCheckUtils]: 22: Hoare triple {1540#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1540#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:11,450 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-11 02:28:11,451 INFO L280 TraceCheckUtils]: 24: Hoare triple {1540#(<= main_~i~0 4)} #t~post0 := ~i~0; {1541#(<= |main_#t~post0| 4)} is VALID [2020-07-11 02:28:11,451 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-11 02:28:11,452 INFO L280 TraceCheckUtils]: 26: Hoare triple {1542#(<= main_~i~0 5)} havoc #t~post0; {1542#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:11,457 INFO L280 TraceCheckUtils]: 27: Hoare triple {1542#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1542#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:11,457 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-11 02:28:11,458 INFO L280 TraceCheckUtils]: 29: Hoare triple {1542#(<= main_~i~0 5)} #t~post0 := ~i~0; {1543#(<= |main_#t~post0| 5)} is VALID [2020-07-11 02:28:11,458 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-11 02:28:11,459 INFO L280 TraceCheckUtils]: 31: Hoare triple {1544#(<= main_~i~0 6)} havoc #t~post0; {1544#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:11,460 INFO L280 TraceCheckUtils]: 32: Hoare triple {1544#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1544#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:11,461 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-11 02:28:11,462 INFO L280 TraceCheckUtils]: 34: Hoare triple {1544#(<= main_~i~0 6)} #t~post0 := ~i~0; {1545#(<= |main_#t~post0| 6)} is VALID [2020-07-11 02:28:11,462 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-11 02:28:11,463 INFO L280 TraceCheckUtils]: 36: Hoare triple {1546#(<= main_~i~0 7)} havoc #t~post0; {1546#(<= main_~i~0 7)} is VALID [2020-07-11 02:28:11,463 INFO L280 TraceCheckUtils]: 37: Hoare triple {1546#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1531#false} is VALID [2020-07-11 02:28:11,463 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-11 02:28:11,464 INFO L280 TraceCheckUtils]: 39: Hoare triple {1531#false} ~cond := #in~cond; {1531#false} is VALID [2020-07-11 02:28:11,464 INFO L280 TraceCheckUtils]: 40: Hoare triple {1531#false} assume 0 == ~cond; {1531#false} is VALID [2020-07-11 02:28:11,464 INFO L280 TraceCheckUtils]: 41: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2020-07-11 02:28:11,466 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-11 02:28:11,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291054129] [2020-07-11 02:28:11,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:11,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 02:28:11,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780437857] [2020-07-11 02:28:11,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-11 02:28:11,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:11,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 02:28:11,515 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-11 02:28:11,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 02:28:11,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 02:28:11,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-11 02:28:11,517 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 15 states. [2020-07-11 02:28:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:11,979 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-07-11 02:28:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-11 02:28:11,979 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-11 02:28:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:28:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2020-07-11 02:28:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:28:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2020-07-11 02:28:11,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2020-07-11 02:28:12,048 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-11 02:28:12,049 INFO L225 Difference]: With dead ends: 56 [2020-07-11 02:28:12,049 INFO L226 Difference]: Without dead ends: 51 [2020-07-11 02:28:12,050 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-11 02:28:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-11 02:28:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2020-07-11 02:28:12,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:12,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 48 states. [2020-07-11 02:28:12,098 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 48 states. [2020-07-11 02:28:12,098 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 48 states. [2020-07-11 02:28:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:12,102 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-11 02:28:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-11 02:28:12,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:12,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:12,102 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 51 states. [2020-07-11 02:28:12,103 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 51 states. [2020-07-11 02:28:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:12,105 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-11 02:28:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-11 02:28:12,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:12,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:12,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:12,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-11 02:28:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-07-11 02:28:12,110 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 42 [2020-07-11 02:28:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:12,110 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-07-11 02:28:12,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 02:28:12,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2020-07-11 02:28:12,158 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-11 02:28:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-11 02:28:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-11 02:28:12,159 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:12,159 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:12,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:28:12,160 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1053966965, now seen corresponding path program 7 times [2020-07-11 02:28:12,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:12,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1692132737] [2020-07-11 02:28:12,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:12,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {1883#true} assume true; {1883#true} is VALID [2020-07-11 02:28:12,409 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1883#true} {1883#true} #37#return; {1883#true} is VALID [2020-07-11 02:28:12,410 INFO L263 TraceCheckUtils]: 0: Hoare triple {1883#true} call ULTIMATE.init(); {1883#true} is VALID [2020-07-11 02:28:12,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {1883#true} assume true; {1883#true} is VALID [2020-07-11 02:28:12,410 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1883#true} {1883#true} #37#return; {1883#true} is VALID [2020-07-11 02:28:12,410 INFO L263 TraceCheckUtils]: 3: Hoare triple {1883#true} call #t~ret1 := main(); {1883#true} is VALID [2020-07-11 02:28:12,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {1883#true} havoc ~i~0; {1883#true} is VALID [2020-07-11 02:28:12,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {1883#true} ~sn~0 := 0; {1883#true} is VALID [2020-07-11 02:28:12,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {1883#true} ~i~0 := 1; {1887#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:12,418 INFO L280 TraceCheckUtils]: 7: Hoare triple {1887#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1887#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:12,419 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-11 02:28:12,423 INFO L280 TraceCheckUtils]: 9: Hoare triple {1887#(<= main_~i~0 1)} #t~post0 := ~i~0; {1888#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:12,424 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-11 02:28:12,424 INFO L280 TraceCheckUtils]: 11: Hoare triple {1889#(<= main_~i~0 2)} havoc #t~post0; {1889#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:12,426 INFO L280 TraceCheckUtils]: 12: Hoare triple {1889#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1889#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:12,426 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-11 02:28:12,427 INFO L280 TraceCheckUtils]: 14: Hoare triple {1889#(<= main_~i~0 2)} #t~post0 := ~i~0; {1890#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:12,428 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-11 02:28:12,428 INFO L280 TraceCheckUtils]: 16: Hoare triple {1891#(<= main_~i~0 3)} havoc #t~post0; {1891#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:12,429 INFO L280 TraceCheckUtils]: 17: Hoare triple {1891#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1891#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:12,430 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-11 02:28:12,430 INFO L280 TraceCheckUtils]: 19: Hoare triple {1891#(<= main_~i~0 3)} #t~post0 := ~i~0; {1892#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:12,431 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-11 02:28:12,432 INFO L280 TraceCheckUtils]: 21: Hoare triple {1893#(<= main_~i~0 4)} havoc #t~post0; {1893#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:12,432 INFO L280 TraceCheckUtils]: 22: Hoare triple {1893#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1893#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:12,433 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-11 02:28:12,433 INFO L280 TraceCheckUtils]: 24: Hoare triple {1893#(<= main_~i~0 4)} #t~post0 := ~i~0; {1894#(<= |main_#t~post0| 4)} is VALID [2020-07-11 02:28:12,434 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-11 02:28:12,435 INFO L280 TraceCheckUtils]: 26: Hoare triple {1895#(<= main_~i~0 5)} havoc #t~post0; {1895#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:12,435 INFO L280 TraceCheckUtils]: 27: Hoare triple {1895#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1895#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:12,436 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-11 02:28:12,436 INFO L280 TraceCheckUtils]: 29: Hoare triple {1895#(<= main_~i~0 5)} #t~post0 := ~i~0; {1896#(<= |main_#t~post0| 5)} is VALID [2020-07-11 02:28:12,437 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-11 02:28:12,439 INFO L280 TraceCheckUtils]: 31: Hoare triple {1897#(<= main_~i~0 6)} havoc #t~post0; {1897#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:12,440 INFO L280 TraceCheckUtils]: 32: Hoare triple {1897#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1897#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:12,440 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-11 02:28:12,441 INFO L280 TraceCheckUtils]: 34: Hoare triple {1897#(<= main_~i~0 6)} #t~post0 := ~i~0; {1898#(<= |main_#t~post0| 6)} is VALID [2020-07-11 02:28:12,444 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-11 02:28:12,446 INFO L280 TraceCheckUtils]: 36: Hoare triple {1899#(<= main_~i~0 7)} havoc #t~post0; {1899#(<= main_~i~0 7)} is VALID [2020-07-11 02:28:12,449 INFO L280 TraceCheckUtils]: 37: Hoare triple {1899#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1899#(<= main_~i~0 7)} is VALID [2020-07-11 02:28:12,449 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-11 02:28:12,450 INFO L280 TraceCheckUtils]: 39: Hoare triple {1899#(<= main_~i~0 7)} #t~post0 := ~i~0; {1900#(<= |main_#t~post0| 7)} is VALID [2020-07-11 02:28:12,451 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-11 02:28:12,451 INFO L280 TraceCheckUtils]: 41: Hoare triple {1901#(<= main_~i~0 8)} havoc #t~post0; {1901#(<= main_~i~0 8)} is VALID [2020-07-11 02:28:12,451 INFO L280 TraceCheckUtils]: 42: Hoare triple {1901#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1884#false} is VALID [2020-07-11 02:28:12,452 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-11 02:28:12,452 INFO L280 TraceCheckUtils]: 44: Hoare triple {1884#false} ~cond := #in~cond; {1884#false} is VALID [2020-07-11 02:28:12,452 INFO L280 TraceCheckUtils]: 45: Hoare triple {1884#false} assume 0 == ~cond; {1884#false} is VALID [2020-07-11 02:28:12,452 INFO L280 TraceCheckUtils]: 46: Hoare triple {1884#false} assume !false; {1884#false} is VALID [2020-07-11 02:28:12,454 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-11 02:28:12,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1692132737] [2020-07-11 02:28:12,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:12,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-11 02:28:12,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269676915] [2020-07-11 02:28:12,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2020-07-11 02:28:12,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:12,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-11 02:28:12,507 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-11 02:28:12,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-11 02:28:12,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-11 02:28:12,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-11 02:28:12,509 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2020-07-11 02:28:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:13,052 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-11 02:28:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-11 02:28:13,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2020-07-11 02:28:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:28:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 58 transitions. [2020-07-11 02:28:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:28:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 58 transitions. [2020-07-11 02:28:13,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 58 transitions. [2020-07-11 02:28:13,116 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-11 02:28:13,117 INFO L225 Difference]: With dead ends: 58 [2020-07-11 02:28:13,117 INFO L226 Difference]: Without dead ends: 53 [2020-07-11 02:28:13,118 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-11 02:28:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-11 02:28:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-11 02:28:13,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:13,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-11 02:28:13,161 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-11 02:28:13,161 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-11 02:28:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:13,164 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-07-11 02:28:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-11 02:28:13,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:13,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:13,165 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-11 02:28:13,165 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-11 02:28:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:13,169 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-07-11 02:28:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-11 02:28:13,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:13,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:13,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:13,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-11 02:28:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2020-07-11 02:28:13,182 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2020-07-11 02:28:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:13,182 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2020-07-11 02:28:13,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-11 02:28:13,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2020-07-11 02:28:13,247 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-11 02:28:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-11 02:28:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 02:28:13,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:13,248 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:13,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 02:28:13,249 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1480544840, now seen corresponding path program 8 times [2020-07-11 02:28:13,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:13,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1102356852] [2020-07-11 02:28:13,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:13,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {2260#true} assume true; {2260#true} is VALID [2020-07-11 02:28:13,568 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2260#true} {2260#true} #37#return; {2260#true} is VALID [2020-07-11 02:28:13,568 INFO L263 TraceCheckUtils]: 0: Hoare triple {2260#true} call ULTIMATE.init(); {2260#true} is VALID [2020-07-11 02:28:13,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {2260#true} assume true; {2260#true} is VALID [2020-07-11 02:28:13,569 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2260#true} {2260#true} #37#return; {2260#true} is VALID [2020-07-11 02:28:13,569 INFO L263 TraceCheckUtils]: 3: Hoare triple {2260#true} call #t~ret1 := main(); {2260#true} is VALID [2020-07-11 02:28:13,569 INFO L280 TraceCheckUtils]: 4: Hoare triple {2260#true} havoc ~i~0; {2260#true} is VALID [2020-07-11 02:28:13,572 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-11 02:28:13,582 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-11 02:28:13,584 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-11 02:28:13,584 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-11 02:28:13,585 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-11 02:28:13,586 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-11 02:28:13,587 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-11 02:28:13,587 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-11 02:28:13,588 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-11 02:28:13,594 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-11 02:28:13,595 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-11 02:28:13,596 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-11 02:28:13,597 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-11 02:28:13,597 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-11 02:28:13,598 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-11 02:28:13,599 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-11 02:28:13,599 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-11 02:28:13,600 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-11 02:28:13,601 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-11 02:28:13,601 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-11 02:28:13,602 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-11 02:28:13,602 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-11 02:28:13,604 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-11 02:28:13,605 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-11 02:28:13,606 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-11 02:28:13,611 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-11 02:28:13,611 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-11 02:28:13,612 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-11 02:28:13,613 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-11 02:28:13,613 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-11 02:28:13,616 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-11 02:28:13,621 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-11 02:28:13,622 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-11 02:28:13,623 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-11 02:28:13,624 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-11 02:28:13,625 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-11 02:28:13,625 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-11 02:28:13,626 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-11 02:28:13,627 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-11 02:28:13,627 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-11 02:28:13,628 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-11 02:28:13,629 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-11 02:28:13,629 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-11 02:28:13,630 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-11 02:28:13,631 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-11 02:28:13,632 INFO L280 TraceCheckUtils]: 50: Hoare triple {2274#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2261#false} is VALID [2020-07-11 02:28:13,632 INFO L280 TraceCheckUtils]: 51: Hoare triple {2261#false} assume !false; {2261#false} is VALID [2020-07-11 02:28:13,641 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-11 02:28:13,642 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1102356852] [2020-07-11 02:28:13,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:13,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:28:13,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922665239] [2020-07-11 02:28:13,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-11 02:28:13,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:13,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:28:13,704 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-11 02:28:13,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:28:13,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:28:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:28:13,705 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 13 states. [2020-07-11 02:28:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:14,347 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2020-07-11 02:28:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:28:14,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-11 02:28:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:28:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2020-07-11 02:28:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:28:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2020-07-11 02:28:14,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2020-07-11 02:28:14,419 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-11 02:28:14,421 INFO L225 Difference]: With dead ends: 64 [2020-07-11 02:28:14,421 INFO L226 Difference]: Without dead ends: 59 [2020-07-11 02:28:14,422 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-11 02:28:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-11 02:28:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-07-11 02:28:14,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:14,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2020-07-11 02:28:14,511 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2020-07-11 02:28:14,511 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2020-07-11 02:28:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:14,514 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-11 02:28:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2020-07-11 02:28:14,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:14,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:14,514 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2020-07-11 02:28:14,515 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2020-07-11 02:28:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:14,516 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-11 02:28:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2020-07-11 02:28:14,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:14,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:14,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:14,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-11 02:28:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2020-07-11 02:28:14,519 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 52 [2020-07-11 02:28:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:14,519 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2020-07-11 02:28:14,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:28:14,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2020-07-11 02:28:14,580 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-11 02:28:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2020-07-11 02:28:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 02:28:14,582 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:14,582 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:14,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 02:28:14,583 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:14,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1401826219, now seen corresponding path program 9 times [2020-07-11 02:28:14,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:14,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [311433155] [2020-07-11 02:28:14,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:14,851 INFO L280 TraceCheckUtils]: 0: Hoare triple {2641#true} assume true; {2641#true} is VALID [2020-07-11 02:28:14,851 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2641#true} {2641#true} #37#return; {2641#true} is VALID [2020-07-11 02:28:14,852 INFO L263 TraceCheckUtils]: 0: Hoare triple {2641#true} call ULTIMATE.init(); {2641#true} is VALID [2020-07-11 02:28:14,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {2641#true} assume true; {2641#true} is VALID [2020-07-11 02:28:14,852 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2641#true} {2641#true} #37#return; {2641#true} is VALID [2020-07-11 02:28:14,852 INFO L263 TraceCheckUtils]: 3: Hoare triple {2641#true} call #t~ret1 := main(); {2641#true} is VALID [2020-07-11 02:28:14,852 INFO L280 TraceCheckUtils]: 4: Hoare triple {2641#true} havoc ~i~0; {2641#true} is VALID [2020-07-11 02:28:14,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {2641#true} ~sn~0 := 0; {2641#true} is VALID [2020-07-11 02:28:14,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {2641#true} ~i~0 := 1; {2645#(<= 1 main_~i~0)} is VALID [2020-07-11 02:28:14,853 INFO L280 TraceCheckUtils]: 7: Hoare triple {2645#(<= 1 main_~i~0)} assume !!(~i~0 <= 8); {2645#(<= 1 main_~i~0)} is VALID [2020-07-11 02:28:14,854 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-11 02:28:14,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {2645#(<= 1 main_~i~0)} #t~post0 := ~i~0; {2646#(<= 1 |main_#t~post0|)} is VALID [2020-07-11 02:28:14,855 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-11 02:28:14,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {2647#(<= 2 main_~i~0)} havoc #t~post0; {2647#(<= 2 main_~i~0)} is VALID [2020-07-11 02:28:14,855 INFO L280 TraceCheckUtils]: 12: Hoare triple {2647#(<= 2 main_~i~0)} assume !!(~i~0 <= 8); {2647#(<= 2 main_~i~0)} is VALID [2020-07-11 02:28:14,856 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-11 02:28:14,857 INFO L280 TraceCheckUtils]: 14: Hoare triple {2647#(<= 2 main_~i~0)} #t~post0 := ~i~0; {2648#(<= 2 |main_#t~post0|)} is VALID [2020-07-11 02:28:14,858 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-11 02:28:14,858 INFO L280 TraceCheckUtils]: 16: Hoare triple {2649#(<= 3 main_~i~0)} havoc #t~post0; {2649#(<= 3 main_~i~0)} is VALID [2020-07-11 02:28:14,858 INFO L280 TraceCheckUtils]: 17: Hoare triple {2649#(<= 3 main_~i~0)} assume !!(~i~0 <= 8); {2649#(<= 3 main_~i~0)} is VALID [2020-07-11 02:28:14,859 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-11 02:28:14,859 INFO L280 TraceCheckUtils]: 19: Hoare triple {2649#(<= 3 main_~i~0)} #t~post0 := ~i~0; {2650#(<= 3 |main_#t~post0|)} is VALID [2020-07-11 02:28:14,860 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-11 02:28:14,864 INFO L280 TraceCheckUtils]: 21: Hoare triple {2651#(<= 4 main_~i~0)} havoc #t~post0; {2651#(<= 4 main_~i~0)} is VALID [2020-07-11 02:28:14,865 INFO L280 TraceCheckUtils]: 22: Hoare triple {2651#(<= 4 main_~i~0)} assume !!(~i~0 <= 8); {2651#(<= 4 main_~i~0)} is VALID [2020-07-11 02:28:14,871 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-11 02:28:14,875 INFO L280 TraceCheckUtils]: 24: Hoare triple {2651#(<= 4 main_~i~0)} #t~post0 := ~i~0; {2652#(<= 4 |main_#t~post0|)} is VALID [2020-07-11 02:28:14,876 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-11 02:28:14,877 INFO L280 TraceCheckUtils]: 26: Hoare triple {2653#(<= 5 main_~i~0)} havoc #t~post0; {2653#(<= 5 main_~i~0)} is VALID [2020-07-11 02:28:14,877 INFO L280 TraceCheckUtils]: 27: Hoare triple {2653#(<= 5 main_~i~0)} assume !!(~i~0 <= 8); {2653#(<= 5 main_~i~0)} is VALID [2020-07-11 02:28:14,878 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-11 02:28:14,879 INFO L280 TraceCheckUtils]: 29: Hoare triple {2653#(<= 5 main_~i~0)} #t~post0 := ~i~0; {2654#(<= 5 |main_#t~post0|)} is VALID [2020-07-11 02:28:14,879 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-11 02:28:14,880 INFO L280 TraceCheckUtils]: 31: Hoare triple {2655#(<= 6 main_~i~0)} havoc #t~post0; {2655#(<= 6 main_~i~0)} is VALID [2020-07-11 02:28:14,880 INFO L280 TraceCheckUtils]: 32: Hoare triple {2655#(<= 6 main_~i~0)} assume !!(~i~0 <= 8); {2655#(<= 6 main_~i~0)} is VALID [2020-07-11 02:28:14,881 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-11 02:28:14,881 INFO L280 TraceCheckUtils]: 34: Hoare triple {2655#(<= 6 main_~i~0)} #t~post0 := ~i~0; {2656#(<= 6 |main_#t~post0|)} is VALID [2020-07-11 02:28:14,882 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-11 02:28:14,883 INFO L280 TraceCheckUtils]: 36: Hoare triple {2657#(<= 7 main_~i~0)} havoc #t~post0; {2657#(<= 7 main_~i~0)} is VALID [2020-07-11 02:28:14,883 INFO L280 TraceCheckUtils]: 37: Hoare triple {2657#(<= 7 main_~i~0)} assume !!(~i~0 <= 8); {2657#(<= 7 main_~i~0)} is VALID [2020-07-11 02:28:14,884 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-11 02:28:14,885 INFO L280 TraceCheckUtils]: 39: Hoare triple {2657#(<= 7 main_~i~0)} #t~post0 := ~i~0; {2658#(<= 7 |main_#t~post0|)} is VALID [2020-07-11 02:28:14,885 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-11 02:28:14,886 INFO L280 TraceCheckUtils]: 41: Hoare triple {2659#(<= 8 main_~i~0)} havoc #t~post0; {2659#(<= 8 main_~i~0)} is VALID [2020-07-11 02:28:14,886 INFO L280 TraceCheckUtils]: 42: Hoare triple {2659#(<= 8 main_~i~0)} assume !!(~i~0 <= 8); {2659#(<= 8 main_~i~0)} is VALID [2020-07-11 02:28:14,887 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-11 02:28:14,888 INFO L280 TraceCheckUtils]: 44: Hoare triple {2659#(<= 8 main_~i~0)} #t~post0 := ~i~0; {2660#(<= 8 |main_#t~post0|)} is VALID [2020-07-11 02:28:14,888 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-11 02:28:14,889 INFO L280 TraceCheckUtils]: 46: Hoare triple {2661#(<= 9 main_~i~0)} havoc #t~post0; {2661#(<= 9 main_~i~0)} is VALID [2020-07-11 02:28:14,890 INFO L280 TraceCheckUtils]: 47: Hoare triple {2661#(<= 9 main_~i~0)} assume !!(~i~0 <= 8); {2642#false} is VALID [2020-07-11 02:28:14,890 INFO L280 TraceCheckUtils]: 48: Hoare triple {2642#false} ~sn~0 := 2 + ~sn~0; {2642#false} is VALID [2020-07-11 02:28:14,890 INFO L280 TraceCheckUtils]: 49: Hoare triple {2642#false} #t~post0 := ~i~0; {2642#false} is VALID [2020-07-11 02:28:14,890 INFO L280 TraceCheckUtils]: 50: Hoare triple {2642#false} ~i~0 := 1 + #t~post0; {2642#false} is VALID [2020-07-11 02:28:14,890 INFO L280 TraceCheckUtils]: 51: Hoare triple {2642#false} havoc #t~post0; {2642#false} is VALID [2020-07-11 02:28:14,890 INFO L280 TraceCheckUtils]: 52: Hoare triple {2642#false} assume !(~i~0 <= 8); {2642#false} is VALID [2020-07-11 02:28:14,891 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-11 02:28:14,891 INFO L280 TraceCheckUtils]: 54: Hoare triple {2642#false} ~cond := #in~cond; {2642#false} is VALID [2020-07-11 02:28:14,891 INFO L280 TraceCheckUtils]: 55: Hoare triple {2642#false} assume 0 == ~cond; {2642#false} is VALID [2020-07-11 02:28:14,891 INFO L280 TraceCheckUtils]: 56: Hoare triple {2642#false} assume !false; {2642#false} is VALID [2020-07-11 02:28:14,894 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-11 02:28:14,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [311433155] [2020-07-11 02:28:14,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:28:14,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-11 02:28:14,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749523183] [2020-07-11 02:28:14,896 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2020-07-11 02:28:14,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:14,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-11 02:28:14,954 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-11 02:28:14,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-11 02:28:14,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:14,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-11 02:28:14,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-11 02:28:14,955 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 19 states. [2020-07-11 02:28:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:15,590 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-11 02:28:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-11 02:28:15,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2020-07-11 02:28:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-11 02:28:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 58 transitions. [2020-07-11 02:28:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-11 02:28:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 58 transitions. [2020-07-11 02:28:15,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 58 transitions. [2020-07-11 02:28:15,669 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-11 02:28:15,669 INFO L225 Difference]: With dead ends: 58 [2020-07-11 02:28:15,669 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:28:15,671 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-11 02:28:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:28:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:28:15,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:15,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:28:15,672 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:28:15,672 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:28:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:15,672 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:28:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:28:15,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:15,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:15,672 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:28:15,673 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:28:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:15,673 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:28:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:28:15,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:15,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:15,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:15,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:28:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:28:15,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-07-11 02:28:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:15,674 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:28:15,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-11 02:28:15,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:28:15,674 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-11 02:28:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:28:15,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:15,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 02:28:15,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:28:16,339 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:28:16,340 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:28:16,340 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:28:16,340 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:28:16,341 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:28:16,341 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:28:16,341 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-11 02:28:16,341 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: true [2020-07-11 02:28:16,342 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-11 02:28:16,342 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~sn~0 0) (<= 0 main_~sn~0)) [2020-07-11 02:28:16,342 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 17) the Hoare annotation is: true [2020-07-11 02:28:16,343 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 02:28:16,343 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-11 02:28:16,343 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-11 02:28:16,344 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-11 02:28:16,344 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-11 02:28:16,344 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-11 02:28:16,344 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-11 02:28:16,344 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 3 8) the Hoare annotation is: true [2020-07-11 02:28:16,345 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:28:16,345 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-11 02:28:16,345 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:28:16,345 INFO L271 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2020-07-11 02:28:16,371 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-11 02:28:16,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:28:16 BoogieIcfgContainer [2020-07-11 02:28:16,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:28:16,389 INFO L168 Benchmark]: Toolchain (without parser) took 9740.69 ms. Allocated memory was 138.9 MB in the beginning and 310.4 MB in the end (delta: 171.4 MB). Free memory was 104.7 MB in the beginning and 220.2 MB in the end (delta: -115.5 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:16,390 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-11 02:28:16,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.87 ms. Allocated memory is still 138.9 MB. Free memory was 104.3 MB in the beginning and 94.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:16,391 INFO L168 Benchmark]: Boogie Preprocessor took 121.28 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 94.7 MB in the beginning and 183.6 MB in the end (delta: -88.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:16,392 INFO L168 Benchmark]: RCFGBuilder took 292.34 ms. Allocated memory is still 203.4 MB. Free memory was 183.6 MB in the beginning and 168.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:16,392 INFO L168 Benchmark]: TraceAbstraction took 9043.15 ms. Allocated memory was 203.4 MB in the beginning and 310.4 MB in the end (delta: 107.0 MB). Free memory was 168.6 MB in the beginning and 220.2 MB in the end (delta: -51.6 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:16,399 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.87 ms. Allocated memory is still 138.9 MB. Free memory was 104.3 MB in the beginning and 94.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.28 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 94.7 MB in the beginning and 183.6 MB in the end (delta: -88.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 292.34 ms. Allocated memory is still 203.4 MB. Free memory was 183.6 MB in the beginning and 168.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9043.15 ms. Allocated memory was 203.4 MB in the beginning and 310.4 MB in the end (delta: 107.0 MB). Free memory was 168.6 MB in the beginning and 220.2 MB in the end (delta: -51.6 MB). Peak memory consumption was 55.4 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: 8.2s, OverallIterations: 11, TraceHistogramMax: 9, AutomataDifference: 4.4s, 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.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.9s 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.5s 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.1s SatisfiabilityAnalysisTime, 1.8s 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...