/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum04-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:45:57,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:45:57,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:45:57,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:45:57,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:45:57,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:45:57,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:45:57,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:45:57,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:45:57,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:45:57,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:45:57,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:45:57,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:45:57,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:45:57,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:45:57,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:45:57,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:45:57,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:45:57,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:45:57,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:45:57,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:45:57,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:45:57,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:45:57,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:45:57,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:45:57,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:45:57,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:45:57,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:45:57,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:45:57,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:45:57,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:45:57,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:45:57,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:45:57,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:45:57,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:45:57,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:45:57,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:45:57,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:45:57,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:45:57,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:45:57,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:45:57,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:45:57,354 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:45:57,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:45:57,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:45:57,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:45:57,358 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:45:57,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:45:57,359 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:45:57,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:45:57,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:45:57,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:45:57,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:45:57,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:45:57,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:45:57,360 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:45:57,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:45:57,360 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:45:57,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:45:57,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:45:57,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:45:57,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:45:57,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:45:57,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:57,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:45:57,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:45:57,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:45:57,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:45:57,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:45:57,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:45:57,365 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:45:57,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:45:57,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:45:57,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:45:57,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:45:57,672 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:45:57,672 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:45:57,673 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-1.i [2020-07-08 12:45:57,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6531214b1/4bcc346448ad4022941b515bf98b35d1/FLAG1357eb015 [2020-07-08 12:45:58,118 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:45:58,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2020-07-08 12:45:58,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6531214b1/4bcc346448ad4022941b515bf98b35d1/FLAG1357eb015 [2020-07-08 12:45:58,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6531214b1/4bcc346448ad4022941b515bf98b35d1 [2020-07-08 12:45:58,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:45:58,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:45:58,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:58,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:45:58,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:45:58,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:58" (1/1) ... [2020-07-08 12:45:58,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b184564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58, skipping insertion in model container [2020-07-08 12:45:58,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:58" (1/1) ... [2020-07-08 12:45:58,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:45:58,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:45:58,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:58,721 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:45:58,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:58,753 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:58,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58 WrapperNode [2020-07-08 12:45:58,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:58,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:58,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:58,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:58,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58" (1/1) ... [2020-07-08 12:45:58,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58" (1/1) ... [2020-07-08 12:45:58,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58" (1/1) ... [2020-07-08 12:45:58,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58" (1/1) ... [2020-07-08 12:45:58,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58" (1/1) ... [2020-07-08 12:45:58,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58" (1/1) ... [2020-07-08 12:45:58,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58" (1/1) ... [2020-07-08 12:45:58,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:58,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:58,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:58,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:58,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58" (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-08 12:45:58,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:58,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:59,214 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:59,215 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:45:59,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:59 BoogieIcfgContainer [2020-07-08 12:45:59,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:59,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:59,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:59,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:59,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:45:58" (1/3) ... [2020-07-08 12:45:59,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2315d078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:59, skipping insertion in model container [2020-07-08 12:45:59,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:58" (2/3) ... [2020-07-08 12:45:59,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2315d078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:59, skipping insertion in model container [2020-07-08 12:45:59,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:59" (3/3) ... [2020-07-08 12:45:59,227 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-1.i [2020-07-08 12:45:59,238 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:59,245 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:59,261 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:59,290 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:59,290 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:59,290 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:59,291 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:59,291 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:59,291 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:59,291 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:59,291 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-08 12:45:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:45:59,325 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:59,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:59,327 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2020-07-08 12:45:59,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:59,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366754682] [2020-07-08 12:45:59,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:59,579 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-08 12:45:59,580 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-08 12:45:59,582 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-08 12:45:59,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-08 12:45:59,583 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-08 12:45:59,583 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2020-07-08 12:45:59,583 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2020-07-08 12:45:59,585 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-08 12:45:59,585 INFO L263 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2020-07-08 12:45:59,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-08 12:45:59,586 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-08 12:45:59,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-08 12:45:59,587 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-08 12:45:59,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366754682] [2020-07-08 12:45:59,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:59,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:45:59,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471489887] [2020-07-08 12:45:59,600 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:45:59,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:59,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:45:59,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:59,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:45:59,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:45:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:45:59,644 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-08 12:45:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:59,702 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-08 12:45:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:45:59,702 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:45:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-08 12:45:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-08 12:45:59,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2020-07-08 12:45:59,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:59,815 INFO L225 Difference]: With dead ends: 30 [2020-07-08 12:45:59,815 INFO L226 Difference]: Without dead ends: 13 [2020-07-08 12:45:59,820 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-08 12:45:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-08 12:45:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-08 12:45:59,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:59,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-08 12:45:59,871 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-08 12:45:59,871 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-08 12:45:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:59,875 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-08 12:45:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-08 12:45:59,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:59,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:59,877 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-08 12:45:59,877 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-08 12:45:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:59,881 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-08 12:45:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-08 12:45:59,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:59,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:59,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:59,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:45:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-08 12:45:59,887 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-08 12:45:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:59,887 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-08 12:45:59,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:45:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-08 12:45:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:45:59,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:59,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:59,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:45:59,890 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:59,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:59,891 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2020-07-08 12:45:59,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:59,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856167799] [2020-07-08 12:45:59,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:59,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-08 12:45:59,952 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-08 12:45:59,952 INFO L263 TraceCheckUtils]: 0: Hoare triple {113#true} call ULTIMATE.init(); {113#true} is VALID [2020-07-08 12:45:59,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-08 12:45:59,953 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-08 12:45:59,953 INFO L263 TraceCheckUtils]: 3: Hoare triple {113#true} call #t~ret1 := main(); {113#true} is VALID [2020-07-08 12:45:59,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {113#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {117#(<= main_~i~0 1)} is VALID [2020-07-08 12:45:59,956 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#(<= main_~i~0 1)} assume !(~i~0 <= 8); {114#false} is VALID [2020-07-08 12:45:59,957 INFO L263 TraceCheckUtils]: 6: Hoare triple {114#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {114#false} is VALID [2020-07-08 12:45:59,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {114#false} ~cond := #in~cond; {114#false} is VALID [2020-07-08 12:45:59,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {114#false} assume 0 == ~cond; {114#false} is VALID [2020-07-08 12:45:59,958 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-08 12:45:59,959 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-08 12:45:59,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856167799] [2020-07-08 12:45:59,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:59,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:45:59,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043195103] [2020-07-08 12:45:59,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-08 12:45:59,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:59,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:45:59,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:59,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:45:59,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:59,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:45:59,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:59,985 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-08 12:46:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:00,045 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-08 12:46:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:46:00,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-08 12:46:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:46:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-07-08 12:46:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:46:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-07-08 12:46:00,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2020-07-08 12:46:00,093 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-08 12:46:00,095 INFO L225 Difference]: With dead ends: 24 [2020-07-08 12:46:00,095 INFO L226 Difference]: Without dead ends: 16 [2020-07-08 12:46:00,096 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-08 12:46:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-08 12:46:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-08 12:46:00,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:00,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2020-07-08 12:46:00,109 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2020-07-08 12:46:00,109 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2020-07-08 12:46:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:00,111 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-08 12:46:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-08 12:46:00,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:00,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:00,112 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2020-07-08 12:46:00,113 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2020-07-08 12:46:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:00,115 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-08 12:46:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-08 12:46:00,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:00,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:00,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:00,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:46:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-08 12:46:00,118 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-08 12:46:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:00,119 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-08 12:46:00,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:46:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-08 12:46:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:46:00,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:00,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:00,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:46:00,121 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2020-07-08 12:46:00,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:00,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459048183] [2020-07-08 12:46:00,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 12:46:00,178 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {210#true} {210#true} #37#return; {210#true} is VALID [2020-07-08 12:46:00,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-08 12:46:00,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 12:46:00,179 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #37#return; {210#true} is VALID [2020-07-08 12:46:00,179 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret1 := main(); {210#true} is VALID [2020-07-08 12:46:00,180 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {214#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {214#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {214#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {214#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {214#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,184 INFO L280 TraceCheckUtils]: 7: Hoare triple {214#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:00,185 INFO L280 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 2)} assume !(~i~0 <= 8); {211#false} is VALID [2020-07-08 12:46:00,186 INFO L263 TraceCheckUtils]: 9: Hoare triple {211#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {211#false} is VALID [2020-07-08 12:46:00,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2020-07-08 12:46:00,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {211#false} assume 0 == ~cond; {211#false} is VALID [2020-07-08 12:46:00,187 INFO L280 TraceCheckUtils]: 12: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-08 12:46:00,188 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-08 12:46:00,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459048183] [2020-07-08 12:46:00,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734414322] [2020-07-08 12:46:00,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,219 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:46:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:00,295 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-08 12:46:00,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 12:46:00,296 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #37#return; {210#true} is VALID [2020-07-08 12:46:00,297 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret1 := main(); {210#true} is VALID [2020-07-08 12:46:00,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {214#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,299 INFO L280 TraceCheckUtils]: 5: Hoare triple {214#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {214#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {214#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {214#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,301 INFO L280 TraceCheckUtils]: 7: Hoare triple {214#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:00,302 INFO L280 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 2)} assume !(~i~0 <= 8); {211#false} is VALID [2020-07-08 12:46:00,302 INFO L263 TraceCheckUtils]: 9: Hoare triple {211#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {211#false} is VALID [2020-07-08 12:46:00,303 INFO L280 TraceCheckUtils]: 10: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2020-07-08 12:46:00,313 INFO L280 TraceCheckUtils]: 11: Hoare triple {211#false} assume 0 == ~cond; {211#false} is VALID [2020-07-08 12:46:00,313 INFO L280 TraceCheckUtils]: 12: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-08 12:46:00,315 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-08 12:46:00,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:00,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-08 12:46:00,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128239776] [2020-07-08 12:46:00,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-08 12:46:00,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:00,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:46:00,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:00,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:46:00,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:00,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:46:00,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:46:00,335 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2020-07-08 12:46:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:00,413 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-08 12:46:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:46:00,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-08 12:46:00,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-08 12:46:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-08 12:46:00,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2020-07-08 12:46:00,458 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-08 12:46:00,459 INFO L225 Difference]: With dead ends: 27 [2020-07-08 12:46:00,460 INFO L226 Difference]: Without dead ends: 19 [2020-07-08 12:46:00,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:46:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-08 12:46:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-08 12:46:00,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:00,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 18 states. [2020-07-08 12:46:00,470 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 18 states. [2020-07-08 12:46:00,470 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 18 states. [2020-07-08 12:46:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:00,472 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-08 12:46:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-08 12:46:00,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:00,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:00,474 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states. [2020-07-08 12:46:00,474 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states. [2020-07-08 12:46:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:00,476 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-08 12:46:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-08 12:46:00,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:00,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:00,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:00,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:46:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-08 12:46:00,479 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-08 12:46:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:00,479 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-08 12:46:00,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:46:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 12:46:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 12:46:00,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:00,480 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:00,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:46:00,698 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:00,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1717165257, now seen corresponding path program 2 times [2020-07-08 12:46:00,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:00,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101710477] [2020-07-08 12:46:00,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-08 12:46:00,769 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {358#true} {358#true} #37#return; {358#true} is VALID [2020-07-08 12:46:00,769 INFO L263 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2020-07-08 12:46:00,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-08 12:46:00,770 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #37#return; {358#true} is VALID [2020-07-08 12:46:00,770 INFO L263 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret1 := main(); {358#true} is VALID [2020-07-08 12:46:00,771 INFO L280 TraceCheckUtils]: 4: Hoare triple {358#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {362#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {362#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,773 INFO L280 TraceCheckUtils]: 6: Hoare triple {362#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {362#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,774 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {363#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:00,775 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {363#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:00,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {363#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {363#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:00,777 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {364#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:00,778 INFO L280 TraceCheckUtils]: 11: Hoare triple {364#(<= main_~i~0 3)} assume !(~i~0 <= 8); {359#false} is VALID [2020-07-08 12:46:00,778 INFO L263 TraceCheckUtils]: 12: Hoare triple {359#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {359#false} is VALID [2020-07-08 12:46:00,779 INFO L280 TraceCheckUtils]: 13: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2020-07-08 12:46:00,779 INFO L280 TraceCheckUtils]: 14: Hoare triple {359#false} assume 0 == ~cond; {359#false} is VALID [2020-07-08 12:46:00,779 INFO L280 TraceCheckUtils]: 15: Hoare triple {359#false} assume !false; {359#false} is VALID [2020-07-08 12:46:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:00,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101710477] [2020-07-08 12:46:00,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004830811] [2020-07-08 12:46:00,781 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-08 12:46:00,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:46:00,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:00,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:00,867 INFO L263 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2020-07-08 12:46:00,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-08 12:46:00,868 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #37#return; {358#true} is VALID [2020-07-08 12:46:00,868 INFO L263 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret1 := main(); {358#true} is VALID [2020-07-08 12:46:00,870 INFO L280 TraceCheckUtils]: 4: Hoare triple {358#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {362#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {362#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {362#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {362#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:00,873 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {363#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:00,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {363#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:00,874 INFO L280 TraceCheckUtils]: 9: Hoare triple {363#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {363#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:00,875 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {364#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:00,877 INFO L280 TraceCheckUtils]: 11: Hoare triple {364#(<= main_~i~0 3)} assume !(~i~0 <= 8); {359#false} is VALID [2020-07-08 12:46:00,877 INFO L263 TraceCheckUtils]: 12: Hoare triple {359#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {359#false} is VALID [2020-07-08 12:46:00,877 INFO L280 TraceCheckUtils]: 13: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2020-07-08 12:46:00,878 INFO L280 TraceCheckUtils]: 14: Hoare triple {359#false} assume 0 == ~cond; {359#false} is VALID [2020-07-08 12:46:00,878 INFO L280 TraceCheckUtils]: 15: Hoare triple {359#false} assume !false; {359#false} is VALID [2020-07-08 12:46:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:00,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:00,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-08 12:46:00,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675379574] [2020-07-08 12:46:00,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 12:46:00,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:00,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:00,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:00,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:00,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:00,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:00,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:00,903 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2020-07-08 12:46:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:00,985 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-08 12:46:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:46:00,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 12:46:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-08 12:46:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-08 12:46:00,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-08 12:46:01,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:01,030 INFO L225 Difference]: With dead ends: 30 [2020-07-08 12:46:01,031 INFO L226 Difference]: Without dead ends: 22 [2020-07-08 12:46:01,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-08 12:46:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-08 12:46:01,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:01,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-08 12:46:01,042 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-08 12:46:01,042 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-08 12:46:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,044 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:46:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:46:01,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:01,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:01,045 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-08 12:46:01,045 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-08 12:46:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,047 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:46:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:46:01,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:01,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:01,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:01,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:46:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-08 12:46:01,051 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2020-07-08 12:46:01,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:01,051 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-08 12:46:01,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-08 12:46:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:46:01,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:01,052 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:01,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:01,268 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash -424886253, now seen corresponding path program 3 times [2020-07-08 12:46:01,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:01,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323857931] [2020-07-08 12:46:01,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:01,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-08 12:46:01,358 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {530#true} {530#true} #37#return; {530#true} is VALID [2020-07-08 12:46:01,358 INFO L263 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2020-07-08 12:46:01,359 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-08 12:46:01,359 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #37#return; {530#true} is VALID [2020-07-08 12:46:01,359 INFO L263 TraceCheckUtils]: 3: Hoare triple {530#true} call #t~ret1 := main(); {530#true} is VALID [2020-07-08 12:46:01,359 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {530#true} is VALID [2020-07-08 12:46:01,360 INFO L280 TraceCheckUtils]: 5: Hoare triple {530#true} assume !!(~i~0 <= 8); {530#true} is VALID [2020-07-08 12:46:01,360 INFO L280 TraceCheckUtils]: 6: Hoare triple {530#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {530#true} is VALID [2020-07-08 12:46:01,360 INFO L280 TraceCheckUtils]: 7: Hoare triple {530#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {530#true} is VALID [2020-07-08 12:46:01,360 INFO L280 TraceCheckUtils]: 8: Hoare triple {530#true} assume !!(~i~0 <= 8); {530#true} is VALID [2020-07-08 12:46:01,361 INFO L280 TraceCheckUtils]: 9: Hoare triple {530#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {530#true} is VALID [2020-07-08 12:46:01,361 INFO L280 TraceCheckUtils]: 10: Hoare triple {530#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {530#true} is VALID [2020-07-08 12:46:01,361 INFO L280 TraceCheckUtils]: 11: Hoare triple {530#true} assume !!(~i~0 <= 8); {530#true} is VALID [2020-07-08 12:46:01,362 INFO L280 TraceCheckUtils]: 12: Hoare triple {530#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {534#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:01,363 INFO L280 TraceCheckUtils]: 13: Hoare triple {534#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {535#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:01,364 INFO L280 TraceCheckUtils]: 14: Hoare triple {535#(<= main_~i~0 4)} assume !(~i~0 <= 8); {531#false} is VALID [2020-07-08 12:46:01,364 INFO L263 TraceCheckUtils]: 15: Hoare triple {531#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {531#false} is VALID [2020-07-08 12:46:01,365 INFO L280 TraceCheckUtils]: 16: Hoare triple {531#false} ~cond := #in~cond; {531#false} is VALID [2020-07-08 12:46:01,365 INFO L280 TraceCheckUtils]: 17: Hoare triple {531#false} assume 0 == ~cond; {531#false} is VALID [2020-07-08 12:46:01,365 INFO L280 TraceCheckUtils]: 18: Hoare triple {531#false} assume !false; {531#false} is VALID [2020-07-08 12:46:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:46:01,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323857931] [2020-07-08 12:46:01,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:01,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:46:01,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184468717] [2020-07-08 12:46:01,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-08 12:46:01,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:01,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:46:01,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:01,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:46:01,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:01,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:46:01,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:46:01,389 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2020-07-08 12:46:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,458 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-08 12:46:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:46:01,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-08 12:46:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-07-08 12:46:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-07-08 12:46:01,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2020-07-08 12:46:01,499 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-08 12:46:01,500 INFO L225 Difference]: With dead ends: 30 [2020-07-08 12:46:01,501 INFO L226 Difference]: Without dead ends: 25 [2020-07-08 12:46:01,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:46:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-08 12:46:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-08 12:46:01,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:01,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 23 states. [2020-07-08 12:46:01,516 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 23 states. [2020-07-08 12:46:01,516 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 23 states. [2020-07-08 12:46:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,518 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:46:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:46:01,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:01,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:01,519 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states. [2020-07-08 12:46:01,519 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states. [2020-07-08 12:46:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,522 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:46:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:46:01,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:01,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:01,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:01,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:46:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-08 12:46:01,526 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2020-07-08 12:46:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:01,526 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-08 12:46:01,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:46:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 12:46:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:46:01,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:01,527 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:01,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:46:01,528 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash -452912071, now seen corresponding path program 1 times [2020-07-08 12:46:01,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:01,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10799565] [2020-07-08 12:46:01,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:01,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-08 12:46:01,600 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {665#true} {665#true} #37#return; {665#true} is VALID [2020-07-08 12:46:01,601 INFO L263 TraceCheckUtils]: 0: Hoare triple {665#true} call ULTIMATE.init(); {665#true} is VALID [2020-07-08 12:46:01,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-08 12:46:01,601 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {665#true} {665#true} #37#return; {665#true} is VALID [2020-07-08 12:46:01,602 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#true} call #t~ret1 := main(); {665#true} is VALID [2020-07-08 12:46:01,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {665#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {665#true} is VALID [2020-07-08 12:46:01,602 INFO L280 TraceCheckUtils]: 5: Hoare triple {665#true} assume !!(~i~0 <= 8); {665#true} is VALID [2020-07-08 12:46:01,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {665#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {665#true} is VALID [2020-07-08 12:46:01,603 INFO L280 TraceCheckUtils]: 7: Hoare triple {665#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {665#true} is VALID [2020-07-08 12:46:01,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {665#true} assume !!(~i~0 <= 8); {665#true} is VALID [2020-07-08 12:46:01,604 INFO L280 TraceCheckUtils]: 9: Hoare triple {665#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {665#true} is VALID [2020-07-08 12:46:01,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {665#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {665#true} is VALID [2020-07-08 12:46:01,605 INFO L280 TraceCheckUtils]: 11: Hoare triple {665#true} assume !!(~i~0 <= 8); {665#true} is VALID [2020-07-08 12:46:01,606 INFO L280 TraceCheckUtils]: 12: Hoare triple {665#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {669#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:01,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {669#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {670#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:01,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {670#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {670#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:01,609 INFO L280 TraceCheckUtils]: 15: Hoare triple {670#(<= main_~i~0 4)} assume !(~i~0 < 4); {670#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:01,610 INFO L280 TraceCheckUtils]: 16: Hoare triple {670#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {671#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:01,611 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= main_~i~0 5)} assume !(~i~0 <= 8); {666#false} is VALID [2020-07-08 12:46:01,611 INFO L263 TraceCheckUtils]: 18: Hoare triple {666#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {666#false} is VALID [2020-07-08 12:46:01,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#false} ~cond := #in~cond; {666#false} is VALID [2020-07-08 12:46:01,612 INFO L280 TraceCheckUtils]: 20: Hoare triple {666#false} assume 0 == ~cond; {666#false} is VALID [2020-07-08 12:46:01,612 INFO L280 TraceCheckUtils]: 21: Hoare triple {666#false} assume !false; {666#false} is VALID [2020-07-08 12:46:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:46:01,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10799565] [2020-07-08 12:46:01,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778627872] [2020-07-08 12:46:01,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-08 12:46:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:01,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:01,657 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:01,749 INFO L263 TraceCheckUtils]: 0: Hoare triple {665#true} call ULTIMATE.init(); {665#true} is VALID [2020-07-08 12:46:01,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-08 12:46:01,750 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {665#true} {665#true} #37#return; {665#true} is VALID [2020-07-08 12:46:01,750 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#true} call #t~ret1 := main(); {665#true} is VALID [2020-07-08 12:46:01,751 INFO L280 TraceCheckUtils]: 4: Hoare triple {665#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {687#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:01,751 INFO L280 TraceCheckUtils]: 5: Hoare triple {687#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {687#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:01,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {687#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {687#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:01,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {687#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {697#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:01,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {697#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {697#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:01,755 INFO L280 TraceCheckUtils]: 9: Hoare triple {697#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {697#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:01,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {697#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {669#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:01,757 INFO L280 TraceCheckUtils]: 11: Hoare triple {669#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {669#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:01,758 INFO L280 TraceCheckUtils]: 12: Hoare triple {669#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {669#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:01,759 INFO L280 TraceCheckUtils]: 13: Hoare triple {669#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {670#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:01,759 INFO L280 TraceCheckUtils]: 14: Hoare triple {670#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {670#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:01,760 INFO L280 TraceCheckUtils]: 15: Hoare triple {670#(<= main_~i~0 4)} assume !(~i~0 < 4); {670#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:01,761 INFO L280 TraceCheckUtils]: 16: Hoare triple {670#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {671#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:01,762 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= main_~i~0 5)} assume !(~i~0 <= 8); {666#false} is VALID [2020-07-08 12:46:01,762 INFO L263 TraceCheckUtils]: 18: Hoare triple {666#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {666#false} is VALID [2020-07-08 12:46:01,762 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#false} ~cond := #in~cond; {666#false} is VALID [2020-07-08 12:46:01,763 INFO L280 TraceCheckUtils]: 20: Hoare triple {666#false} assume 0 == ~cond; {666#false} is VALID [2020-07-08 12:46:01,763 INFO L280 TraceCheckUtils]: 21: Hoare triple {666#false} assume !false; {666#false} is VALID [2020-07-08 12:46:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:01,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:01,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 7 [2020-07-08 12:46:01,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344654708] [2020-07-08 12:46:01,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-08 12:46:01,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:01,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:46:01,797 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-08 12:46:01,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:46:01,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:01,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:46:01,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:01,798 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2020-07-08 12:46:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,901 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-08 12:46:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:01,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-08 12:46:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-08 12:46:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-08 12:46:01,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2020-07-08 12:46:01,947 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-08 12:46:01,948 INFO L225 Difference]: With dead ends: 33 [2020-07-08 12:46:01,949 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 12:46:01,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 12:46:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-08 12:46:01,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:01,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-08 12:46:01,963 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-08 12:46:01,963 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-08 12:46:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,965 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-08 12:46:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-08 12:46:01,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:01,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:01,966 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-08 12:46:01,966 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-08 12:46:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,969 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-08 12:46:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-08 12:46:01,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:01,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:01,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:01,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 12:46:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-07-08 12:46:01,972 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2020-07-08 12:46:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:01,973 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-08 12:46:01,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:46:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-08 12:46:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:46:01,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:01,974 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:02,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:02,189 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:02,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2146400685, now seen corresponding path program 2 times [2020-07-08 12:46:02,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:02,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539474150] [2020-07-08 12:46:02,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:02,264 INFO L280 TraceCheckUtils]: 0: Hoare triple {880#true} assume true; {880#true} is VALID [2020-07-08 12:46:02,264 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {880#true} {880#true} #37#return; {880#true} is VALID [2020-07-08 12:46:02,265 INFO L263 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2020-07-08 12:46:02,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2020-07-08 12:46:02,266 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #37#return; {880#true} is VALID [2020-07-08 12:46:02,266 INFO L263 TraceCheckUtils]: 3: Hoare triple {880#true} call #t~ret1 := main(); {880#true} is VALID [2020-07-08 12:46:02,266 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {880#true} is VALID [2020-07-08 12:46:02,267 INFO L280 TraceCheckUtils]: 5: Hoare triple {880#true} assume !!(~i~0 <= 8); {880#true} is VALID [2020-07-08 12:46:02,267 INFO L280 TraceCheckUtils]: 6: Hoare triple {880#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {880#true} is VALID [2020-07-08 12:46:02,267 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {880#true} is VALID [2020-07-08 12:46:02,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {880#true} assume !!(~i~0 <= 8); {880#true} is VALID [2020-07-08 12:46:02,268 INFO L280 TraceCheckUtils]: 9: Hoare triple {880#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {880#true} is VALID [2020-07-08 12:46:02,268 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {880#true} is VALID [2020-07-08 12:46:02,268 INFO L280 TraceCheckUtils]: 11: Hoare triple {880#true} assume !!(~i~0 <= 8); {880#true} is VALID [2020-07-08 12:46:02,270 INFO L280 TraceCheckUtils]: 12: Hoare triple {880#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {884#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:02,271 INFO L280 TraceCheckUtils]: 13: Hoare triple {884#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {885#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:02,272 INFO L280 TraceCheckUtils]: 14: Hoare triple {885#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {885#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:02,272 INFO L280 TraceCheckUtils]: 15: Hoare triple {885#(<= main_~i~0 4)} assume !(~i~0 < 4); {885#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:02,273 INFO L280 TraceCheckUtils]: 16: Hoare triple {885#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {886#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:02,274 INFO L280 TraceCheckUtils]: 17: Hoare triple {886#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {886#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:02,274 INFO L280 TraceCheckUtils]: 18: Hoare triple {886#(<= main_~i~0 5)} assume !(~i~0 < 4); {886#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:02,275 INFO L280 TraceCheckUtils]: 19: Hoare triple {886#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {887#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:02,276 INFO L280 TraceCheckUtils]: 20: Hoare triple {887#(<= main_~i~0 6)} assume !(~i~0 <= 8); {881#false} is VALID [2020-07-08 12:46:02,276 INFO L263 TraceCheckUtils]: 21: Hoare triple {881#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {881#false} is VALID [2020-07-08 12:46:02,277 INFO L280 TraceCheckUtils]: 22: Hoare triple {881#false} ~cond := #in~cond; {881#false} is VALID [2020-07-08 12:46:02,277 INFO L280 TraceCheckUtils]: 23: Hoare triple {881#false} assume 0 == ~cond; {881#false} is VALID [2020-07-08 12:46:02,277 INFO L280 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2020-07-08 12:46:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:46:02,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539474150] [2020-07-08 12:46:02,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377522397] [2020-07-08 12:46:02,279 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-08 12:46:02,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:46:02,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:02,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:02,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:02,400 INFO L263 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2020-07-08 12:46:02,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2020-07-08 12:46:02,401 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #37#return; {880#true} is VALID [2020-07-08 12:46:02,401 INFO L263 TraceCheckUtils]: 3: Hoare triple {880#true} call #t~ret1 := main(); {880#true} is VALID [2020-07-08 12:46:02,402 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {903#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:02,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {903#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {903#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:02,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {903#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {903#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:02,404 INFO L280 TraceCheckUtils]: 7: Hoare triple {903#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {913#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:02,405 INFO L280 TraceCheckUtils]: 8: Hoare triple {913#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {913#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:02,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {913#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {913#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:02,406 INFO L280 TraceCheckUtils]: 10: Hoare triple {913#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {884#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:02,407 INFO L280 TraceCheckUtils]: 11: Hoare triple {884#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {884#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:02,408 INFO L280 TraceCheckUtils]: 12: Hoare triple {884#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {884#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:02,409 INFO L280 TraceCheckUtils]: 13: Hoare triple {884#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {885#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:02,409 INFO L280 TraceCheckUtils]: 14: Hoare triple {885#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {885#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:02,410 INFO L280 TraceCheckUtils]: 15: Hoare triple {885#(<= main_~i~0 4)} assume !(~i~0 < 4); {885#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:02,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {885#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {886#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:02,411 INFO L280 TraceCheckUtils]: 17: Hoare triple {886#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {886#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:02,412 INFO L280 TraceCheckUtils]: 18: Hoare triple {886#(<= main_~i~0 5)} assume !(~i~0 < 4); {886#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:02,413 INFO L280 TraceCheckUtils]: 19: Hoare triple {886#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {887#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:02,414 INFO L280 TraceCheckUtils]: 20: Hoare triple {887#(<= main_~i~0 6)} assume !(~i~0 <= 8); {881#false} is VALID [2020-07-08 12:46:02,414 INFO L263 TraceCheckUtils]: 21: Hoare triple {881#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {881#false} is VALID [2020-07-08 12:46:02,414 INFO L280 TraceCheckUtils]: 22: Hoare triple {881#false} ~cond := #in~cond; {881#false} is VALID [2020-07-08 12:46:02,414 INFO L280 TraceCheckUtils]: 23: Hoare triple {881#false} assume 0 == ~cond; {881#false} is VALID [2020-07-08 12:46:02,415 INFO L280 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2020-07-08 12:46:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:02,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:02,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2020-07-08 12:46:02,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062347216] [2020-07-08 12:46:02,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-08 12:46:02,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:02,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:46:02,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:02,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:46:02,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:02,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:46:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:46:02,458 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2020-07-08 12:46:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:02,568 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-08 12:46:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:46:02,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-08 12:46:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:46:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-08 12:46:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:46:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-08 12:46:02,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-08 12:46:02,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:02,615 INFO L225 Difference]: With dead ends: 36 [2020-07-08 12:46:02,615 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 12:46:02,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:46:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 12:46:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-08 12:46:02,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:02,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2020-07-08 12:46:02,628 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2020-07-08 12:46:02,628 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2020-07-08 12:46:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:02,630 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-08 12:46:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-08 12:46:02,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:02,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:02,631 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2020-07-08 12:46:02,631 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2020-07-08 12:46:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:02,633 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-08 12:46:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-08 12:46:02,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:02,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:02,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:02,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 12:46:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-08 12:46:02,636 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2020-07-08 12:46:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:02,636 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-08 12:46:02,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:46:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-08 12:46:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:46:02,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:02,638 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:02,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:02,853 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash 115125753, now seen corresponding path program 3 times [2020-07-08 12:46:02,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:02,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410861871] [2020-07-08 12:46:02,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:02,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {1119#true} assume true; {1119#true} is VALID [2020-07-08 12:46:02,929 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1119#true} {1119#true} #37#return; {1119#true} is VALID [2020-07-08 12:46:02,929 INFO L263 TraceCheckUtils]: 0: Hoare triple {1119#true} call ULTIMATE.init(); {1119#true} is VALID [2020-07-08 12:46:02,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {1119#true} assume true; {1119#true} is VALID [2020-07-08 12:46:02,935 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1119#true} {1119#true} #37#return; {1119#true} is VALID [2020-07-08 12:46:02,935 INFO L263 TraceCheckUtils]: 3: Hoare triple {1119#true} call #t~ret1 := main(); {1119#true} is VALID [2020-07-08 12:46:02,936 INFO L280 TraceCheckUtils]: 4: Hoare triple {1119#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1119#true} is VALID [2020-07-08 12:46:02,936 INFO L280 TraceCheckUtils]: 5: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-08 12:46:02,936 INFO L280 TraceCheckUtils]: 6: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-08 12:46:02,936 INFO L280 TraceCheckUtils]: 7: Hoare triple {1119#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1119#true} is VALID [2020-07-08 12:46:02,936 INFO L280 TraceCheckUtils]: 8: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-08 12:46:02,937 INFO L280 TraceCheckUtils]: 9: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-08 12:46:02,937 INFO L280 TraceCheckUtils]: 10: Hoare triple {1119#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1119#true} is VALID [2020-07-08 12:46:02,937 INFO L280 TraceCheckUtils]: 11: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-08 12:46:02,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1123#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:02,940 INFO L280 TraceCheckUtils]: 13: Hoare triple {1123#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1124#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:02,941 INFO L280 TraceCheckUtils]: 14: Hoare triple {1124#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1124#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:02,942 INFO L280 TraceCheckUtils]: 15: Hoare triple {1124#(<= main_~i~0 4)} assume !(~i~0 < 4); {1124#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:02,942 INFO L280 TraceCheckUtils]: 16: Hoare triple {1124#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1125#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:02,943 INFO L280 TraceCheckUtils]: 17: Hoare triple {1125#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1125#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:02,943 INFO L280 TraceCheckUtils]: 18: Hoare triple {1125#(<= main_~i~0 5)} assume !(~i~0 < 4); {1125#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:02,944 INFO L280 TraceCheckUtils]: 19: Hoare triple {1125#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1126#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:02,944 INFO L280 TraceCheckUtils]: 20: Hoare triple {1126#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1126#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:02,945 INFO L280 TraceCheckUtils]: 21: Hoare triple {1126#(<= main_~i~0 6)} assume !(~i~0 < 4); {1126#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:02,945 INFO L280 TraceCheckUtils]: 22: Hoare triple {1126#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1127#(<= main_~i~0 7)} is VALID [2020-07-08 12:46:02,946 INFO L280 TraceCheckUtils]: 23: Hoare triple {1127#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1120#false} is VALID [2020-07-08 12:46:02,946 INFO L263 TraceCheckUtils]: 24: Hoare triple {1120#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1120#false} is VALID [2020-07-08 12:46:02,946 INFO L280 TraceCheckUtils]: 25: Hoare triple {1120#false} ~cond := #in~cond; {1120#false} is VALID [2020-07-08 12:46:02,947 INFO L280 TraceCheckUtils]: 26: Hoare triple {1120#false} assume 0 == ~cond; {1120#false} is VALID [2020-07-08 12:46:02,947 INFO L280 TraceCheckUtils]: 27: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2020-07-08 12:46:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:46:02,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410861871] [2020-07-08 12:46:02,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584518466] [2020-07-08 12:46:02,949 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-08 12:46:02,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-08 12:46:02,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:02,975 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:02,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:03,069 INFO L263 TraceCheckUtils]: 0: Hoare triple {1119#true} call ULTIMATE.init(); {1119#true} is VALID [2020-07-08 12:46:03,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {1119#true} assume true; {1119#true} is VALID [2020-07-08 12:46:03,069 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1119#true} {1119#true} #37#return; {1119#true} is VALID [2020-07-08 12:46:03,070 INFO L263 TraceCheckUtils]: 3: Hoare triple {1119#true} call #t~ret1 := main(); {1119#true} is VALID [2020-07-08 12:46:03,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {1119#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1119#true} is VALID [2020-07-08 12:46:03,070 INFO L280 TraceCheckUtils]: 5: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-08 12:46:03,070 INFO L280 TraceCheckUtils]: 6: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-08 12:46:03,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {1119#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1119#true} is VALID [2020-07-08 12:46:03,071 INFO L280 TraceCheckUtils]: 8: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-08 12:46:03,071 INFO L280 TraceCheckUtils]: 9: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-08 12:46:03,071 INFO L280 TraceCheckUtils]: 10: Hoare triple {1119#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1119#true} is VALID [2020-07-08 12:46:03,072 INFO L280 TraceCheckUtils]: 11: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-08 12:46:03,073 INFO L280 TraceCheckUtils]: 12: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1123#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:03,073 INFO L280 TraceCheckUtils]: 13: Hoare triple {1123#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1124#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:03,074 INFO L280 TraceCheckUtils]: 14: Hoare triple {1124#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1124#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:03,075 INFO L280 TraceCheckUtils]: 15: Hoare triple {1124#(<= main_~i~0 4)} assume !(~i~0 < 4); {1124#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:03,076 INFO L280 TraceCheckUtils]: 16: Hoare triple {1124#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1125#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:03,076 INFO L280 TraceCheckUtils]: 17: Hoare triple {1125#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1125#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:03,077 INFO L280 TraceCheckUtils]: 18: Hoare triple {1125#(<= main_~i~0 5)} assume !(~i~0 < 4); {1125#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:03,078 INFO L280 TraceCheckUtils]: 19: Hoare triple {1125#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1126#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:03,079 INFO L280 TraceCheckUtils]: 20: Hoare triple {1126#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1126#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:03,079 INFO L280 TraceCheckUtils]: 21: Hoare triple {1126#(<= main_~i~0 6)} assume !(~i~0 < 4); {1126#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:03,080 INFO L280 TraceCheckUtils]: 22: Hoare triple {1126#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1127#(<= main_~i~0 7)} is VALID [2020-07-08 12:46:03,081 INFO L280 TraceCheckUtils]: 23: Hoare triple {1127#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1120#false} is VALID [2020-07-08 12:46:03,081 INFO L263 TraceCheckUtils]: 24: Hoare triple {1120#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1120#false} is VALID [2020-07-08 12:46:03,081 INFO L280 TraceCheckUtils]: 25: Hoare triple {1120#false} ~cond := #in~cond; {1120#false} is VALID [2020-07-08 12:46:03,082 INFO L280 TraceCheckUtils]: 26: Hoare triple {1120#false} assume 0 == ~cond; {1120#false} is VALID [2020-07-08 12:46:03,082 INFO L280 TraceCheckUtils]: 27: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2020-07-08 12:46:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:46:03,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:03,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-08 12:46:03,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395034630] [2020-07-08 12:46:03,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-08 12:46:03,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:03,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:46:03,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:03,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:46:03,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:46:03,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:03,110 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2020-07-08 12:46:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:03,243 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-08 12:46:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:03,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-08 12:46:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-08 12:46:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-08 12:46:03,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2020-07-08 12:46:03,293 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-08 12:46:03,294 INFO L225 Difference]: With dead ends: 39 [2020-07-08 12:46:03,294 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 12:46:03,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 12:46:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-08 12:46:03,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:03,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-08 12:46:03,315 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-08 12:46:03,315 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-08 12:46:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:03,319 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-08 12:46:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-08 12:46:03,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:03,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:03,320 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-08 12:46:03,320 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-08 12:46:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:03,322 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-08 12:46:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-08 12:46:03,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:03,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:03,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:03,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:46:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-08 12:46:03,325 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 28 [2020-07-08 12:46:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:03,325 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-08 12:46:03,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:46:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 12:46:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:46:03,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:03,327 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:03,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:03,540 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1902732141, now seen corresponding path program 4 times [2020-07-08 12:46:03,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:03,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024419792] [2020-07-08 12:46:03,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:03,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-08 12:46:03,627 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1380#true} {1380#true} #37#return; {1380#true} is VALID [2020-07-08 12:46:03,628 INFO L263 TraceCheckUtils]: 0: Hoare triple {1380#true} call ULTIMATE.init(); {1380#true} is VALID [2020-07-08 12:46:03,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-08 12:46:03,628 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1380#true} {1380#true} #37#return; {1380#true} is VALID [2020-07-08 12:46:03,628 INFO L263 TraceCheckUtils]: 3: Hoare triple {1380#true} call #t~ret1 := main(); {1380#true} is VALID [2020-07-08 12:46:03,628 INFO L280 TraceCheckUtils]: 4: Hoare triple {1380#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1380#true} is VALID [2020-07-08 12:46:03,629 INFO L280 TraceCheckUtils]: 5: Hoare triple {1380#true} assume !!(~i~0 <= 8); {1380#true} is VALID [2020-07-08 12:46:03,629 INFO L280 TraceCheckUtils]: 6: Hoare triple {1380#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1380#true} is VALID [2020-07-08 12:46:03,629 INFO L280 TraceCheckUtils]: 7: Hoare triple {1380#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1380#true} is VALID [2020-07-08 12:46:03,629 INFO L280 TraceCheckUtils]: 8: Hoare triple {1380#true} assume !!(~i~0 <= 8); {1380#true} is VALID [2020-07-08 12:46:03,629 INFO L280 TraceCheckUtils]: 9: Hoare triple {1380#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1380#true} is VALID [2020-07-08 12:46:03,630 INFO L280 TraceCheckUtils]: 10: Hoare triple {1380#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1380#true} is VALID [2020-07-08 12:46:03,630 INFO L280 TraceCheckUtils]: 11: Hoare triple {1380#true} assume !!(~i~0 <= 8); {1380#true} is VALID [2020-07-08 12:46:03,630 INFO L280 TraceCheckUtils]: 12: Hoare triple {1380#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1384#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:03,631 INFO L280 TraceCheckUtils]: 13: Hoare triple {1384#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1385#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:03,631 INFO L280 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1385#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:03,632 INFO L280 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !(~i~0 < 4); {1385#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:03,635 INFO L280 TraceCheckUtils]: 16: Hoare triple {1385#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1386#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:03,635 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1386#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:03,636 INFO L280 TraceCheckUtils]: 18: Hoare triple {1386#(<= main_~i~0 5)} assume !(~i~0 < 4); {1386#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:03,637 INFO L280 TraceCheckUtils]: 19: Hoare triple {1386#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1387#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:03,637 INFO L280 TraceCheckUtils]: 20: Hoare triple {1387#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1387#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:03,638 INFO L280 TraceCheckUtils]: 21: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 4); {1387#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:03,638 INFO L280 TraceCheckUtils]: 22: Hoare triple {1387#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1388#(<= main_~i~0 7)} is VALID [2020-07-08 12:46:03,638 INFO L280 TraceCheckUtils]: 23: Hoare triple {1388#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1388#(<= main_~i~0 7)} is VALID [2020-07-08 12:46:03,639 INFO L280 TraceCheckUtils]: 24: Hoare triple {1388#(<= main_~i~0 7)} assume !(~i~0 < 4); {1388#(<= main_~i~0 7)} is VALID [2020-07-08 12:46:03,640 INFO L280 TraceCheckUtils]: 25: Hoare triple {1388#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1389#(<= main_~i~0 8)} is VALID [2020-07-08 12:46:03,640 INFO L280 TraceCheckUtils]: 26: Hoare triple {1389#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1381#false} is VALID [2020-07-08 12:46:03,641 INFO L263 TraceCheckUtils]: 27: Hoare triple {1381#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1381#false} is VALID [2020-07-08 12:46:03,641 INFO L280 TraceCheckUtils]: 28: Hoare triple {1381#false} ~cond := #in~cond; {1381#false} is VALID [2020-07-08 12:46:03,641 INFO L280 TraceCheckUtils]: 29: Hoare triple {1381#false} assume 0 == ~cond; {1381#false} is VALID [2020-07-08 12:46:03,641 INFO L280 TraceCheckUtils]: 30: Hoare triple {1381#false} assume !false; {1381#false} is VALID [2020-07-08 12:46:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:46:03,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024419792] [2020-07-08 12:46:03,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559203457] [2020-07-08 12:46:03,644 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-08 12:46:03,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-08 12:46:03,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:03,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:03,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:03,794 INFO L263 TraceCheckUtils]: 0: Hoare triple {1380#true} call ULTIMATE.init(); {1380#true} is VALID [2020-07-08 12:46:03,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-08 12:46:03,795 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1380#true} {1380#true} #37#return; {1380#true} is VALID [2020-07-08 12:46:03,795 INFO L263 TraceCheckUtils]: 3: Hoare triple {1380#true} call #t~ret1 := main(); {1380#true} is VALID [2020-07-08 12:46:03,796 INFO L280 TraceCheckUtils]: 4: Hoare triple {1380#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1405#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:03,797 INFO L280 TraceCheckUtils]: 5: Hoare triple {1405#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1405#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:03,797 INFO L280 TraceCheckUtils]: 6: Hoare triple {1405#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1405#(<= main_~i~0 1)} is VALID [2020-07-08 12:46:03,798 INFO L280 TraceCheckUtils]: 7: Hoare triple {1405#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1415#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:03,799 INFO L280 TraceCheckUtils]: 8: Hoare triple {1415#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1415#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:03,799 INFO L280 TraceCheckUtils]: 9: Hoare triple {1415#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1415#(<= main_~i~0 2)} is VALID [2020-07-08 12:46:03,800 INFO L280 TraceCheckUtils]: 10: Hoare triple {1415#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1384#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:03,801 INFO L280 TraceCheckUtils]: 11: Hoare triple {1384#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1384#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:03,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {1384#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1384#(<= main_~i~0 3)} is VALID [2020-07-08 12:46:03,803 INFO L280 TraceCheckUtils]: 13: Hoare triple {1384#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1385#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:03,804 INFO L280 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1385#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:03,804 INFO L280 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !(~i~0 < 4); {1385#(<= main_~i~0 4)} is VALID [2020-07-08 12:46:03,805 INFO L280 TraceCheckUtils]: 16: Hoare triple {1385#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1386#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:03,806 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1386#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:03,806 INFO L280 TraceCheckUtils]: 18: Hoare triple {1386#(<= main_~i~0 5)} assume !(~i~0 < 4); {1386#(<= main_~i~0 5)} is VALID [2020-07-08 12:46:03,807 INFO L280 TraceCheckUtils]: 19: Hoare triple {1386#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1387#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:03,808 INFO L280 TraceCheckUtils]: 20: Hoare triple {1387#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1387#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:03,808 INFO L280 TraceCheckUtils]: 21: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 4); {1387#(<= main_~i~0 6)} is VALID [2020-07-08 12:46:03,809 INFO L280 TraceCheckUtils]: 22: Hoare triple {1387#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1388#(<= main_~i~0 7)} is VALID [2020-07-08 12:46:03,810 INFO L280 TraceCheckUtils]: 23: Hoare triple {1388#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1388#(<= main_~i~0 7)} is VALID [2020-07-08 12:46:03,810 INFO L280 TraceCheckUtils]: 24: Hoare triple {1388#(<= main_~i~0 7)} assume !(~i~0 < 4); {1388#(<= main_~i~0 7)} is VALID [2020-07-08 12:46:03,811 INFO L280 TraceCheckUtils]: 25: Hoare triple {1388#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1389#(<= main_~i~0 8)} is VALID [2020-07-08 12:46:03,812 INFO L280 TraceCheckUtils]: 26: Hoare triple {1389#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1381#false} is VALID [2020-07-08 12:46:03,812 INFO L263 TraceCheckUtils]: 27: Hoare triple {1381#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1381#false} is VALID [2020-07-08 12:46:03,812 INFO L280 TraceCheckUtils]: 28: Hoare triple {1381#false} ~cond := #in~cond; {1381#false} is VALID [2020-07-08 12:46:03,812 INFO L280 TraceCheckUtils]: 29: Hoare triple {1381#false} assume 0 == ~cond; {1381#false} is VALID [2020-07-08 12:46:03,812 INFO L280 TraceCheckUtils]: 30: Hoare triple {1381#false} assume !false; {1381#false} is VALID [2020-07-08 12:46:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:03,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:03,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 10 [2020-07-08 12:46:03,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332402172] [2020-07-08 12:46:03,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-08 12:46:03,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:03,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:46:03,856 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-08 12:46:03,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:46:03,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:46:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:46:03,858 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2020-07-08 12:46:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:04,027 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2020-07-08 12:46:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:46:04,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-08 12:46:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:46:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2020-07-08 12:46:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:46:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2020-07-08 12:46:04,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2020-07-08 12:46:04,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:04,086 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:46:04,086 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:46:04,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:46:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:46:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-08 12:46:04,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:04,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-08 12:46:04,107 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 12:46:04,107 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 12:46:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:04,109 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-08 12:46:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 12:46:04,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:04,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:04,110 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 12:46:04,110 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 12:46:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:04,112 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-08 12:46:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 12:46:04,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:04,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:04,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:04,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 12:46:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2020-07-08 12:46:04,115 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 31 [2020-07-08 12:46:04,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:04,115 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-07-08 12:46:04,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:46:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-08 12:46:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 12:46:04,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:04,116 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:04,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:04,328 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:04,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash 749989817, now seen corresponding path program 5 times [2020-07-08 12:46:04,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:04,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678317953] [2020-07-08 12:46:04,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:46:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:46:04,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:46:04,372 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:46:04,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 12:46:04,398 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:04,398 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:46:04,398 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:46:04,398 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:46:04,398 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:46:04,398 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:46:04,398 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:46:04,398 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:46:04,398 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:46:04,399 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:46:04,399 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:46:04,399 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:04,399 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:04,399 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:04,399 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-08 12:46:04,399 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-08 12:46:04,399 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:46:04,399 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:46:04,400 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:04,400 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:04,400 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:46:04,400 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:46:04,400 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-08 12:46:04,400 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:04,400 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:46:04,400 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:46:04,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:46:04 BoogieIcfgContainer [2020-07-08 12:46:04,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:46:04,406 INFO L168 Benchmark]: Toolchain (without parser) took 5891.74 ms. Allocated memory was 145.2 MB in the beginning and 275.3 MB in the end (delta: 130.0 MB). Free memory was 102.0 MB in the beginning and 217.2 MB in the end (delta: -115.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:04,407 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:46:04,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.40 ms. Allocated memory is still 145.2 MB. Free memory was 101.8 MB in the beginning and 92.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:04,408 INFO L168 Benchmark]: Boogie Preprocessor took 114.75 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 92.2 MB in the beginning and 181.1 MB in the end (delta: -88.9 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:04,409 INFO L168 Benchmark]: RCFGBuilder took 349.13 ms. Allocated memory is still 201.9 MB. Free memory was 181.1 MB in the beginning and 166.7 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:04,409 INFO L168 Benchmark]: TraceAbstraction took 5182.73 ms. Allocated memory was 201.9 MB in the beginning and 275.3 MB in the end (delta: 73.4 MB). Free memory was 166.0 MB in the beginning and 217.2 MB in the end (delta: -51.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:04,412 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 239.40 ms. Allocated memory is still 145.2 MB. Free memory was 101.8 MB in the beginning and 92.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.75 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 92.2 MB in the beginning and 181.1 MB in the end (delta: -88.9 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 349.13 ms. Allocated memory is still 201.9 MB. Free memory was 181.1 MB in the beginning and 166.7 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5182.73 ms. Allocated memory was 201.9 MB in the beginning and 275.3 MB in the end (delta: 73.4 MB). Free memory was 166.0 MB in the beginning and 217.2 MB in the end (delta: -51.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.0s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 103 SDtfs, 69 SDslu, 232 SDs, 0 SdLazy, 160 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 343 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 12474 SizeOfPredicates, 5 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 176/380 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 incorrect! Received shutdown request...