/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-267fbe0 [2020-07-17 22:50:31,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:31,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:31,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:31,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:31,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:31,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:31,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:31,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:31,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:31,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:31,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:31,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:31,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:31,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:31,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:31,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:31,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:31,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:31,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:31,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:31,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:31,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:31,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:31,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:31,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:31,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:31,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:31,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:31,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:31,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:31,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:31,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:31,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:31,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:31,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:31,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:31,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:31,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:31,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:31,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:31,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:50:31,192 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:31,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:31,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:31,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:31,195 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:31,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:31,195 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:31,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:31,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:31,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:31,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:31,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:31,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:31,198 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:31,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:31,198 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:31,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:31,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:31,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:31,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:31,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:31,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:31,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:31,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:31,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:31,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:31,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:31,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:31,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:31,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:31,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:31,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:31,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:31,512 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:31,512 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:31,513 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-17 22:50:31,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c64f599d/c826354db5d1455b97792f90c46d361e/FLAG404f02bdd [2020-07-17 22:50:32,098 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:32,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2020-07-17 22:50:32,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c64f599d/c826354db5d1455b97792f90c46d361e/FLAG404f02bdd [2020-07-17 22:50:32,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c64f599d/c826354db5d1455b97792f90c46d361e [2020-07-17 22:50:32,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:32,495 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:32,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:32,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:32,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:32,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:32" (1/1) ... [2020-07-17 22:50:32,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f4206d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32, skipping insertion in model container [2020-07-17 22:50:32,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:32" (1/1) ... [2020-07-17 22:50:32,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:32,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:32,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:32,774 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:32,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:32,805 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:32,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32 WrapperNode [2020-07-17 22:50:32,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:32,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:32,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:32,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:32,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32" (1/1) ... [2020-07-17 22:50:32,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32" (1/1) ... [2020-07-17 22:50:32,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32" (1/1) ... [2020-07-17 22:50:32,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32" (1/1) ... [2020-07-17 22:50:32,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32" (1/1) ... [2020-07-17 22:50:32,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32" (1/1) ... [2020-07-17 22:50:32,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32" (1/1) ... [2020-07-17 22:50:32,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:32,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:32,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:32,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:32,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:33,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:33,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:33,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:33,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:33,339 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:33,340 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:50:33,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:33 BoogieIcfgContainer [2020-07-17 22:50:33,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:33,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:33,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:33,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:33,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:32" (1/3) ... [2020-07-17 22:50:33,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c92e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:33, skipping insertion in model container [2020-07-17 22:50:33,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:32" (2/3) ... [2020-07-17 22:50:33,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c92e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:33, skipping insertion in model container [2020-07-17 22:50:33,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:33" (3/3) ... [2020-07-17 22:50:33,352 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-1.i [2020-07-17 22:50:33,364 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:33,371 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:33,386 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:33,411 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:33,411 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:33,411 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:33,411 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:33,412 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:33,412 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:33,412 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:33,412 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-17 22:50:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:33,443 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:33,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:33,444 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:33,449 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2020-07-17 22:50:33,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:33,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990020534] [2020-07-17 22:50:33,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:33,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:50:33,583 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-17 22:50:33,585 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-17 22:50:33,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:50:33,586 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-17 22:50:33,586 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2020-07-17 22:50:33,586 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2020-07-17 22:50:33,588 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-17 22:50:33,589 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-17 22:50:33,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-17 22:50:33,589 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-17 22:50:33,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-17 22:50:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:33,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990020534] [2020-07-17 22:50:33,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:33,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:50:33,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982350080] [2020-07-17 22:50:33,599 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:33,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:33,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:50:33,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:33,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:50:33,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:33,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:50:33,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:50:33,660 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-17 22:50:33,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:33,751 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-17 22:50:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:50:33,752 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-17 22:50:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-17 22:50:33,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2020-07-17 22:50:33,841 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-17 22:50:33,851 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:50:33,851 INFO L226 Difference]: Without dead ends: 13 [2020-07-17 22:50:33,855 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-17 22:50:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-17 22:50:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-17 22:50:33,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:33,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:33,903 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:33,904 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:33,909 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-17 22:50:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-17 22:50:33,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:33,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:33,912 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:33,912 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:33,918 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-17 22:50:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-17 22:50:33,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:33,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:33,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:33,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:50:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-17 22:50:33,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-17 22:50:33,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:33,933 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-17 22:50:33,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:50:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-17 22:50:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:33,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:33,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:33,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:33,936 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:33,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:33,938 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2020-07-17 22:50:33,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:33,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256058675] [2020-07-17 22:50:33,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-17 22:50:34,019 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-17 22:50:34,019 INFO L263 TraceCheckUtils]: 0: Hoare triple {113#true} call ULTIMATE.init(); {113#true} is VALID [2020-07-17 22:50:34,020 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-17 22:50:34,020 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-17 22:50:34,020 INFO L263 TraceCheckUtils]: 3: Hoare triple {113#true} call #t~ret1 := main(); {113#true} is VALID [2020-07-17 22:50:34,022 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-17 22:50:34,023 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#(<= main_~i~0 1)} assume !(~i~0 <= 8); {114#false} is VALID [2020-07-17 22:50:34,023 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-17 22:50:34,023 INFO L280 TraceCheckUtils]: 7: Hoare triple {114#false} ~cond := #in~cond; {114#false} is VALID [2020-07-17 22:50:34,024 INFO L280 TraceCheckUtils]: 8: Hoare triple {114#false} assume 0 == ~cond; {114#false} is VALID [2020-07-17 22:50:34,024 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-17 22:50:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:34,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256058675] [2020-07-17 22:50:34,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:34,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:50:34,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610210929] [2020-07-17 22:50:34,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-17 22:50:34,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:34,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:34,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:34,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:34,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:34,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:34,048 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-17 22:50:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,103 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-17 22:50:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:34,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-17 22:50:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-07-17 22:50:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-07-17 22:50:34,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2020-07-17 22:50:34,150 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-17 22:50:34,152 INFO L225 Difference]: With dead ends: 24 [2020-07-17 22:50:34,152 INFO L226 Difference]: Without dead ends: 16 [2020-07-17 22:50:34,153 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-17 22:50:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-17 22:50:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-17 22:50:34,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:34,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2020-07-17 22:50:34,163 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2020-07-17 22:50:34,163 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2020-07-17 22:50:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,166 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-17 22:50:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-17 22:50:34,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:34,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:34,167 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2020-07-17 22:50:34,167 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2020-07-17 22:50:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,170 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-17 22:50:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-17 22:50:34,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:34,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:34,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:34,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:50:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-17 22:50:34,173 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-17 22:50:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:34,173 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-17 22:50:34,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:50:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:50:34,175 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:34,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:34,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:34,176 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2020-07-17 22:50:34,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:34,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048686196] [2020-07-17 22:50:34,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,249 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-17 22:50:34,250 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {210#true} {210#true} #37#return; {210#true} is VALID [2020-07-17 22:50:34,251 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-17 22:50:34,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-17 22:50:34,251 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #37#return; {210#true} is VALID [2020-07-17 22:50:34,252 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret1 := main(); {210#true} is VALID [2020-07-17 22:50:34,253 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-17 22:50:34,254 INFO L280 TraceCheckUtils]: 5: Hoare triple {214#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {214#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:34,255 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-17 22:50:34,256 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-17 22:50:34,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 2)} assume !(~i~0 <= 8); {211#false} is VALID [2020-07-17 22:50:34,258 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-17 22:50:34,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2020-07-17 22:50:34,259 INFO L280 TraceCheckUtils]: 11: Hoare triple {211#false} assume 0 == ~cond; {211#false} is VALID [2020-07-17 22:50:34,259 INFO L280 TraceCheckUtils]: 12: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-17 22:50:34,261 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-17 22:50:34,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048686196] [2020-07-17 22:50:34,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816491409] [2020-07-17 22:50:34,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:50:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:34,391 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-17 22:50:34,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-17 22:50:34,392 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #37#return; {210#true} is VALID [2020-07-17 22:50:34,392 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret1 := main(); {210#true} is VALID [2020-07-17 22:50:34,394 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-17 22:50:34,395 INFO L280 TraceCheckUtils]: 5: Hoare triple {214#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {214#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:34,395 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-17 22:50:34,397 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-17 22:50:34,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 2)} assume !(~i~0 <= 8); {211#false} is VALID [2020-07-17 22:50:34,398 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-17 22:50:34,399 INFO L280 TraceCheckUtils]: 10: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2020-07-17 22:50:34,399 INFO L280 TraceCheckUtils]: 11: Hoare triple {211#false} assume 0 == ~cond; {211#false} is VALID [2020-07-17 22:50:34,400 INFO L280 TraceCheckUtils]: 12: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-17 22:50:34,401 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-17 22:50:34,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:34,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-17 22:50:34,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915250078] [2020-07-17 22:50:34,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-17 22:50:34,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:34,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:34,438 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-17 22:50:34,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:34,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:34,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:34,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:34,439 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2020-07-17 22:50:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,510 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-17 22:50:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:34,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-17 22:50:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-17 22:50:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-17 22:50:34,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2020-07-17 22:50:34,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:34,556 INFO L225 Difference]: With dead ends: 27 [2020-07-17 22:50:34,557 INFO L226 Difference]: Without dead ends: 19 [2020-07-17 22:50:34,558 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-17 22:50:34,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-17 22:50:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-17 22:50:34,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:34,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 18 states. [2020-07-17 22:50:34,569 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 18 states. [2020-07-17 22:50:34,569 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 18 states. [2020-07-17 22:50:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,571 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-17 22:50:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-17 22:50:34,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:34,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:34,572 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states. [2020-07-17 22:50:34,572 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states. [2020-07-17 22:50:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,574 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-17 22:50:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-17 22:50:34,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:34,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:34,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:34,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:50:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-17 22:50:34,577 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-17 22:50:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:34,577 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-17 22:50:34,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:50:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:50:34,578 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:34,579 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:34,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:50:34,792 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:34,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1717165257, now seen corresponding path program 2 times [2020-07-17 22:50:34,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:34,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975551568] [2020-07-17 22:50:34,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,866 INFO L280 TraceCheckUtils]: 0: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-17 22:50:34,866 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {358#true} {358#true} #37#return; {358#true} is VALID [2020-07-17 22:50:34,867 INFO L263 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2020-07-17 22:50:34,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-17 22:50:34,867 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #37#return; {358#true} is VALID [2020-07-17 22:50:34,867 INFO L263 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret1 := main(); {358#true} is VALID [2020-07-17 22:50:34,868 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-17 22:50:34,869 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {362#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:34,870 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-17 22:50:34,870 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-17 22:50:34,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {363#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:34,872 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-17 22:50:34,873 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-17 22:50:34,874 INFO L280 TraceCheckUtils]: 11: Hoare triple {364#(<= main_~i~0 3)} assume !(~i~0 <= 8); {359#false} is VALID [2020-07-17 22:50:34,875 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-17 22:50:34,875 INFO L280 TraceCheckUtils]: 13: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2020-07-17 22:50:34,875 INFO L280 TraceCheckUtils]: 14: Hoare triple {359#false} assume 0 == ~cond; {359#false} is VALID [2020-07-17 22:50:34,876 INFO L280 TraceCheckUtils]: 15: Hoare triple {359#false} assume !false; {359#false} is VALID [2020-07-17 22:50:34,876 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-17 22:50:34,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975551568] [2020-07-17 22:50:34,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098906870] [2020-07-17 22:50:34,877 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:34,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:34,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:34,907 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:50:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,914 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:34,954 INFO L263 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2020-07-17 22:50:34,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-17 22:50:34,955 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #37#return; {358#true} is VALID [2020-07-17 22:50:34,955 INFO L263 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret1 := main(); {358#true} is VALID [2020-07-17 22:50:34,956 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-17 22:50:34,957 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {362#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:34,958 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-17 22:50:34,959 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-17 22:50:34,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {363#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:34,960 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-17 22:50:34,961 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-17 22:50:34,962 INFO L280 TraceCheckUtils]: 11: Hoare triple {364#(<= main_~i~0 3)} assume !(~i~0 <= 8); {359#false} is VALID [2020-07-17 22:50:34,963 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-17 22:50:34,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2020-07-17 22:50:34,963 INFO L280 TraceCheckUtils]: 14: Hoare triple {359#false} assume 0 == ~cond; {359#false} is VALID [2020-07-17 22:50:34,963 INFO L280 TraceCheckUtils]: 15: Hoare triple {359#false} assume !false; {359#false} is VALID [2020-07-17 22:50:34,964 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-17 22:50:34,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:34,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-17 22:50:34,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619171926] [2020-07-17 22:50:34,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 22:50:34,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:34,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:34,985 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-17 22:50:34,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:34,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:34,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:34,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:34,987 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2020-07-17 22:50:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,070 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-17 22:50:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:35,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 22:50:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-17 22:50:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-17 22:50:35,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-17 22:50:35,119 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-17 22:50:35,121 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:50:35,121 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:50:35,122 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-17 22:50:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:50:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-17 22:50:35,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:35,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-17 22:50:35,135 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-17 22:50:35,135 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-17 22:50:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,138 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:50:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:50:35,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,139 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-17 22:50:35,140 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-17 22:50:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,142 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:50:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:50:35,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:35,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:50:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-17 22:50:35,145 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2020-07-17 22:50:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:35,145 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-17 22:50:35,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:50:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:50:35,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:35,146 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:35,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:35,360 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:35,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:35,360 INFO L82 PathProgramCache]: Analyzing trace with hash -424886253, now seen corresponding path program 3 times [2020-07-17 22:50:35,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:35,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483754851] [2020-07-17 22:50:35,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-17 22:50:35,431 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {530#true} {530#true} #37#return; {530#true} is VALID [2020-07-17 22:50:35,431 INFO L263 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2020-07-17 22:50:35,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-17 22:50:35,432 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #37#return; {530#true} is VALID [2020-07-17 22:50:35,432 INFO L263 TraceCheckUtils]: 3: Hoare triple {530#true} call #t~ret1 := main(); {530#true} is VALID [2020-07-17 22:50:35,433 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {530#true} is VALID [2020-07-17 22:50:35,433 INFO L280 TraceCheckUtils]: 5: Hoare triple {530#true} assume !!(~i~0 <= 8); {530#true} is VALID [2020-07-17 22:50:35,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {530#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {530#true} is VALID [2020-07-17 22:50:35,433 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-17 22:50:35,434 INFO L280 TraceCheckUtils]: 8: Hoare triple {530#true} assume !!(~i~0 <= 8); {530#true} is VALID [2020-07-17 22:50:35,434 INFO L280 TraceCheckUtils]: 9: Hoare triple {530#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {530#true} is VALID [2020-07-17 22:50:35,434 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-17 22:50:35,435 INFO L280 TraceCheckUtils]: 11: Hoare triple {530#true} assume !!(~i~0 <= 8); {530#true} is VALID [2020-07-17 22:50:35,436 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-17 22:50:35,437 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-17 22:50:35,437 INFO L280 TraceCheckUtils]: 14: Hoare triple {535#(<= main_~i~0 4)} assume !(~i~0 <= 8); {531#false} is VALID [2020-07-17 22:50:35,438 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-17 22:50:35,438 INFO L280 TraceCheckUtils]: 16: Hoare triple {531#false} ~cond := #in~cond; {531#false} is VALID [2020-07-17 22:50:35,438 INFO L280 TraceCheckUtils]: 17: Hoare triple {531#false} assume 0 == ~cond; {531#false} is VALID [2020-07-17 22:50:35,438 INFO L280 TraceCheckUtils]: 18: Hoare triple {531#false} assume !false; {531#false} is VALID [2020-07-17 22:50:35,439 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-17 22:50:35,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483754851] [2020-07-17 22:50:35,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:35,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:50:35,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340783463] [2020-07-17 22:50:35,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-17 22:50:35,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:35,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:35,461 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-17 22:50:35,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:35,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:35,462 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2020-07-17 22:50:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,548 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-17 22:50:35,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:35,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-17 22:50:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-07-17 22:50:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-07-17 22:50:35,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2020-07-17 22:50:35,592 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-17 22:50:35,594 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:50:35,594 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 22:50:35,595 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-17 22:50:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 22:50:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-17 22:50:35,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:35,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 23 states. [2020-07-17 22:50:35,612 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 23 states. [2020-07-17 22:50:35,613 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 23 states. [2020-07-17 22:50:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,616 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-17 22:50:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:50:35,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,618 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states. [2020-07-17 22:50:35,618 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states. [2020-07-17 22:50:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,620 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-17 22:50:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:50:35,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:35,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:50:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-17 22:50:35,623 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2020-07-17 22:50:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:35,624 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-17 22:50:35,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-17 22:50:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:50:35,625 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:35,625 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:35,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:50:35,626 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash -452912071, now seen corresponding path program 1 times [2020-07-17 22:50:35,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:35,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733845171] [2020-07-17 22:50:35,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-17 22:50:35,717 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {665#true} {665#true} #37#return; {665#true} is VALID [2020-07-17 22:50:35,717 INFO L263 TraceCheckUtils]: 0: Hoare triple {665#true} call ULTIMATE.init(); {665#true} is VALID [2020-07-17 22:50:35,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-17 22:50:35,718 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {665#true} {665#true} #37#return; {665#true} is VALID [2020-07-17 22:50:35,718 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#true} call #t~ret1 := main(); {665#true} is VALID [2020-07-17 22:50:35,718 INFO L280 TraceCheckUtils]: 4: Hoare triple {665#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {665#true} is VALID [2020-07-17 22:50:35,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {665#true} assume !!(~i~0 <= 8); {665#true} is VALID [2020-07-17 22:50:35,719 INFO L280 TraceCheckUtils]: 6: Hoare triple {665#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {665#true} is VALID [2020-07-17 22:50:35,719 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-17 22:50:35,720 INFO L280 TraceCheckUtils]: 8: Hoare triple {665#true} assume !!(~i~0 <= 8); {665#true} is VALID [2020-07-17 22:50:35,720 INFO L280 TraceCheckUtils]: 9: Hoare triple {665#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {665#true} is VALID [2020-07-17 22:50:35,720 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-17 22:50:35,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {665#true} assume !!(~i~0 <= 8); {665#true} is VALID [2020-07-17 22:50:35,722 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-17 22:50:35,723 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-17 22:50:35,724 INFO L280 TraceCheckUtils]: 14: Hoare triple {670#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {670#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:35,724 INFO L280 TraceCheckUtils]: 15: Hoare triple {670#(<= main_~i~0 4)} assume !(~i~0 < 4); {670#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:35,726 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-17 22:50:35,727 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= main_~i~0 5)} assume !(~i~0 <= 8); {666#false} is VALID [2020-07-17 22:50:35,727 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-17 22:50:35,727 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#false} ~cond := #in~cond; {666#false} is VALID [2020-07-17 22:50:35,728 INFO L280 TraceCheckUtils]: 20: Hoare triple {666#false} assume 0 == ~cond; {666#false} is VALID [2020-07-17 22:50:35,728 INFO L280 TraceCheckUtils]: 21: Hoare triple {666#false} assume !false; {666#false} is VALID [2020-07-17 22:50:35,729 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-17 22:50:35,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733845171] [2020-07-17 22:50:35,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061906070] [2020-07-17 22:50:35,730 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,763 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:50:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,775 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:35,890 INFO L263 TraceCheckUtils]: 0: Hoare triple {665#true} call ULTIMATE.init(); {665#true} is VALID [2020-07-17 22:50:35,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-17 22:50:35,891 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {665#true} {665#true} #37#return; {665#true} is VALID [2020-07-17 22:50:35,891 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#true} call #t~ret1 := main(); {665#true} is VALID [2020-07-17 22:50:35,892 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-17 22:50:35,893 INFO L280 TraceCheckUtils]: 5: Hoare triple {687#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {687#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:35,893 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-17 22:50:35,894 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-17 22:50:35,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {697#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {697#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:35,896 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-17 22:50:35,897 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-17 22:50:35,898 INFO L280 TraceCheckUtils]: 11: Hoare triple {669#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {669#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:35,898 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-17 22:50:35,899 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-17 22:50:35,899 INFO L280 TraceCheckUtils]: 14: Hoare triple {670#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {670#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:35,900 INFO L280 TraceCheckUtils]: 15: Hoare triple {670#(<= main_~i~0 4)} assume !(~i~0 < 4); {670#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:35,905 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-17 22:50:35,906 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= main_~i~0 5)} assume !(~i~0 <= 8); {666#false} is VALID [2020-07-17 22:50:35,907 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-17 22:50:35,907 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#false} ~cond := #in~cond; {666#false} is VALID [2020-07-17 22:50:35,907 INFO L280 TraceCheckUtils]: 20: Hoare triple {666#false} assume 0 == ~cond; {666#false} is VALID [2020-07-17 22:50:35,908 INFO L280 TraceCheckUtils]: 21: Hoare triple {666#false} assume !false; {666#false} is VALID [2020-07-17 22:50:35,909 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-17 22:50:35,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:35,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 7 [2020-07-17 22:50:35,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380860857] [2020-07-17 22:50:35,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:50:35,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:35,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:50:35,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:35,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:50:35,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:35,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:50:35,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:35,951 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2020-07-17 22:50:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,049 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-17 22:50:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:36,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:50:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-17 22:50:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-17 22:50:36,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2020-07-17 22:50:36,115 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-17 22:50:36,117 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:50:36,117 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:50:36,118 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-17 22:50:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:50:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-17 22:50:36,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:36,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-17 22:50:36,137 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-17 22:50:36,137 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-17 22:50:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,138 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-17 22:50:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:50:36,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:36,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:36,139 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-17 22:50:36,139 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-17 22:50:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,141 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-17 22:50:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:50:36,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:36,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:36,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:36,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-17 22:50:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-07-17 22:50:36,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2020-07-17 22:50:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:36,145 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-17 22:50:36,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:50:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-17 22:50:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:50:36,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:36,146 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:36,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:36,358 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:36,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2146400685, now seen corresponding path program 2 times [2020-07-17 22:50:36,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:36,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27071013] [2020-07-17 22:50:36,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {880#true} assume true; {880#true} is VALID [2020-07-17 22:50:36,446 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {880#true} {880#true} #37#return; {880#true} is VALID [2020-07-17 22:50:36,446 INFO L263 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2020-07-17 22:50:36,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2020-07-17 22:50:36,447 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #37#return; {880#true} is VALID [2020-07-17 22:50:36,448 INFO L263 TraceCheckUtils]: 3: Hoare triple {880#true} call #t~ret1 := main(); {880#true} is VALID [2020-07-17 22:50:36,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {880#true} is VALID [2020-07-17 22:50:36,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {880#true} assume !!(~i~0 <= 8); {880#true} is VALID [2020-07-17 22:50:36,448 INFO L280 TraceCheckUtils]: 6: Hoare triple {880#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {880#true} is VALID [2020-07-17 22:50:36,449 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-17 22:50:36,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {880#true} assume !!(~i~0 <= 8); {880#true} is VALID [2020-07-17 22:50:36,450 INFO L280 TraceCheckUtils]: 9: Hoare triple {880#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {880#true} is VALID [2020-07-17 22:50:36,450 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-17 22:50:36,450 INFO L280 TraceCheckUtils]: 11: Hoare triple {880#true} assume !!(~i~0 <= 8); {880#true} is VALID [2020-07-17 22:50:36,451 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-17 22:50:36,452 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-17 22:50:36,453 INFO L280 TraceCheckUtils]: 14: Hoare triple {885#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {885#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,454 INFO L280 TraceCheckUtils]: 15: Hoare triple {885#(<= main_~i~0 4)} assume !(~i~0 < 4); {885#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,454 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-17 22:50:36,455 INFO L280 TraceCheckUtils]: 17: Hoare triple {886#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {886#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:36,456 INFO L280 TraceCheckUtils]: 18: Hoare triple {886#(<= main_~i~0 5)} assume !(~i~0 < 4); {886#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:36,457 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-17 22:50:36,457 INFO L280 TraceCheckUtils]: 20: Hoare triple {887#(<= main_~i~0 6)} assume !(~i~0 <= 8); {881#false} is VALID [2020-07-17 22:50:36,458 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-17 22:50:36,458 INFO L280 TraceCheckUtils]: 22: Hoare triple {881#false} ~cond := #in~cond; {881#false} is VALID [2020-07-17 22:50:36,458 INFO L280 TraceCheckUtils]: 23: Hoare triple {881#false} assume 0 == ~cond; {881#false} is VALID [2020-07-17 22:50:36,458 INFO L280 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2020-07-17 22:50:36,459 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-17 22:50:36,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27071013] [2020-07-17 22:50:36,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441158274] [2020-07-17 22:50:36,460 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:36,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:36,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:36,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:50:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:36,607 INFO L263 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2020-07-17 22:50:36,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2020-07-17 22:50:36,607 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #37#return; {880#true} is VALID [2020-07-17 22:50:36,608 INFO L263 TraceCheckUtils]: 3: Hoare triple {880#true} call #t~ret1 := main(); {880#true} is VALID [2020-07-17 22:50:36,613 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-17 22:50:36,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {903#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {903#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:36,615 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-17 22:50:36,616 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-17 22:50:36,617 INFO L280 TraceCheckUtils]: 8: Hoare triple {913#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {913#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:36,617 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-17 22:50:36,618 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-17 22:50:36,619 INFO L280 TraceCheckUtils]: 11: Hoare triple {884#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {884#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:36,624 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-17 22:50:36,625 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-17 22:50:36,625 INFO L280 TraceCheckUtils]: 14: Hoare triple {885#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {885#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,626 INFO L280 TraceCheckUtils]: 15: Hoare triple {885#(<= main_~i~0 4)} assume !(~i~0 < 4); {885#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,627 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-17 22:50:36,627 INFO L280 TraceCheckUtils]: 17: Hoare triple {886#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {886#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:36,628 INFO L280 TraceCheckUtils]: 18: Hoare triple {886#(<= main_~i~0 5)} assume !(~i~0 < 4); {886#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:36,629 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-17 22:50:36,629 INFO L280 TraceCheckUtils]: 20: Hoare triple {887#(<= main_~i~0 6)} assume !(~i~0 <= 8); {881#false} is VALID [2020-07-17 22:50:36,629 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-17 22:50:36,630 INFO L280 TraceCheckUtils]: 22: Hoare triple {881#false} ~cond := #in~cond; {881#false} is VALID [2020-07-17 22:50:36,630 INFO L280 TraceCheckUtils]: 23: Hoare triple {881#false} assume 0 == ~cond; {881#false} is VALID [2020-07-17 22:50:36,630 INFO L280 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2020-07-17 22:50:36,631 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-17 22:50:36,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:36,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2020-07-17 22:50:36,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466404736] [2020-07-17 22:50:36,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-17 22:50:36,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:36,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:36,689 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-17 22:50:36,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:36,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:36,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:36,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:36,691 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2020-07-17 22:50:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,821 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-17 22:50:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:50:36,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-17 22:50:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:50:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:50:36,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-17 22:50:36,872 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-17 22:50:36,874 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:50:36,874 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:50:36,875 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-17 22:50:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:50:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-17 22:50:36,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:36,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2020-07-17 22:50:36,897 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2020-07-17 22:50:36,897 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2020-07-17 22:50:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,900 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:50:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:50:36,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:36,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:36,902 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2020-07-17 22:50:36,902 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2020-07-17 22:50:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,906 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:50:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:50:36,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:36,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:36,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:36,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:50:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-17 22:50:36,912 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2020-07-17 22:50:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:36,912 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-17 22:50:36,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-17 22:50:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:50:36,914 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:36,914 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:37,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:37,116 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash 115125753, now seen corresponding path program 3 times [2020-07-17 22:50:37,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:37,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529508262] [2020-07-17 22:50:37,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:37,193 INFO L280 TraceCheckUtils]: 0: Hoare triple {1119#true} assume true; {1119#true} is VALID [2020-07-17 22:50:37,193 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1119#true} {1119#true} #37#return; {1119#true} is VALID [2020-07-17 22:50:37,194 INFO L263 TraceCheckUtils]: 0: Hoare triple {1119#true} call ULTIMATE.init(); {1119#true} is VALID [2020-07-17 22:50:37,194 INFO L280 TraceCheckUtils]: 1: Hoare triple {1119#true} assume true; {1119#true} is VALID [2020-07-17 22:50:37,194 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1119#true} {1119#true} #37#return; {1119#true} is VALID [2020-07-17 22:50:37,194 INFO L263 TraceCheckUtils]: 3: Hoare triple {1119#true} call #t~ret1 := main(); {1119#true} is VALID [2020-07-17 22:50:37,194 INFO L280 TraceCheckUtils]: 4: Hoare triple {1119#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1119#true} is VALID [2020-07-17 22:50:37,195 INFO L280 TraceCheckUtils]: 5: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-17 22:50:37,195 INFO L280 TraceCheckUtils]: 6: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-17 22:50:37,195 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-17 22:50:37,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-17 22:50:37,196 INFO L280 TraceCheckUtils]: 9: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-17 22:50:37,196 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-17 22:50:37,196 INFO L280 TraceCheckUtils]: 11: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-17 22:50:37,197 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-17 22:50:37,198 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-17 22:50:37,199 INFO L280 TraceCheckUtils]: 14: Hoare triple {1124#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1124#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,199 INFO L280 TraceCheckUtils]: 15: Hoare triple {1124#(<= main_~i~0 4)} assume !(~i~0 < 4); {1124#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,200 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-17 22:50:37,201 INFO L280 TraceCheckUtils]: 17: Hoare triple {1125#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1125#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,201 INFO L280 TraceCheckUtils]: 18: Hoare triple {1125#(<= main_~i~0 5)} assume !(~i~0 < 4); {1125#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,202 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-17 22:50:37,203 INFO L280 TraceCheckUtils]: 20: Hoare triple {1126#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1126#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:37,203 INFO L280 TraceCheckUtils]: 21: Hoare triple {1126#(<= main_~i~0 6)} assume !(~i~0 < 4); {1126#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:37,204 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-17 22:50:37,205 INFO L280 TraceCheckUtils]: 23: Hoare triple {1127#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1120#false} is VALID [2020-07-17 22:50:37,205 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-17 22:50:37,205 INFO L280 TraceCheckUtils]: 25: Hoare triple {1120#false} ~cond := #in~cond; {1120#false} is VALID [2020-07-17 22:50:37,205 INFO L280 TraceCheckUtils]: 26: Hoare triple {1120#false} assume 0 == ~cond; {1120#false} is VALID [2020-07-17 22:50:37,206 INFO L280 TraceCheckUtils]: 27: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2020-07-17 22:50:37,207 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-17 22:50:37,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529508262] [2020-07-17 22:50:37,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328850800] [2020-07-17 22:50:37,207 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:37,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-17 22:50:37,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:37,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:50:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:37,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:37,335 INFO L263 TraceCheckUtils]: 0: Hoare triple {1119#true} call ULTIMATE.init(); {1119#true} is VALID [2020-07-17 22:50:37,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {1119#true} assume true; {1119#true} is VALID [2020-07-17 22:50:37,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1119#true} {1119#true} #37#return; {1119#true} is VALID [2020-07-17 22:50:37,336 INFO L263 TraceCheckUtils]: 3: Hoare triple {1119#true} call #t~ret1 := main(); {1119#true} is VALID [2020-07-17 22:50:37,336 INFO L280 TraceCheckUtils]: 4: Hoare triple {1119#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1119#true} is VALID [2020-07-17 22:50:37,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-17 22:50:37,337 INFO L280 TraceCheckUtils]: 6: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-17 22:50:37,337 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-17 22:50:37,337 INFO L280 TraceCheckUtils]: 8: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-17 22:50:37,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-17 22:50:37,337 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-17 22:50:37,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-17 22:50:37,338 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-17 22:50:37,339 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-17 22:50:37,339 INFO L280 TraceCheckUtils]: 14: Hoare triple {1124#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1124#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,340 INFO L280 TraceCheckUtils]: 15: Hoare triple {1124#(<= main_~i~0 4)} assume !(~i~0 < 4); {1124#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,342 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-17 22:50:37,343 INFO L280 TraceCheckUtils]: 17: Hoare triple {1125#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1125#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {1125#(<= main_~i~0 5)} assume !(~i~0 < 4); {1125#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,347 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-17 22:50:37,348 INFO L280 TraceCheckUtils]: 20: Hoare triple {1126#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1126#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:37,351 INFO L280 TraceCheckUtils]: 21: Hoare triple {1126#(<= main_~i~0 6)} assume !(~i~0 < 4); {1126#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:37,351 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-17 22:50:37,352 INFO L280 TraceCheckUtils]: 23: Hoare triple {1127#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1120#false} is VALID [2020-07-17 22:50:37,352 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-17 22:50:37,353 INFO L280 TraceCheckUtils]: 25: Hoare triple {1120#false} ~cond := #in~cond; {1120#false} is VALID [2020-07-17 22:50:37,353 INFO L280 TraceCheckUtils]: 26: Hoare triple {1120#false} assume 0 == ~cond; {1120#false} is VALID [2020-07-17 22:50:37,353 INFO L280 TraceCheckUtils]: 27: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2020-07-17 22:50:37,354 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-17 22:50:37,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:37,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-17 22:50:37,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485836845] [2020-07-17 22:50:37,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-17 22:50:37,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:37,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:50:37,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:37,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:50:37,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:50:37,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:37,385 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2020-07-17 22:50:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,508 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-17 22:50:37,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:37,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-17 22:50:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-17 22:50:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-17 22:50:37,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2020-07-17 22:50:37,557 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-17 22:50:37,558 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:50:37,558 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:50:37,559 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-17 22:50:37,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:50:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-17 22:50:37,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:37,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-17 22:50:37,577 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-17 22:50:37,577 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-17 22:50:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,580 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-17 22:50:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-17 22:50:37,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:37,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:37,583 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-17 22:50:37,583 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-17 22:50:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,586 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-17 22:50:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-17 22:50:37,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:37,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:37,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:37,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:50:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-17 22:50:37,594 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 28 [2020-07-17 22:50:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:37,595 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-17 22:50:37,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:50:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-17 22:50:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:50:37,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:37,596 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:37,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:37,804 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1902732141, now seen corresponding path program 4 times [2020-07-17 22:50:37,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:37,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425288375] [2020-07-17 22:50:37,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:37,899 INFO L280 TraceCheckUtils]: 0: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-17 22:50:37,900 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1380#true} {1380#true} #37#return; {1380#true} is VALID [2020-07-17 22:50:37,900 INFO L263 TraceCheckUtils]: 0: Hoare triple {1380#true} call ULTIMATE.init(); {1380#true} is VALID [2020-07-17 22:50:37,900 INFO L280 TraceCheckUtils]: 1: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-17 22:50:37,900 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1380#true} {1380#true} #37#return; {1380#true} is VALID [2020-07-17 22:50:37,900 INFO L263 TraceCheckUtils]: 3: Hoare triple {1380#true} call #t~ret1 := main(); {1380#true} is VALID [2020-07-17 22:50:37,901 INFO L280 TraceCheckUtils]: 4: Hoare triple {1380#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1380#true} is VALID [2020-07-17 22:50:37,901 INFO L280 TraceCheckUtils]: 5: Hoare triple {1380#true} assume !!(~i~0 <= 8); {1380#true} is VALID [2020-07-17 22:50:37,901 INFO L280 TraceCheckUtils]: 6: Hoare triple {1380#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1380#true} is VALID [2020-07-17 22:50:37,901 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-17 22:50:37,901 INFO L280 TraceCheckUtils]: 8: Hoare triple {1380#true} assume !!(~i~0 <= 8); {1380#true} is VALID [2020-07-17 22:50:37,901 INFO L280 TraceCheckUtils]: 9: Hoare triple {1380#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1380#true} is VALID [2020-07-17 22:50:37,902 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-17 22:50:37,902 INFO L280 TraceCheckUtils]: 11: Hoare triple {1380#true} assume !!(~i~0 <= 8); {1380#true} is VALID [2020-07-17 22:50:37,902 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-17 22:50:37,903 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-17 22:50:37,903 INFO L280 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1385#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,904 INFO L280 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !(~i~0 < 4); {1385#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,904 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-17 22:50:37,905 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1386#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,905 INFO L280 TraceCheckUtils]: 18: Hoare triple {1386#(<= main_~i~0 5)} assume !(~i~0 < 4); {1386#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,906 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-17 22:50:37,906 INFO L280 TraceCheckUtils]: 20: Hoare triple {1387#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1387#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:37,907 INFO L280 TraceCheckUtils]: 21: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 4); {1387#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:37,907 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-17 22:50:37,907 INFO L280 TraceCheckUtils]: 23: Hoare triple {1388#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1388#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:37,908 INFO L280 TraceCheckUtils]: 24: Hoare triple {1388#(<= main_~i~0 7)} assume !(~i~0 < 4); {1388#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:37,908 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-17 22:50:37,909 INFO L280 TraceCheckUtils]: 26: Hoare triple {1389#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1381#false} is VALID [2020-07-17 22:50:37,909 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-17 22:50:37,909 INFO L280 TraceCheckUtils]: 28: Hoare triple {1381#false} ~cond := #in~cond; {1381#false} is VALID [2020-07-17 22:50:37,909 INFO L280 TraceCheckUtils]: 29: Hoare triple {1381#false} assume 0 == ~cond; {1381#false} is VALID [2020-07-17 22:50:37,909 INFO L280 TraceCheckUtils]: 30: Hoare triple {1381#false} assume !false; {1381#false} is VALID [2020-07-17 22:50:37,911 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-17 22:50:37,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425288375] [2020-07-17 22:50:37,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731293388] [2020-07-17 22:50:37,912 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:37,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:50:37,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:37,945 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:50:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:37,957 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:38,078 INFO L263 TraceCheckUtils]: 0: Hoare triple {1380#true} call ULTIMATE.init(); {1380#true} is VALID [2020-07-17 22:50:38,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-17 22:50:38,079 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1380#true} {1380#true} #37#return; {1380#true} is VALID [2020-07-17 22:50:38,079 INFO L263 TraceCheckUtils]: 3: Hoare triple {1380#true} call #t~ret1 := main(); {1380#true} is VALID [2020-07-17 22:50:38,080 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-17 22:50:38,080 INFO L280 TraceCheckUtils]: 5: Hoare triple {1405#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1405#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:38,081 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-17 22:50:38,082 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-17 22:50:38,083 INFO L280 TraceCheckUtils]: 8: Hoare triple {1415#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1415#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:38,083 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-17 22:50:38,084 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-17 22:50:38,085 INFO L280 TraceCheckUtils]: 11: Hoare triple {1384#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1384#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:38,087 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-17 22:50:38,088 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-17 22:50:38,088 INFO L280 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1385#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:38,089 INFO L280 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !(~i~0 < 4); {1385#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:38,090 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-17 22:50:38,090 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1386#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:38,091 INFO L280 TraceCheckUtils]: 18: Hoare triple {1386#(<= main_~i~0 5)} assume !(~i~0 < 4); {1386#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:38,091 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-17 22:50:38,092 INFO L280 TraceCheckUtils]: 20: Hoare triple {1387#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1387#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:38,092 INFO L280 TraceCheckUtils]: 21: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 4); {1387#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:38,093 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-17 22:50:38,094 INFO L280 TraceCheckUtils]: 23: Hoare triple {1388#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1388#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:38,095 INFO L280 TraceCheckUtils]: 24: Hoare triple {1388#(<= main_~i~0 7)} assume !(~i~0 < 4); {1388#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:38,096 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-17 22:50:38,096 INFO L280 TraceCheckUtils]: 26: Hoare triple {1389#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1381#false} is VALID [2020-07-17 22:50:38,097 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-17 22:50:38,097 INFO L280 TraceCheckUtils]: 28: Hoare triple {1381#false} ~cond := #in~cond; {1381#false} is VALID [2020-07-17 22:50:38,097 INFO L280 TraceCheckUtils]: 29: Hoare triple {1381#false} assume 0 == ~cond; {1381#false} is VALID [2020-07-17 22:50:38,097 INFO L280 TraceCheckUtils]: 30: Hoare triple {1381#false} assume !false; {1381#false} is VALID [2020-07-17 22:50:38,101 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-17 22:50:38,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:38,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 10 [2020-07-17 22:50:38,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671068731] [2020-07-17 22:50:38,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-17 22:50:38,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:38,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:50:38,138 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-17 22:50:38,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:50:38,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:50:38,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:38,140 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2020-07-17 22:50:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:38,286 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2020-07-17 22:50:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:50:38,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-17 22:50:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2020-07-17 22:50:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2020-07-17 22:50:38,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2020-07-17 22:50:38,356 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-17 22:50:38,358 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:50:38,358 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:50:38,359 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-17 22:50:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:50:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 22:50:38,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:38,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:38,377 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:38,377 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:38,379 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-17 22:50:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-17 22:50:38,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:38,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:38,380 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:38,380 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:38,381 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-17 22:50:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-17 22:50:38,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:38,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:38,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:38,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:50:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2020-07-17 22:50:38,384 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 31 [2020-07-17 22:50:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:38,384 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-07-17 22:50:38,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:50:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-17 22:50:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:50:38,385 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:38,386 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:38,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:38,587 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:38,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash 749989817, now seen corresponding path program 5 times [2020-07-17 22:50:38,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:38,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753534866] [2020-07-17 22:50:38,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:38,645 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:50:38,645 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:50:38,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:50:38,670 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:38,671 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:38,672 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:38,672 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:50:38,672 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:50:38,672 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:50:38,672 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:50:38,672 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:38,672 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:38,672 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:50:38,673 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:38,673 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:50:38,673 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:38,673 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:38,673 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-17 22:50:38,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:50:38 BoogieIcfgContainer [2020-07-17 22:50:38,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:50:38,679 INFO L168 Benchmark]: Toolchain (without parser) took 6184.79 ms. Allocated memory was 144.2 MB in the beginning and 282.1 MB in the end (delta: 137.9 MB). Free memory was 102.4 MB in the beginning and 239.5 MB in the end (delta: -137.1 MB). Peak memory consumption was 809.4 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:38,679 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:38,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.45 ms. Allocated memory is still 144.2 MB. Free memory was 102.0 MB in the beginning and 92.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:38,681 INFO L168 Benchmark]: Boogie Preprocessor took 127.49 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 180.6 MB in the end (delta: -88.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:38,681 INFO L168 Benchmark]: RCFGBuilder took 407.91 ms. Allocated memory is still 201.3 MB. Free memory was 180.6 MB in the beginning and 165.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:38,682 INFO L168 Benchmark]: TraceAbstraction took 5330.57 ms. Allocated memory was 201.3 MB in the beginning and 282.1 MB in the end (delta: 80.7 MB). Free memory was 165.3 MB in the beginning and 239.5 MB in the end (delta: -74.2 MB). Peak memory consumption was 6.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:38,686 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.45 ms. Allocated memory is still 144.2 MB. Free memory was 102.0 MB in the beginning and 92.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.49 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 180.6 MB in the end (delta: -88.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 407.91 ms. Allocated memory is still 201.3 MB. Free memory was 180.6 MB in the beginning and 165.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5330.57 ms. Allocated memory was 201.3 MB in the beginning and 282.1 MB in the end (delta: 80.7 MB). Free memory was 165.3 MB in the beginning and 239.5 MB in the end (delta: -74.2 MB). Peak memory consumption was 6.6 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.2s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 1.4s, 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.2s SatisfiabilityAnalysisTime, 1.3s 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...