/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/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:25,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:25,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:25,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:25,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:25,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:25,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:25,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:25,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:25,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:25,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:25,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:25,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:25,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:25,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:25,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:25,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:25,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:25,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:25,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:25,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:25,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:25,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:25,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:25,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:25,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:25,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:25,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:25,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:25,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:25,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:25,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:25,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:25,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:25,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:25,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:25,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:25,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:25,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:25,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:25,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:25,196 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:25,210 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:25,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:25,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:25,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:25,212 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:25,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:25,213 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:25,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:25,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:25,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:25,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:25,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:25,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:25,214 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:25,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:25,214 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:25,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:25,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:25,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:25,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:25,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:25,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:25,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:25,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:25,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:25,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:25,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:25,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:25,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:25,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:25,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:25,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:25,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:25,514 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:25,515 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:25,516 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-17 22:50:25,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e224a3b/c937e04d695c4b16bc7a3141ac594b8b/FLAG7684f0954 [2020-07-17 22:50:26,034 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:26,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-17 22:50:26,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e224a3b/c937e04d695c4b16bc7a3141ac594b8b/FLAG7684f0954 [2020-07-17 22:50:26,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e224a3b/c937e04d695c4b16bc7a3141ac594b8b [2020-07-17 22:50:26,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:26,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:26,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:26,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:26,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:26,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4559a9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26, skipping insertion in model container [2020-07-17 22:50:26,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:26,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:26,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:26,688 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:26,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:26,717 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:26,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26 WrapperNode [2020-07-17 22:50:26,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:26,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:26,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:26,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:26,727 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:26" (1/1) ... [2020-07-17 22:50:26,727 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:26" (1/1) ... [2020-07-17 22:50:26,804 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:26" (1/1) ... [2020-07-17 22:50:26,805 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:26" (1/1) ... [2020-07-17 22:50:26,810 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:26" (1/1) ... [2020-07-17 22:50:26,815 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:26" (1/1) ... [2020-07-17 22:50:26,816 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:26" (1/1) ... [2020-07-17 22:50:26,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:26,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:26,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:26,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:26,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (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:26,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:26,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:26,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:26,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-17 22:50:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:27,113 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:27,114 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:50:27,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:27 BoogieIcfgContainer [2020-07-17 22:50:27,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:27,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:27,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:27,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:27,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:26" (1/3) ... [2020-07-17 22:50:27,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5a8c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:27, skipping insertion in model container [2020-07-17 22:50:27,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (2/3) ... [2020-07-17 22:50:27,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5a8c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:27, skipping insertion in model container [2020-07-17 22:50:27,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:27" (3/3) ... [2020-07-17 22:50:27,125 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2020-07-17 22:50:27,135 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:27,143 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:27,158 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:27,190 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:27,190 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:27,190 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:27,191 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:27,191 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:27,191 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:27,191 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:27,191 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-17 22:50:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:27,221 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:27,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:27,222 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2020-07-17 22:50:27,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:27,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237724518] [2020-07-17 22:50:27,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:50:27,386 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-17 22:50:27,388 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-17 22:50:27,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:50:27,389 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-17 22:50:27,389 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2020-07-17 22:50:27,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2020-07-17 22:50:27,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-17 22:50:27,392 INFO L263 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2020-07-17 22:50:27,392 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-17 22:50:27,392 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-17 22:50:27,393 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-17 22:50:27,394 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:27,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237724518] [2020-07-17 22:50:27,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:27,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:50:27,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078549347] [2020-07-17 22:50:27,402 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:27,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:27,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:50:27,451 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:27,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:50:27,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:27,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:50:27,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:50:27,461 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-17 22:50:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,528 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-17 22:50:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:50:27,528 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-17 22:50:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-17 22:50:27,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2020-07-17 22:50:27,615 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:27,626 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:50:27,626 INFO L226 Difference]: Without dead ends: 13 [2020-07-17 22:50:27,630 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:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-17 22:50:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-17 22:50:27,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:27,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:27,671 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:27,672 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,675 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-17 22:50:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-17 22:50:27,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,676 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:27,676 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:27,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,680 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-17 22:50:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-17 22:50:27,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:27,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:50:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-17 22:50:27,686 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-17 22:50:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:27,687 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-17 22:50:27,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:50:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-17 22:50:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:27,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:27,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:27,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:27,689 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:27,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2020-07-17 22:50:27,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:27,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300845291] [2020-07-17 22:50:27,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,792 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-17 22:50:27,793 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-17 22:50:27,793 INFO L263 TraceCheckUtils]: 0: Hoare triple {113#true} call ULTIMATE.init(); {113#true} is VALID [2020-07-17 22:50:27,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-17 22:50:27,794 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-17 22:50:27,794 INFO L263 TraceCheckUtils]: 3: Hoare triple {113#true} call #t~ret2 := main(); {113#true} is VALID [2020-07-17 22:50:27,796 INFO L280 TraceCheckUtils]: 4: Hoare triple {113#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {117#(= 0 main_~sn~0)} is VALID [2020-07-17 22:50:27,797 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {117#(= 0 main_~sn~0)} is VALID [2020-07-17 22:50:27,799 INFO L263 TraceCheckUtils]: 6: Hoare triple {117#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {118#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:27,800 INFO L280 TraceCheckUtils]: 7: Hoare triple {118#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {119#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:27,801 INFO L280 TraceCheckUtils]: 8: Hoare triple {119#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {114#false} is VALID [2020-07-17 22:50:27,801 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-17 22:50:27,802 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:27,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300845291] [2020-07-17 22:50:27,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:27,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:50:27,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429922588] [2020-07-17 22:50:27,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:50:27,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:27,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:27,821 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:27,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:27,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:27,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:27,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:27,823 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2020-07-17 22:50:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,912 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-17 22:50:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:27,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:50:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-17 22:50:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-17 22:50:27,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2020-07-17 22:50:27,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:27,948 INFO L225 Difference]: With dead ends: 19 [2020-07-17 22:50:27,949 INFO L226 Difference]: Without dead ends: 14 [2020-07-17 22:50:27,950 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-17 22:50:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-17 22:50:27,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:27,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,959 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,959 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,961 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-17 22:50:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:50:27,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,962 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,962 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,964 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-17 22:50:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:50:27,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:27,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:50:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-17 22:50:27,968 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2020-07-17 22:50:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:27,968 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-17 22:50:27,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:50:27,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:50:27,969 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:27,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:27,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:27,970 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash 137668885, now seen corresponding path program 1 times [2020-07-17 22:50:27,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:27,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13222823] [2020-07-17 22:50:27,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {203#true} assume true; {203#true} is VALID [2020-07-17 22:50:28,231 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {203#true} {203#true} #37#return; {203#true} is VALID [2020-07-17 22:50:28,232 INFO L263 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2020-07-17 22:50:28,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2020-07-17 22:50:28,232 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #37#return; {203#true} is VALID [2020-07-17 22:50:28,233 INFO L263 TraceCheckUtils]: 3: Hoare triple {203#true} call #t~ret2 := main(); {203#true} is VALID [2020-07-17 22:50:28,234 INFO L280 TraceCheckUtils]: 4: Hoare triple {203#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {207#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:28,236 INFO L280 TraceCheckUtils]: 5: Hoare triple {207#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {208#(and (or (<= (* 2 main_~i~0) main_~sn~0) (< (* 2 main_~n~0) (+ main_~sn~0 1))) (<= main_~sn~0 (* 2 main_~n~0)))} is VALID [2020-07-17 22:50:28,237 INFO L280 TraceCheckUtils]: 6: Hoare triple {208#(and (or (<= (* 2 main_~i~0) main_~sn~0) (< (* 2 main_~n~0) (+ main_~sn~0 1))) (<= main_~sn~0 (* 2 main_~n~0)))} assume !(4 == ~i~0); {208#(and (or (<= (* 2 main_~i~0) main_~sn~0) (< (* 2 main_~n~0) (+ main_~sn~0 1))) (<= main_~sn~0 (* 2 main_~n~0)))} is VALID [2020-07-17 22:50:28,238 INFO L280 TraceCheckUtils]: 7: Hoare triple {208#(and (or (<= (* 2 main_~i~0) main_~sn~0) (< (* 2 main_~n~0) (+ main_~sn~0 1))) (<= main_~sn~0 (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {209#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< (* 2 main_~n~0) (+ main_~sn~0 1))))} is VALID [2020-07-17 22:50:28,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {209#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< (* 2 main_~n~0) (+ main_~sn~0 1))))} assume !(~i~0 <= ~n~0); {210#(and (<= main_~sn~0 (* 2 main_~n~0)) (< (* 2 main_~n~0) (+ main_~sn~0 1)))} is VALID [2020-07-17 22:50:28,241 INFO L263 TraceCheckUtils]: 9: Hoare triple {210#(and (<= main_~sn~0 (* 2 main_~n~0)) (< (* 2 main_~n~0) (+ main_~sn~0 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {211#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:28,242 INFO L280 TraceCheckUtils]: 10: Hoare triple {211#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {212#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:28,243 INFO L280 TraceCheckUtils]: 11: Hoare triple {212#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {204#false} is VALID [2020-07-17 22:50:28,243 INFO L280 TraceCheckUtils]: 12: Hoare triple {204#false} assume !false; {204#false} is VALID [2020-07-17 22:50:28,246 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:28,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13222823] [2020-07-17 22:50:28,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804213220] [2020-07-17 22:50:28,247 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:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 22:50:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:28,452 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:28,514 INFO L263 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2020-07-17 22:50:28,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2020-07-17 22:50:28,515 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #37#return; {203#true} is VALID [2020-07-17 22:50:28,515 INFO L263 TraceCheckUtils]: 3: Hoare triple {203#true} call #t~ret2 := main(); {203#true} is VALID [2020-07-17 22:50:28,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {203#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {228#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:28,517 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {232#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:28,518 INFO L280 TraceCheckUtils]: 6: Hoare triple {232#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} assume !(4 == ~i~0); {232#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:28,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {232#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {239#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} is VALID [2020-07-17 22:50:28,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {239#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} assume !(~i~0 <= ~n~0); {243#(and (= 2 main_~sn~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-17 22:50:28,522 INFO L263 TraceCheckUtils]: 9: Hoare triple {243#(and (= 2 main_~sn~0) (<= 1 main_~n~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:28,523 INFO L280 TraceCheckUtils]: 10: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:28,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {204#false} is VALID [2020-07-17 22:50:28,524 INFO L280 TraceCheckUtils]: 12: Hoare triple {204#false} assume !false; {204#false} is VALID [2020-07-17 22:50:28,525 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:28,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:28,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-17 22:50:28,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077736749] [2020-07-17 22:50:28,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2020-07-17 22:50:28,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:28,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:50:28,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:28,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:50:28,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:28,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:50:28,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:50:28,559 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 14 states. [2020-07-17 22:50:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:28,890 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-17 22:50:28,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:50:28,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2020-07-17 22:50:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:50:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2020-07-17 22:50:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:50:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2020-07-17 22:50:28,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2020-07-17 22:50:28,951 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:28,952 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:50:28,952 INFO L226 Difference]: Without dead ends: 20 [2020-07-17 22:50:28,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:50:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-17 22:50:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-17 22:50:28,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:28,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:28,968 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:28,968 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:28,970 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-17 22:50:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-17 22:50:28,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:28,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:28,972 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:28,972 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:28,974 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-17 22:50:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-17 22:50:28,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:28,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:28,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:28,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:50:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-17 22:50:28,977 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2020-07-17 22:50:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:28,978 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-17 22:50:28,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:50:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-17 22:50:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:50:28,979 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:28,979 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:29,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:50:29,193 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2110192267, now seen corresponding path program 1 times [2020-07-17 22:50:29,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:29,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590842270] [2020-07-17 22:50:29,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-17 22:50:29,255 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {381#true} {381#true} #37#return; {381#true} is VALID [2020-07-17 22:50:29,256 INFO L263 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2020-07-17 22:50:29,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-17 22:50:29,257 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #37#return; {381#true} is VALID [2020-07-17 22:50:29,257 INFO L263 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret2 := main(); {381#true} is VALID [2020-07-17 22:50:29,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {385#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,259 INFO L280 TraceCheckUtils]: 5: Hoare triple {385#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {385#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,260 INFO L280 TraceCheckUtils]: 6: Hoare triple {385#(<= main_~i~0 1)} assume !(4 == ~i~0); {385#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,261 INFO L280 TraceCheckUtils]: 7: Hoare triple {385#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {386#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,263 INFO L280 TraceCheckUtils]: 8: Hoare triple {386#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {386#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,265 INFO L280 TraceCheckUtils]: 9: Hoare triple {386#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {382#false} is VALID [2020-07-17 22:50:29,265 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {382#false} is VALID [2020-07-17 22:50:29,265 INFO L280 TraceCheckUtils]: 11: Hoare triple {382#false} assume !(~i~0 <= ~n~0); {382#false} is VALID [2020-07-17 22:50:29,266 INFO L263 TraceCheckUtils]: 12: Hoare triple {382#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {382#false} is VALID [2020-07-17 22:50:29,266 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2020-07-17 22:50:29,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2020-07-17 22:50:29,267 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#false} assume !false; {382#false} is VALID [2020-07-17 22:50:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:29,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590842270] [2020-07-17 22:50:29,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454906933] [2020-07-17 22:50:29,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,302 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:50:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:29,341 INFO L263 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2020-07-17 22:50:29,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-17 22:50:29,341 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #37#return; {381#true} is VALID [2020-07-17 22:50:29,342 INFO L263 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret2 := main(); {381#true} is VALID [2020-07-17 22:50:29,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {385#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {385#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {385#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,344 INFO L280 TraceCheckUtils]: 6: Hoare triple {385#(<= main_~i~0 1)} assume !(4 == ~i~0); {385#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {385#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {386#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {386#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {386#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,347 INFO L280 TraceCheckUtils]: 9: Hoare triple {386#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {382#false} is VALID [2020-07-17 22:50:29,347 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {382#false} is VALID [2020-07-17 22:50:29,347 INFO L280 TraceCheckUtils]: 11: Hoare triple {382#false} assume !(~i~0 <= ~n~0); {382#false} is VALID [2020-07-17 22:50:29,348 INFO L263 TraceCheckUtils]: 12: Hoare triple {382#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {382#false} is VALID [2020-07-17 22:50:29,348 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2020-07-17 22:50:29,348 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2020-07-17 22:50:29,348 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#false} assume !false; {382#false} is VALID [2020-07-17 22:50:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:29,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:29,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-17 22:50:29,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983236286] [2020-07-17 22:50:29,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-17 22:50:29,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:29,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:29,369 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:29,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:29,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:29,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:29,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:29,370 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 4 states. [2020-07-17 22:50:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:29,426 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-17 22:50:29,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:29,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-17 22:50:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-07-17 22:50:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-07-17 22:50:29,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2020-07-17 22:50:29,472 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:29,473 INFO L225 Difference]: With dead ends: 28 [2020-07-17 22:50:29,473 INFO L226 Difference]: Without dead ends: 20 [2020-07-17 22:50:29,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-17 22:50:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-17 22:50:29,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:29,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:29,486 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:29,486 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:29,488 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-17 22:50:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-17 22:50:29,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:29,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:29,489 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:29,489 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:29,491 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-17 22:50:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-17 22:50:29,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:29,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:29,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:29,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:50:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-17 22:50:29,494 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2020-07-17 22:50:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:29,494 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-17 22:50:29,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-17 22:50:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:50:29,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:29,495 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:29,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:29,708 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:29,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:29,709 INFO L82 PathProgramCache]: Analyzing trace with hash 370288085, now seen corresponding path program 2 times [2020-07-17 22:50:29,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:29,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525261758] [2020-07-17 22:50:29,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {545#true} assume true; {545#true} is VALID [2020-07-17 22:50:29,957 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {545#true} {545#true} #37#return; {545#true} is VALID [2020-07-17 22:50:29,957 INFO L263 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2020-07-17 22:50:29,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {545#true} assume true; {545#true} is VALID [2020-07-17 22:50:29,957 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {545#true} {545#true} #37#return; {545#true} is VALID [2020-07-17 22:50:29,958 INFO L263 TraceCheckUtils]: 3: Hoare triple {545#true} call #t~ret2 := main(); {545#true} is VALID [2020-07-17 22:50:29,959 INFO L280 TraceCheckUtils]: 4: Hoare triple {545#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {549#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:29,960 INFO L280 TraceCheckUtils]: 5: Hoare triple {549#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {550#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:29,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {550#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} assume !(4 == ~i~0); {550#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:29,961 INFO L280 TraceCheckUtils]: 7: Hoare triple {550#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {549#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:29,962 INFO L280 TraceCheckUtils]: 8: Hoare triple {549#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {550#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:29,963 INFO L280 TraceCheckUtils]: 9: Hoare triple {550#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} assume !(4 == ~i~0); {550#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:29,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {550#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {549#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:29,971 INFO L280 TraceCheckUtils]: 11: Hoare triple {549#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {551#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-17 22:50:29,973 INFO L280 TraceCheckUtils]: 12: Hoare triple {551#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} assume !(4 == ~i~0); {551#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-17 22:50:29,974 INFO L280 TraceCheckUtils]: 13: Hoare triple {551#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {552#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-17 22:50:29,975 INFO L280 TraceCheckUtils]: 14: Hoare triple {552#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {553#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-17 22:50:29,976 INFO L263 TraceCheckUtils]: 15: Hoare triple {553#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {554#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:29,977 INFO L280 TraceCheckUtils]: 16: Hoare triple {554#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {555#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:29,978 INFO L280 TraceCheckUtils]: 17: Hoare triple {555#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {546#false} is VALID [2020-07-17 22:50:29,978 INFO L280 TraceCheckUtils]: 18: Hoare triple {546#false} assume !false; {546#false} is VALID [2020-07-17 22:50:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:50:29,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525261758] [2020-07-17 22:50:29,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850646678] [2020-07-17 22:50:29,980 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:50:30,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:30,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:30,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:30,015 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:30,233 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:30,282 INFO L263 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2020-07-17 22:50:30,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {545#true} assume true; {545#true} is VALID [2020-07-17 22:50:30,283 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {545#true} {545#true} #37#return; {545#true} is VALID [2020-07-17 22:50:30,283 INFO L263 TraceCheckUtils]: 3: Hoare triple {545#true} call #t~ret2 := main(); {545#true} is VALID [2020-07-17 22:50:30,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {545#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {571#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:30,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {571#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {575#(and (= 1 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:30,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {575#(and (= 1 main_~i~0) (= 2 main_~sn~0))} assume !(4 == ~i~0); {575#(and (= 1 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:30,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {575#(and (= 1 main_~i~0) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {582#(and (= 2 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:30,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {582#(and (= 2 main_~i~0) (= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {586#(and (= 2 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-17 22:50:30,288 INFO L280 TraceCheckUtils]: 9: Hoare triple {586#(and (= 2 main_~i~0) (= 4 main_~sn~0))} assume !(4 == ~i~0); {586#(and (= 2 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-17 22:50:30,289 INFO L280 TraceCheckUtils]: 10: Hoare triple {586#(and (= 2 main_~i~0) (= 4 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {593#(and (= 3 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-17 22:50:30,290 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(and (= 3 main_~i~0) (= 4 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {597#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2020-07-17 22:50:30,290 INFO L280 TraceCheckUtils]: 12: Hoare triple {597#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} assume !(4 == ~i~0); {597#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2020-07-17 22:50:30,291 INFO L280 TraceCheckUtils]: 13: Hoare triple {597#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {604#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-17 22:50:30,305 INFO L280 TraceCheckUtils]: 14: Hoare triple {604#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} assume !(~i~0 <= ~n~0); {608#(and (<= main_~n~0 3) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-17 22:50:30,307 INFO L263 TraceCheckUtils]: 15: Hoare triple {608#(and (<= main_~n~0 3) (= 6 main_~sn~0) (<= 3 main_~n~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:30,308 INFO L280 TraceCheckUtils]: 16: Hoare triple {612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:30,308 INFO L280 TraceCheckUtils]: 17: Hoare triple {616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {546#false} is VALID [2020-07-17 22:50:30,309 INFO L280 TraceCheckUtils]: 18: Hoare triple {546#false} assume !false; {546#false} is VALID [2020-07-17 22:50:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:30,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:30,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2020-07-17 22:50:30,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906544107] [2020-07-17 22:50:30,311 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2020-07-17 22:50:30,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:30,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:50:30,355 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:30,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:50:30,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:30,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:50:30,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:50:30,356 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 19 states. [2020-07-17 22:50:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,130 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-07-17 22:50:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:50:31,130 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2020-07-17 22:50:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:50:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2020-07-17 22:50:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:50:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2020-07-17 22:50:31,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2020-07-17 22:50:31,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:31,198 INFO L225 Difference]: With dead ends: 38 [2020-07-17 22:50:31,199 INFO L226 Difference]: Without dead ends: 26 [2020-07-17 22:50:31,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2020-07-17 22:50:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-17 22:50:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-17 22:50:31,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:31,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-17 22:50:31,218 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-17 22:50:31,218 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-17 22:50:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,220 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-17 22:50:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-17 22:50:31,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:31,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:31,221 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-17 22:50:31,221 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-17 22:50:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,223 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-17 22:50:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-17 22:50:31,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:31,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:31,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:31,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:50:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-17 22:50:31,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2020-07-17 22:50:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:31,226 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-17 22:50:31,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:50:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:50:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:50:31,227 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:31,227 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:31,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:31,443 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash 66146485, now seen corresponding path program 2 times [2020-07-17 22:50:31,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:31,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417032287] [2020-07-17 22:50:31,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:31,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:50:31,499 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:50:31,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:50:31,524 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:31,524 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:31,524 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:31,524 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:50:31,524 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:50:31,525 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:31,525 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:31,525 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:31,525 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:31,525 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:31,525 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:31,525 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:31,525 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:31,525 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:50:31,526 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:31,527 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:31,527 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:31,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:50:31 BoogieIcfgContainer [2020-07-17 22:50:31,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:50:31,532 INFO L168 Benchmark]: Toolchain (without parser) took 5048.72 ms. Allocated memory was 136.3 MB in the beginning and 251.7 MB in the end (delta: 115.3 MB). Free memory was 101.3 MB in the beginning and 92.5 MB in the end (delta: 8.8 MB). Peak memory consumption was 124.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:31,533 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:31,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.26 ms. Allocated memory is still 136.3 MB. Free memory was 100.9 MB in the beginning and 91.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:31,535 INFO L168 Benchmark]: Boogie Preprocessor took 99.05 ms. Allocated memory was 136.3 MB in the beginning and 198.7 MB in the end (delta: 62.4 MB). Free memory was 91.3 MB in the beginning and 177.9 MB in the end (delta: -86.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:31,535 INFO L168 Benchmark]: RCFGBuilder took 299.99 ms. Allocated memory is still 198.7 MB. Free memory was 177.9 MB in the beginning and 162.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:31,536 INFO L168 Benchmark]: TraceAbstraction took 4410.68 ms. Allocated memory was 198.7 MB in the beginning and 251.7 MB in the end (delta: 53.0 MB). Free memory was 162.0 MB in the beginning and 92.5 MB in the end (delta: 69.5 MB). Peak memory consumption was 122.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:31,539 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 232.26 ms. Allocated memory is still 136.3 MB. Free memory was 100.9 MB in the beginning and 91.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.05 ms. Allocated memory was 136.3 MB in the beginning and 198.7 MB in the end (delta: 62.4 MB). Free memory was 91.3 MB in the beginning and 177.9 MB in the end (delta: -86.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 299.99 ms. Allocated memory is still 198.7 MB. Free memory was 177.9 MB in the beginning and 162.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4410.68 ms. Allocated memory was 198.7 MB in the beginning and 251.7 MB in the end (delta: 53.0 MB). Free memory was 162.0 MB in the beginning and 92.5 MB in the end (delta: 69.5 MB). Peak memory consumption was 122.4 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, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=4, n=0] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=4, n=2] [L13] i++ VAL [i=2, n=2, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=6, n=4] [L15] COND FALSE !(i==4) VAL [i=3, n=4, n=6] [L13] i++ VAL [i=4, n=4, n=6] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=4, n=8] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(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: 4.3s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 59 SDtfs, 19 SDslu, 153 SDs, 0 SdLazy, 247 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 7686 SizeOfPredicates, 7 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 11/36 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...