/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:35,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:35,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:35,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:35,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:35,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:35,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:35,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:35,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:35,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:35,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:35,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:35,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:35,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:35,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:35,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:35,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:35,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:35,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:35,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:35,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:35,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:35,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:35,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:35,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:35,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:35,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:35,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:35,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:35,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:35,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:35,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:35,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:35,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:35,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:35,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:35,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:35,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:35,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:35,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:35,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:35,111 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-10 15:27:35,125 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:35,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:35,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:35,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:35,127 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:35,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:35,128 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:35,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:35,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:35,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:35,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:35,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:35,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:35,129 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:35,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:35,130 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:35,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:35,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:35,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:35,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:35,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:35,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:35,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:35,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:35,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:35,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:35,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:35,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:35,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:35,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:35,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:35,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:35,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:35,430 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:35,430 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:35,431 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2020-07-10 15:27:35,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf5ae9d2/a09e4029506a466685a6b14dab8efc7b/FLAGe75d8e52a [2020-07-10 15:27:35,923 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:35,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2020-07-10 15:27:35,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf5ae9d2/a09e4029506a466685a6b14dab8efc7b/FLAGe75d8e52a [2020-07-10 15:27:36,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf5ae9d2/a09e4029506a466685a6b14dab8efc7b [2020-07-10 15:27:36,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:36,380 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:36,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:36,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:36,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:36,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdd7274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36, skipping insertion in model container [2020-07-10 15:27:36,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:36,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:36,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:36,599 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:36,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:36,627 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:36,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36 WrapperNode [2020-07-10 15:27:36,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:36,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:36,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:36,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:36,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:36,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:36,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:36,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:36,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (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-10 15:27:36,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:36,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:36,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:36,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-10 15:27:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:36,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:37,067 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:37,068 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:27:37,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:37 BoogieIcfgContainer [2020-07-10 15:27:37,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:37,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:37,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:37,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:37,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:36" (1/3) ... [2020-07-10 15:27:37,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea4e63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:37, skipping insertion in model container [2020-07-10 15:27:37,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (2/3) ... [2020-07-10 15:27:37,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea4e63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:37, skipping insertion in model container [2020-07-10 15:27:37,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:37" (3/3) ... [2020-07-10 15:27:37,085 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2020-07-10 15:27:37,101 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:37,110 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:37,128 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:37,154 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:37,154 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:37,154 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:37,155 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:37,155 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:37,155 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:37,155 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:37,155 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-10 15:27:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:27:37,181 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:37,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:37,182 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:37,188 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2020-07-10 15:27:37,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:37,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839414717] [2020-07-10 15:27:37,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:27:37,364 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-10 15:27:37,366 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-10 15:27:37,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:27:37,367 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-10 15:27:37,369 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2020-07-10 15:27:37,369 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-10 15:27:37,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-10 15:27:37,371 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-10 15:27:37,372 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-10 15:27:37,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-10 15:27:37,374 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-10 15:27:37,375 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-10 15:27:37,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839414717] [2020-07-10 15:27:37,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:37,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:27:37,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025342269] [2020-07-10 15:27:37,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:27:37,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:37,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:27:37,441 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-10 15:27:37,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:27:37,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:37,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:27:37,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:37,453 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-10 15:27:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:37,516 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 15:27:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:27:37,517 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:27:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-10 15:27:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-10 15:27:37,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2020-07-10 15:27:37,605 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-10 15:27:37,617 INFO L225 Difference]: With dead ends: 30 [2020-07-10 15:27:37,617 INFO L226 Difference]: Without dead ends: 13 [2020-07-10 15:27:37,621 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-10 15:27:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-10 15:27:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-10 15:27:37,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:37,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:37,676 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:37,677 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:37,682 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-10 15:27:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-10 15:27:37,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:37,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:37,683 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:37,684 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:37,692 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-10 15:27:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-10 15:27:37,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:37,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:37,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:37,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:27:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-10 15:27:37,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-10 15:27:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:37,708 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-10 15:27:37,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:27:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-10 15:27:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:27:37,710 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:37,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:37,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:37,713 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:37,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2020-07-10 15:27:37,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:37,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302987171] [2020-07-10 15:27:37,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-10 15:27:37,911 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-10 15:27:37,912 INFO L263 TraceCheckUtils]: 0: Hoare triple {113#true} call ULTIMATE.init(); {113#true} is VALID [2020-07-10 15:27:37,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-10 15:27:37,913 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-10 15:27:37,913 INFO L263 TraceCheckUtils]: 3: Hoare triple {113#true} call #t~ret2 := main(); {113#true} is VALID [2020-07-10 15:27:37,915 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-10 15:27:37,917 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-10 15:27:37,918 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-10 15:27:37,919 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-10 15:27:37,922 INFO L280 TraceCheckUtils]: 8: Hoare triple {119#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {114#false} is VALID [2020-07-10 15:27:37,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-10 15:27:37,923 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-10 15:27:37,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302987171] [2020-07-10 15:27:37,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:37,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:27:37,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052291974] [2020-07-10 15:27:37,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:27:37,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:37,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:37,953 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-10 15:27:37,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:37,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:37,954 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2020-07-10 15:27:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,065 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-10 15:27:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:38,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:27:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-10 15:27:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-10 15:27:38,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2020-07-10 15:27:38,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:38,106 INFO L225 Difference]: With dead ends: 21 [2020-07-10 15:27:38,106 INFO L226 Difference]: Without dead ends: 16 [2020-07-10 15:27:38,107 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-10 15:27:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-10 15:27:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-10 15:27:38,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:38,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:38,117 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:38,118 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,120 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-10 15:27:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-10 15:27:38,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:38,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:38,121 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:38,121 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,124 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-10 15:27:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-10 15:27:38,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:38,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:38,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:38,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:27:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-10 15:27:38,128 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2020-07-10 15:27:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:38,128 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-10 15:27:38,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-10 15:27:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:27:38,129 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:38,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:38,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:38,130 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2020-07-10 15:27:38,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:38,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160019431] [2020-07-10 15:27:38,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#true} assume true; {211#true} is VALID [2020-07-10 15:27:38,472 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {211#true} {211#true} #37#return; {211#true} is VALID [2020-07-10 15:27:38,472 INFO L263 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {211#true} is VALID [2020-07-10 15:27:38,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#true} assume true; {211#true} is VALID [2020-07-10 15:27:38,473 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {211#true} {211#true} #37#return; {211#true} is VALID [2020-07-10 15:27:38,474 INFO L263 TraceCheckUtils]: 3: Hoare triple {211#true} call #t~ret2 := main(); {211#true} is VALID [2020-07-10 15:27:38,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {211#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; {215#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:38,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {215#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {216#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:38,478 INFO L280 TraceCheckUtils]: 6: Hoare triple {216#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {217#(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-10 15:27:38,479 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#(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; {218#(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-10 15:27:38,480 INFO L280 TraceCheckUtils]: 8: Hoare triple {218#(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); {219#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-10 15:27:38,482 INFO L263 TraceCheckUtils]: 9: Hoare triple {219#(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)); {220#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:27:38,483 INFO L280 TraceCheckUtils]: 10: Hoare triple {220#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {221#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:27:38,483 INFO L280 TraceCheckUtils]: 11: Hoare triple {221#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {212#false} is VALID [2020-07-10 15:27:38,484 INFO L280 TraceCheckUtils]: 12: Hoare triple {212#false} assume !false; {212#false} is VALID [2020-07-10 15:27:38,486 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-10 15:27:38,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160019431] [2020-07-10 15:27:38,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928892117] [2020-07-10 15:27:38,487 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-10 15:27:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 15:27:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:38,800 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:38,878 INFO L263 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {211#true} is VALID [2020-07-10 15:27:38,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#true} assume true; {211#true} is VALID [2020-07-10 15:27:38,879 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {211#true} {211#true} #37#return; {211#true} is VALID [2020-07-10 15:27:38,880 INFO L263 TraceCheckUtils]: 3: Hoare triple {211#true} call #t~ret2 := main(); {211#true} is VALID [2020-07-10 15:27:38,881 INFO L280 TraceCheckUtils]: 4: Hoare triple {211#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; {237#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-10 15:27:38,882 INFO L280 TraceCheckUtils]: 5: Hoare triple {237#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {241#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 0 main_~sn~0))} is VALID [2020-07-10 15:27:38,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {241#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 0 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {245#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} is VALID [2020-07-10 15:27:38,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {245#(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; {249#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} is VALID [2020-07-10 15:27:38,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} assume !(~i~0 <= ~n~0); {253#(and (= 2 main_~sn~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-10 15:27:38,887 INFO L263 TraceCheckUtils]: 9: Hoare triple {253#(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)); {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:38,888 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:38,891 INFO L280 TraceCheckUtils]: 11: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {212#false} is VALID [2020-07-10 15:27:38,892 INFO L280 TraceCheckUtils]: 12: Hoare triple {212#false} assume !false; {212#false} is VALID [2020-07-10 15:27:38,893 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-10 15:27:38,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:38,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-10 15:27:38,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067416962] [2020-07-10 15:27:38,898 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2020-07-10 15:27:38,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:38,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 15:27:38,927 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-10 15:27:38,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 15:27:38,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:38,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 15:27:38,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:27:38,930 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2020-07-10 15:27:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,493 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-10 15:27:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:27:39,494 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2020-07-10 15:27:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:27:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2020-07-10 15:27:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:27:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2020-07-10 15:27:39,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 41 transitions. [2020-07-10 15:27:39,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:39,567 INFO L225 Difference]: With dead ends: 37 [2020-07-10 15:27:39,567 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:27:39,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-07-10 15:27:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:27:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-10 15:27:39,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:39,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2020-07-10 15:27:39,587 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2020-07-10 15:27:39,587 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2020-07-10 15:27:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,594 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-10 15:27:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-10 15:27:39,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:39,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:39,596 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2020-07-10 15:27:39,596 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2020-07-10 15:27:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,601 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-10 15:27:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-10 15:27:39,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:39,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:39,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:39,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:27:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-10 15:27:39,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2020-07-10 15:27:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:39,606 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-10 15:27:39,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 15:27:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 15:27:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:27:39,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:39,607 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:39,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:27:39,810 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:39,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1350121109, now seen corresponding path program 1 times [2020-07-10 15:27:39,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:39,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32621828] [2020-07-10 15:27:39,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-10 15:27:39,892 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {403#true} {403#true} #37#return; {403#true} is VALID [2020-07-10 15:27:39,892 INFO L263 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID [2020-07-10 15:27:39,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-10 15:27:39,893 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {403#true} {403#true} #37#return; {403#true} is VALID [2020-07-10 15:27:39,893 INFO L263 TraceCheckUtils]: 3: Hoare triple {403#true} call #t~ret2 := main(); {403#true} is VALID [2020-07-10 15:27:39,894 INFO L280 TraceCheckUtils]: 4: Hoare triple {403#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; {407#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,895 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {407#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,895 INFO L280 TraceCheckUtils]: 6: Hoare triple {407#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {407#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,896 INFO L280 TraceCheckUtils]: 7: Hoare triple {407#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {408#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:39,897 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {408#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:39,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {408#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:39,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {408#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {409#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:39,899 INFO L280 TraceCheckUtils]: 11: Hoare triple {409#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {409#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:39,900 INFO L280 TraceCheckUtils]: 12: Hoare triple {409#(<= main_~i~0 3)} assume !(~i~0 < 10); {404#false} is VALID [2020-07-10 15:27:39,900 INFO L280 TraceCheckUtils]: 13: Hoare triple {404#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {404#false} is VALID [2020-07-10 15:27:39,901 INFO L280 TraceCheckUtils]: 14: Hoare triple {404#false} assume !(~i~0 <= ~n~0); {404#false} is VALID [2020-07-10 15:27:39,901 INFO L263 TraceCheckUtils]: 15: Hoare triple {404#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {404#false} is VALID [2020-07-10 15:27:39,901 INFO L280 TraceCheckUtils]: 16: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2020-07-10 15:27:39,902 INFO L280 TraceCheckUtils]: 17: Hoare triple {404#false} assume 0 == ~cond; {404#false} is VALID [2020-07-10 15:27:39,902 INFO L280 TraceCheckUtils]: 18: Hoare triple {404#false} assume !false; {404#false} is VALID [2020-07-10 15:27:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:39,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32621828] [2020-07-10 15:27:39,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9924783] [2020-07-10 15:27:39,903 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) [2020-07-10 15:27:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:39,973 INFO L263 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID [2020-07-10 15:27:39,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-10 15:27:39,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {403#true} {403#true} #37#return; {403#true} is VALID [2020-07-10 15:27:39,974 INFO L263 TraceCheckUtils]: 3: Hoare triple {403#true} call #t~ret2 := main(); {403#true} is VALID [2020-07-10 15:27:39,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {403#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; {407#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,976 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {407#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,976 INFO L280 TraceCheckUtils]: 6: Hoare triple {407#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {407#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,977 INFO L280 TraceCheckUtils]: 7: Hoare triple {407#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {408#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:39,978 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {408#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:39,979 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {408#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:39,980 INFO L280 TraceCheckUtils]: 10: Hoare triple {408#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {409#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:39,980 INFO L280 TraceCheckUtils]: 11: Hoare triple {409#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {409#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:39,981 INFO L280 TraceCheckUtils]: 12: Hoare triple {409#(<= main_~i~0 3)} assume !(~i~0 < 10); {404#false} is VALID [2020-07-10 15:27:39,981 INFO L280 TraceCheckUtils]: 13: Hoare triple {404#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {404#false} is VALID [2020-07-10 15:27:39,982 INFO L280 TraceCheckUtils]: 14: Hoare triple {404#false} assume !(~i~0 <= ~n~0); {404#false} is VALID [2020-07-10 15:27:39,982 INFO L263 TraceCheckUtils]: 15: Hoare triple {404#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {404#false} is VALID [2020-07-10 15:27:39,982 INFO L280 TraceCheckUtils]: 16: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2020-07-10 15:27:39,982 INFO L280 TraceCheckUtils]: 17: Hoare triple {404#false} assume 0 == ~cond; {404#false} is VALID [2020-07-10 15:27:39,983 INFO L280 TraceCheckUtils]: 18: Hoare triple {404#false} assume !false; {404#false} is VALID [2020-07-10 15:27:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:39,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:39,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-10 15:27:39,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542992476] [2020-07-10 15:27:39,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 15:27:39,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:39,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:40,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:40,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:40,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:40,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:40,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:40,008 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2020-07-10 15:27:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,078 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:27:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:40,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 15:27:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 15:27:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 15:27:40,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-10 15:27:40,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:40,120 INFO L225 Difference]: With dead ends: 30 [2020-07-10 15:27:40,120 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:27:40,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:27:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-10 15:27:40,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:40,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-10 15:27:40,134 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-10 15:27:40,134 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-10 15:27:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,136 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:27:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:27:40,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,137 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-10 15:27:40,137 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-10 15:27:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,139 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:27:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:27:40,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:40,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:27:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-10 15:27:40,142 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-07-10 15:27:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:40,143 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-10 15:27:40,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 15:27:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:27:40,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:40,144 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:40,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:40,357 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash -424886253, now seen corresponding path program 2 times [2020-07-10 15:27:40,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:40,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643220394] [2020-07-10 15:27:40,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {584#true} assume true; {584#true} is VALID [2020-07-10 15:27:40,711 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {584#true} {584#true} #37#return; {584#true} is VALID [2020-07-10 15:27:40,712 INFO L263 TraceCheckUtils]: 0: Hoare triple {584#true} call ULTIMATE.init(); {584#true} is VALID [2020-07-10 15:27:40,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2020-07-10 15:27:40,712 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #37#return; {584#true} is VALID [2020-07-10 15:27:40,712 INFO L263 TraceCheckUtils]: 3: Hoare triple {584#true} call #t~ret2 := main(); {584#true} is VALID [2020-07-10 15:27:40,714 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#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; {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:40,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:40,716 INFO L280 TraceCheckUtils]: 6: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {589#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-10 15:27:40,717 INFO L280 TraceCheckUtils]: 7: Hoare triple {589#(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; {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:40,718 INFO L280 TraceCheckUtils]: 8: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:40,719 INFO L280 TraceCheckUtils]: 9: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {589#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-10 15:27:40,720 INFO L280 TraceCheckUtils]: 10: Hoare triple {589#(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; {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:40,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {590#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:40,722 INFO L280 TraceCheckUtils]: 12: Hoare triple {590#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {591#(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-10 15:27:40,723 INFO L280 TraceCheckUtils]: 13: Hoare triple {591#(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; {592#(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-10 15:27:40,724 INFO L280 TraceCheckUtils]: 14: Hoare triple {592#(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); {593#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-10 15:27:40,726 INFO L263 TraceCheckUtils]: 15: Hoare triple {593#(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)); {594#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:27:40,726 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {595#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:27:40,727 INFO L280 TraceCheckUtils]: 17: Hoare triple {595#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {585#false} is VALID [2020-07-10 15:27:40,727 INFO L280 TraceCheckUtils]: 18: Hoare triple {585#false} assume !false; {585#false} is VALID [2020-07-10 15:27:40,728 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-10 15:27:40,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643220394] [2020-07-10 15:27:40,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877400636] [2020-07-10 15:27:40,729 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-10 15:27:40,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:40,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:40,754 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-10 15:27:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:41,055 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:41,126 INFO L263 TraceCheckUtils]: 0: Hoare triple {584#true} call ULTIMATE.init(); {584#true} is VALID [2020-07-10 15:27:41,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2020-07-10 15:27:41,126 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #37#return; {584#true} is VALID [2020-07-10 15:27:41,127 INFO L263 TraceCheckUtils]: 3: Hoare triple {584#true} call #t~ret2 := main(); {584#true} is VALID [2020-07-10 15:27:41,129 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#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; {611#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-10 15:27:41,130 INFO L280 TraceCheckUtils]: 5: Hoare triple {611#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {611#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-10 15:27:41,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {611#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {618#(and (= 1 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-10 15:27:41,132 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#(and (= 1 main_~i~0) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {622#(and (= 2 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-10 15:27:41,148 INFO L280 TraceCheckUtils]: 8: Hoare triple {622#(and (= 2 main_~i~0) (= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0); {622#(and (= 2 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-10 15:27:41,150 INFO L280 TraceCheckUtils]: 9: Hoare triple {622#(and (= 2 main_~i~0) (= 2 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {629#(and (= 2 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-10 15:27:41,154 INFO L280 TraceCheckUtils]: 10: Hoare triple {629#(and (= 2 main_~i~0) (= 4 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {633#(and (= 3 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-10 15:27:41,154 INFO L280 TraceCheckUtils]: 11: Hoare triple {633#(and (= 3 main_~i~0) (= 4 main_~sn~0))} assume !!(~i~0 <= ~n~0); {637#(and (= 3 main_~i~0) (= 4 main_~sn~0) (<= main_~i~0 main_~n~0))} is VALID [2020-07-10 15:27:41,155 INFO L280 TraceCheckUtils]: 12: Hoare triple {637#(and (= 3 main_~i~0) (= 4 main_~sn~0) (<= main_~i~0 main_~n~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {641#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2020-07-10 15:27:41,156 INFO L280 TraceCheckUtils]: 13: Hoare triple {641#(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; {645#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-10 15:27:41,157 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} assume !(~i~0 <= ~n~0); {649#(and (<= main_~n~0 3) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-10 15:27:41,161 INFO L263 TraceCheckUtils]: 15: Hoare triple {649#(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)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:41,162 INFO L280 TraceCheckUtils]: 16: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:41,163 INFO L280 TraceCheckUtils]: 17: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {585#false} is VALID [2020-07-10 15:27:41,163 INFO L280 TraceCheckUtils]: 18: Hoare triple {585#false} assume !false; {585#false} is VALID [2020-07-10 15:27:41,164 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-10 15:27:41,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:41,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2020-07-10 15:27:41,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207099267] [2020-07-10 15:27:41,165 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2020-07-10 15:27:41,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:41,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 15:27:41,211 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-10 15:27:41,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 15:27:41,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:41,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 15:27:41,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2020-07-10 15:27:41,213 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 21 states. [2020-07-10 15:27:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,320 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-10 15:27:42,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-10 15:27:42,320 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2020-07-10 15:27:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:27:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2020-07-10 15:27:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:27:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2020-07-10 15:27:42,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2020-07-10 15:27:42,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:42,390 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:27:42,390 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:27:42,392 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2020-07-10 15:27:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:27:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-10 15:27:42,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:42,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-10 15:27:42,409 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-10 15:27:42,409 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-10 15:27:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,411 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-10 15:27:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-10 15:27:42,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:42,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:42,412 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-10 15:27:42,412 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-10 15:27:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,418 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-10 15:27:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-10 15:27:42,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:42,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:42,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:42,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:27:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-10 15:27:42,421 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2020-07-10 15:27:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:42,421 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-10 15:27:42,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 15:27:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 15:27:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:27:42,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:42,422 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:42,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:42,627 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1753373675, now seen corresponding path program 2 times [2020-07-10 15:27:42,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:42,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008376614] [2020-07-10 15:27:42,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:42,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {844#true} assume true; {844#true} is VALID [2020-07-10 15:27:42,710 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {844#true} {844#true} #37#return; {844#true} is VALID [2020-07-10 15:27:42,710 INFO L263 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2020-07-10 15:27:42,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {844#true} assume true; {844#true} is VALID [2020-07-10 15:27:42,711 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {844#true} {844#true} #37#return; {844#true} is VALID [2020-07-10 15:27:42,711 INFO L263 TraceCheckUtils]: 3: Hoare triple {844#true} call #t~ret2 := main(); {844#true} is VALID [2020-07-10 15:27:42,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {844#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; {848#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:42,717 INFO L280 TraceCheckUtils]: 5: Hoare triple {848#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {848#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:42,719 INFO L280 TraceCheckUtils]: 6: Hoare triple {848#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {848#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:42,720 INFO L280 TraceCheckUtils]: 7: Hoare triple {848#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {849#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:42,721 INFO L280 TraceCheckUtils]: 8: Hoare triple {849#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {849#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:42,722 INFO L280 TraceCheckUtils]: 9: Hoare triple {849#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {849#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:42,722 INFO L280 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {850#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:42,723 INFO L280 TraceCheckUtils]: 11: Hoare triple {850#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {850#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:42,724 INFO L280 TraceCheckUtils]: 12: Hoare triple {850#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {850#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:42,725 INFO L280 TraceCheckUtils]: 13: Hoare triple {850#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {851#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:42,726 INFO L280 TraceCheckUtils]: 14: Hoare triple {851#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {851#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:42,726 INFO L280 TraceCheckUtils]: 15: Hoare triple {851#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {851#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:42,727 INFO L280 TraceCheckUtils]: 16: Hoare triple {851#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {852#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:42,728 INFO L280 TraceCheckUtils]: 17: Hoare triple {852#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {852#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:42,728 INFO L280 TraceCheckUtils]: 18: Hoare triple {852#(<= main_~i~0 5)} assume !(~i~0 < 10); {845#false} is VALID [2020-07-10 15:27:42,729 INFO L280 TraceCheckUtils]: 19: Hoare triple {845#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {845#false} is VALID [2020-07-10 15:27:42,729 INFO L280 TraceCheckUtils]: 20: Hoare triple {845#false} assume !(~i~0 <= ~n~0); {845#false} is VALID [2020-07-10 15:27:42,729 INFO L263 TraceCheckUtils]: 21: Hoare triple {845#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {845#false} is VALID [2020-07-10 15:27:42,729 INFO L280 TraceCheckUtils]: 22: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2020-07-10 15:27:42,729 INFO L280 TraceCheckUtils]: 23: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2020-07-10 15:27:42,730 INFO L280 TraceCheckUtils]: 24: Hoare triple {845#false} assume !false; {845#false} is VALID [2020-07-10 15:27:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:42,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008376614] [2020-07-10 15:27:42,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227159757] [2020-07-10 15:27:42,734 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:42,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:42,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:42,761 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:42,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:42,817 INFO L263 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2020-07-10 15:27:42,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {844#true} assume true; {844#true} is VALID [2020-07-10 15:27:42,818 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {844#true} {844#true} #37#return; {844#true} is VALID [2020-07-10 15:27:42,818 INFO L263 TraceCheckUtils]: 3: Hoare triple {844#true} call #t~ret2 := main(); {844#true} is VALID [2020-07-10 15:27:42,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {844#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; {848#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:42,820 INFO L280 TraceCheckUtils]: 5: Hoare triple {848#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {848#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:42,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {848#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {848#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:42,821 INFO L280 TraceCheckUtils]: 7: Hoare triple {848#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {849#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:42,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {849#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {849#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:42,821 INFO L280 TraceCheckUtils]: 9: Hoare triple {849#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {849#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:42,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {850#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:42,825 INFO L280 TraceCheckUtils]: 11: Hoare triple {850#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {850#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:42,825 INFO L280 TraceCheckUtils]: 12: Hoare triple {850#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {850#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:42,826 INFO L280 TraceCheckUtils]: 13: Hoare triple {850#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {851#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:42,826 INFO L280 TraceCheckUtils]: 14: Hoare triple {851#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {851#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:42,826 INFO L280 TraceCheckUtils]: 15: Hoare triple {851#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {851#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:42,827 INFO L280 TraceCheckUtils]: 16: Hoare triple {851#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {852#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:42,828 INFO L280 TraceCheckUtils]: 17: Hoare triple {852#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {852#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:42,828 INFO L280 TraceCheckUtils]: 18: Hoare triple {852#(<= main_~i~0 5)} assume !(~i~0 < 10); {845#false} is VALID [2020-07-10 15:27:42,828 INFO L280 TraceCheckUtils]: 19: Hoare triple {845#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {845#false} is VALID [2020-07-10 15:27:42,829 INFO L280 TraceCheckUtils]: 20: Hoare triple {845#false} assume !(~i~0 <= ~n~0); {845#false} is VALID [2020-07-10 15:27:42,829 INFO L263 TraceCheckUtils]: 21: Hoare triple {845#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {845#false} is VALID [2020-07-10 15:27:42,829 INFO L280 TraceCheckUtils]: 22: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2020-07-10 15:27:42,829 INFO L280 TraceCheckUtils]: 23: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2020-07-10 15:27:42,829 INFO L280 TraceCheckUtils]: 24: Hoare triple {845#false} assume !false; {845#false} is VALID [2020-07-10 15:27:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:42,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:42,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-10 15:27:42,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474273399] [2020-07-10 15:27:42,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-10 15:27:42,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:42,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:27:42,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:42,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:27:42,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:42,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:27:42,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:42,859 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2020-07-10 15:27:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,975 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-10 15:27:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:27:42,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-10 15:27:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-10 15:27:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-10 15:27:42,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2020-07-10 15:27:43,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:43,024 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:27:43,024 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:27:43,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:27:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-10 15:27:43,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:43,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2020-07-10 15:27:43,057 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2020-07-10 15:27:43,057 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2020-07-10 15:27:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:43,059 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 15:27:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 15:27:43,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:43,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:43,060 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2020-07-10 15:27:43,061 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2020-07-10 15:27:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:43,062 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 15:27:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 15:27:43,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:43,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:43,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:43,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:27:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-10 15:27:43,065 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2020-07-10 15:27:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:43,065 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-10 15:27:43,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:27:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 15:27:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:43,066 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:43,067 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:43,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:43,279 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1094958777, now seen corresponding path program 3 times [2020-07-10 15:27:43,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:43,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781384594] [2020-07-10 15:27:43,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:43,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-10 15:27:43,409 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1087#true} {1087#true} #37#return; {1087#true} is VALID [2020-07-10 15:27:43,409 INFO L263 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1087#true} is VALID [2020-07-10 15:27:43,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-10 15:27:43,409 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #37#return; {1087#true} is VALID [2020-07-10 15:27:43,410 INFO L263 TraceCheckUtils]: 3: Hoare triple {1087#true} call #t~ret2 := main(); {1087#true} is VALID [2020-07-10 15:27:43,411 INFO L280 TraceCheckUtils]: 4: Hoare triple {1087#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; {1091#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:43,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {1091#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1091#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:43,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {1091#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1091#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:43,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {1091#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1092#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:43,414 INFO L280 TraceCheckUtils]: 8: Hoare triple {1092#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1092#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:43,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {1092#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1092#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:43,415 INFO L280 TraceCheckUtils]: 10: Hoare triple {1092#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1093#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:43,415 INFO L280 TraceCheckUtils]: 11: Hoare triple {1093#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1093#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:43,416 INFO L280 TraceCheckUtils]: 12: Hoare triple {1093#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1093#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:43,416 INFO L280 TraceCheckUtils]: 13: Hoare triple {1093#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1094#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:43,417 INFO L280 TraceCheckUtils]: 14: Hoare triple {1094#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1094#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:43,417 INFO L280 TraceCheckUtils]: 15: Hoare triple {1094#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1094#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:43,422 INFO L280 TraceCheckUtils]: 16: Hoare triple {1094#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1095#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:43,423 INFO L280 TraceCheckUtils]: 17: Hoare triple {1095#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1095#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:43,423 INFO L280 TraceCheckUtils]: 18: Hoare triple {1095#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1095#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:43,424 INFO L280 TraceCheckUtils]: 19: Hoare triple {1095#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1096#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:43,425 INFO L280 TraceCheckUtils]: 20: Hoare triple {1096#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1096#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:43,425 INFO L280 TraceCheckUtils]: 21: Hoare triple {1096#(<= main_~i~0 6)} assume !(~i~0 < 10); {1088#false} is VALID [2020-07-10 15:27:43,425 INFO L280 TraceCheckUtils]: 22: Hoare triple {1088#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1088#false} is VALID [2020-07-10 15:27:43,426 INFO L280 TraceCheckUtils]: 23: Hoare triple {1088#false} assume !(~i~0 <= ~n~0); {1088#false} is VALID [2020-07-10 15:27:43,426 INFO L263 TraceCheckUtils]: 24: Hoare triple {1088#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1088#false} is VALID [2020-07-10 15:27:43,426 INFO L280 TraceCheckUtils]: 25: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2020-07-10 15:27:43,426 INFO L280 TraceCheckUtils]: 26: Hoare triple {1088#false} assume 0 == ~cond; {1088#false} is VALID [2020-07-10 15:27:43,426 INFO L280 TraceCheckUtils]: 27: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2020-07-10 15:27:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:43,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781384594] [2020-07-10 15:27:43,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811671663] [2020-07-10 15:27:43,429 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:43,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-10 15:27:43,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:43,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:27:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:43,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:43,547 INFO L263 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1087#true} is VALID [2020-07-10 15:27:43,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-10 15:27:43,548 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #37#return; {1087#true} is VALID [2020-07-10 15:27:43,548 INFO L263 TraceCheckUtils]: 3: Hoare triple {1087#true} call #t~ret2 := main(); {1087#true} is VALID [2020-07-10 15:27:43,549 INFO L280 TraceCheckUtils]: 4: Hoare triple {1087#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; {1091#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:43,549 INFO L280 TraceCheckUtils]: 5: Hoare triple {1091#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1091#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:43,551 INFO L280 TraceCheckUtils]: 6: Hoare triple {1091#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1091#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:43,552 INFO L280 TraceCheckUtils]: 7: Hoare triple {1091#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1092#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:43,552 INFO L280 TraceCheckUtils]: 8: Hoare triple {1092#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1092#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:43,553 INFO L280 TraceCheckUtils]: 9: Hoare triple {1092#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1092#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:43,553 INFO L280 TraceCheckUtils]: 10: Hoare triple {1092#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1093#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:43,554 INFO L280 TraceCheckUtils]: 11: Hoare triple {1093#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1093#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:43,554 INFO L280 TraceCheckUtils]: 12: Hoare triple {1093#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1093#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:43,555 INFO L280 TraceCheckUtils]: 13: Hoare triple {1093#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1094#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:43,556 INFO L280 TraceCheckUtils]: 14: Hoare triple {1094#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1094#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:43,556 INFO L280 TraceCheckUtils]: 15: Hoare triple {1094#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1094#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:43,557 INFO L280 TraceCheckUtils]: 16: Hoare triple {1094#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1095#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:43,558 INFO L280 TraceCheckUtils]: 17: Hoare triple {1095#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1095#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:43,558 INFO L280 TraceCheckUtils]: 18: Hoare triple {1095#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1095#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:43,559 INFO L280 TraceCheckUtils]: 19: Hoare triple {1095#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1096#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:43,559 INFO L280 TraceCheckUtils]: 20: Hoare triple {1096#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1096#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:43,560 INFO L280 TraceCheckUtils]: 21: Hoare triple {1096#(<= main_~i~0 6)} assume !(~i~0 < 10); {1088#false} is VALID [2020-07-10 15:27:43,560 INFO L280 TraceCheckUtils]: 22: Hoare triple {1088#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1088#false} is VALID [2020-07-10 15:27:43,560 INFO L280 TraceCheckUtils]: 23: Hoare triple {1088#false} assume !(~i~0 <= ~n~0); {1088#false} is VALID [2020-07-10 15:27:43,560 INFO L263 TraceCheckUtils]: 24: Hoare triple {1088#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1088#false} is VALID [2020-07-10 15:27:43,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2020-07-10 15:27:43,560 INFO L280 TraceCheckUtils]: 26: Hoare triple {1088#false} assume 0 == ~cond; {1088#false} is VALID [2020-07-10 15:27:43,561 INFO L280 TraceCheckUtils]: 27: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2020-07-10 15:27:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:43,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:43,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-10 15:27:43,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515671229] [2020-07-10 15:27:43,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-10 15:27:43,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:43,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:27:43,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:43,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:27:43,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:43,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:27:43,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:27:43,599 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2020-07-10 15:27:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:43,728 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-10 15:27:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:27:43,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-10 15:27:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2020-07-10 15:27:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2020-07-10 15:27:43,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2020-07-10 15:27:43,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:43,777 INFO L225 Difference]: With dead ends: 42 [2020-07-10 15:27:43,777 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 15:27:43,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:27:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 15:27:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-10 15:27:43,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:43,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-10 15:27:43,798 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-10 15:27:43,798 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-10 15:27:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:43,800 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-10 15:27:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-10 15:27:43,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:43,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:43,801 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-10 15:27:43,801 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-10 15:27:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:43,808 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-10 15:27:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-10 15:27:43,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:43,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:43,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:43,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:27:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-07-10 15:27:43,811 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2020-07-10 15:27:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:43,811 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-07-10 15:27:43,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:27:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-10 15:27:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:27:43,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:43,817 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:44,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 15:27:44,018 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:44,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash 98169237, now seen corresponding path program 4 times [2020-07-10 15:27:44,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:44,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222817004] [2020-07-10 15:27:44,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:44,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {1354#true} assume true; {1354#true} is VALID [2020-07-10 15:27:44,177 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1354#true} {1354#true} #37#return; {1354#true} is VALID [2020-07-10 15:27:44,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2020-07-10 15:27:44,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {1354#true} assume true; {1354#true} is VALID [2020-07-10 15:27:44,178 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1354#true} {1354#true} #37#return; {1354#true} is VALID [2020-07-10 15:27:44,179 INFO L263 TraceCheckUtils]: 3: Hoare triple {1354#true} call #t~ret2 := main(); {1354#true} is VALID [2020-07-10 15:27:44,180 INFO L280 TraceCheckUtils]: 4: Hoare triple {1354#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; {1358#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:44,182 INFO L280 TraceCheckUtils]: 5: Hoare triple {1358#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1358#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:44,182 INFO L280 TraceCheckUtils]: 6: Hoare triple {1358#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1358#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:44,183 INFO L280 TraceCheckUtils]: 7: Hoare triple {1358#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1359#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:44,184 INFO L280 TraceCheckUtils]: 8: Hoare triple {1359#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1359#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:44,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {1359#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1359#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:44,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {1359#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1360#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:44,195 INFO L280 TraceCheckUtils]: 11: Hoare triple {1360#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1360#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:44,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {1360#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1360#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:44,200 INFO L280 TraceCheckUtils]: 13: Hoare triple {1360#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1361#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:44,201 INFO L280 TraceCheckUtils]: 14: Hoare triple {1361#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1361#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:44,202 INFO L280 TraceCheckUtils]: 15: Hoare triple {1361#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1361#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:44,203 INFO L280 TraceCheckUtils]: 16: Hoare triple {1361#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1362#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:44,204 INFO L280 TraceCheckUtils]: 17: Hoare triple {1362#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1362#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:44,204 INFO L280 TraceCheckUtils]: 18: Hoare triple {1362#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1362#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:44,206 INFO L280 TraceCheckUtils]: 19: Hoare triple {1362#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1363#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:44,206 INFO L280 TraceCheckUtils]: 20: Hoare triple {1363#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1363#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:44,207 INFO L280 TraceCheckUtils]: 21: Hoare triple {1363#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1363#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:44,208 INFO L280 TraceCheckUtils]: 22: Hoare triple {1363#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1364#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:44,209 INFO L280 TraceCheckUtils]: 23: Hoare triple {1364#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1364#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:44,210 INFO L280 TraceCheckUtils]: 24: Hoare triple {1364#(<= main_~i~0 7)} assume !(~i~0 < 10); {1355#false} is VALID [2020-07-10 15:27:44,210 INFO L280 TraceCheckUtils]: 25: Hoare triple {1355#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1355#false} is VALID [2020-07-10 15:27:44,210 INFO L280 TraceCheckUtils]: 26: Hoare triple {1355#false} assume !(~i~0 <= ~n~0); {1355#false} is VALID [2020-07-10 15:27:44,211 INFO L263 TraceCheckUtils]: 27: Hoare triple {1355#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1355#false} is VALID [2020-07-10 15:27:44,211 INFO L280 TraceCheckUtils]: 28: Hoare triple {1355#false} ~cond := #in~cond; {1355#false} is VALID [2020-07-10 15:27:44,211 INFO L280 TraceCheckUtils]: 29: Hoare triple {1355#false} assume 0 == ~cond; {1355#false} is VALID [2020-07-10 15:27:44,212 INFO L280 TraceCheckUtils]: 30: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2020-07-10 15:27:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:44,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222817004] [2020-07-10 15:27:44,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191301689] [2020-07-10 15:27:44,220 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:44,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:27:44,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:44,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:27:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:44,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:44,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2020-07-10 15:27:44,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {1354#true} assume true; {1354#true} is VALID [2020-07-10 15:27:44,387 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1354#true} {1354#true} #37#return; {1354#true} is VALID [2020-07-10 15:27:44,387 INFO L263 TraceCheckUtils]: 3: Hoare triple {1354#true} call #t~ret2 := main(); {1354#true} is VALID [2020-07-10 15:27:44,388 INFO L280 TraceCheckUtils]: 4: Hoare triple {1354#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; {1358#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:44,388 INFO L280 TraceCheckUtils]: 5: Hoare triple {1358#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1358#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:44,389 INFO L280 TraceCheckUtils]: 6: Hoare triple {1358#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1358#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:44,390 INFO L280 TraceCheckUtils]: 7: Hoare triple {1358#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1359#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:44,390 INFO L280 TraceCheckUtils]: 8: Hoare triple {1359#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1359#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:44,391 INFO L280 TraceCheckUtils]: 9: Hoare triple {1359#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1359#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:44,392 INFO L280 TraceCheckUtils]: 10: Hoare triple {1359#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1360#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:44,392 INFO L280 TraceCheckUtils]: 11: Hoare triple {1360#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1360#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:44,393 INFO L280 TraceCheckUtils]: 12: Hoare triple {1360#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1360#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:44,393 INFO L280 TraceCheckUtils]: 13: Hoare triple {1360#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1361#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:44,394 INFO L280 TraceCheckUtils]: 14: Hoare triple {1361#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1361#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:44,395 INFO L280 TraceCheckUtils]: 15: Hoare triple {1361#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1361#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:44,395 INFO L280 TraceCheckUtils]: 16: Hoare triple {1361#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1362#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:44,396 INFO L280 TraceCheckUtils]: 17: Hoare triple {1362#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1362#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:44,396 INFO L280 TraceCheckUtils]: 18: Hoare triple {1362#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1362#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:44,397 INFO L280 TraceCheckUtils]: 19: Hoare triple {1362#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1363#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:44,398 INFO L280 TraceCheckUtils]: 20: Hoare triple {1363#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1363#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:44,398 INFO L280 TraceCheckUtils]: 21: Hoare triple {1363#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1363#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:44,399 INFO L280 TraceCheckUtils]: 22: Hoare triple {1363#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1364#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:44,400 INFO L280 TraceCheckUtils]: 23: Hoare triple {1364#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1364#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:44,401 INFO L280 TraceCheckUtils]: 24: Hoare triple {1364#(<= main_~i~0 7)} assume !(~i~0 < 10); {1355#false} is VALID [2020-07-10 15:27:44,401 INFO L280 TraceCheckUtils]: 25: Hoare triple {1355#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1355#false} is VALID [2020-07-10 15:27:44,401 INFO L280 TraceCheckUtils]: 26: Hoare triple {1355#false} assume !(~i~0 <= ~n~0); {1355#false} is VALID [2020-07-10 15:27:44,401 INFO L263 TraceCheckUtils]: 27: Hoare triple {1355#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1355#false} is VALID [2020-07-10 15:27:44,402 INFO L280 TraceCheckUtils]: 28: Hoare triple {1355#false} ~cond := #in~cond; {1355#false} is VALID [2020-07-10 15:27:44,402 INFO L280 TraceCheckUtils]: 29: Hoare triple {1355#false} assume 0 == ~cond; {1355#false} is VALID [2020-07-10 15:27:44,402 INFO L280 TraceCheckUtils]: 30: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2020-07-10 15:27:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:44,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:44,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-07-10 15:27:44,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341682837] [2020-07-10 15:27:44,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-10 15:27:44,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:44,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:27:44,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:44,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:27:44,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:27:44,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:27:44,443 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 9 states. [2020-07-10 15:27:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:44,571 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-10 15:27:44,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:27:44,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-10 15:27:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2020-07-10 15:27:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2020-07-10 15:27:44,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2020-07-10 15:27:44,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:44,640 INFO L225 Difference]: With dead ends: 45 [2020-07-10 15:27:44,640 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:27:44,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:27:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:27:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-07-10 15:27:44,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:44,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2020-07-10 15:27:44,669 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2020-07-10 15:27:44,670 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2020-07-10 15:27:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:44,671 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 15:27:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 15:27:44,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:44,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:44,672 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2020-07-10 15:27:44,672 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2020-07-10 15:27:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:44,674 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 15:27:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 15:27:44,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:44,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:44,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:44,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:27:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-10 15:27:44,677 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2020-07-10 15:27:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:44,677 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-10 15:27:44,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:27:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-10 15:27:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:27:44,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:44,678 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:44,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:44,890 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:44,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:44,891 INFO L82 PathProgramCache]: Analyzing trace with hash 144867641, now seen corresponding path program 5 times [2020-07-10 15:27:44,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:44,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266423461] [2020-07-10 15:27:44,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {1645#true} assume true; {1645#true} is VALID [2020-07-10 15:27:45,042 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1645#true} {1645#true} #37#return; {1645#true} is VALID [2020-07-10 15:27:45,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {1645#true} call ULTIMATE.init(); {1645#true} is VALID [2020-07-10 15:27:45,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {1645#true} assume true; {1645#true} is VALID [2020-07-10 15:27:45,043 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1645#true} {1645#true} #37#return; {1645#true} is VALID [2020-07-10 15:27:45,043 INFO L263 TraceCheckUtils]: 3: Hoare triple {1645#true} call #t~ret2 := main(); {1645#true} is VALID [2020-07-10 15:27:45,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {1645#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; {1649#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {1649#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1649#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,044 INFO L280 TraceCheckUtils]: 6: Hoare triple {1649#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1649#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {1649#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1650#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {1650#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1650#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,045 INFO L280 TraceCheckUtils]: 9: Hoare triple {1650#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1650#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {1650#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1651#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,046 INFO L280 TraceCheckUtils]: 11: Hoare triple {1651#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1651#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,047 INFO L280 TraceCheckUtils]: 12: Hoare triple {1651#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1651#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,047 INFO L280 TraceCheckUtils]: 13: Hoare triple {1651#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1652#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:45,048 INFO L280 TraceCheckUtils]: 14: Hoare triple {1652#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1652#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:45,048 INFO L280 TraceCheckUtils]: 15: Hoare triple {1652#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1652#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:45,050 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1653#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:45,050 INFO L280 TraceCheckUtils]: 17: Hoare triple {1653#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1653#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:45,051 INFO L280 TraceCheckUtils]: 18: Hoare triple {1653#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1653#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:45,051 INFO L280 TraceCheckUtils]: 19: Hoare triple {1653#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1654#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:45,052 INFO L280 TraceCheckUtils]: 20: Hoare triple {1654#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1654#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:45,052 INFO L280 TraceCheckUtils]: 21: Hoare triple {1654#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1654#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:45,052 INFO L280 TraceCheckUtils]: 22: Hoare triple {1654#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1655#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:45,053 INFO L280 TraceCheckUtils]: 23: Hoare triple {1655#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1655#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:45,053 INFO L280 TraceCheckUtils]: 24: Hoare triple {1655#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1655#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:45,054 INFO L280 TraceCheckUtils]: 25: Hoare triple {1655#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1656#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:45,054 INFO L280 TraceCheckUtils]: 26: Hoare triple {1656#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1656#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:45,055 INFO L280 TraceCheckUtils]: 27: Hoare triple {1656#(<= main_~i~0 8)} assume !(~i~0 < 10); {1646#false} is VALID [2020-07-10 15:27:45,055 INFO L280 TraceCheckUtils]: 28: Hoare triple {1646#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1646#false} is VALID [2020-07-10 15:27:45,055 INFO L280 TraceCheckUtils]: 29: Hoare triple {1646#false} assume !(~i~0 <= ~n~0); {1646#false} is VALID [2020-07-10 15:27:45,056 INFO L263 TraceCheckUtils]: 30: Hoare triple {1646#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1646#false} is VALID [2020-07-10 15:27:45,056 INFO L280 TraceCheckUtils]: 31: Hoare triple {1646#false} ~cond := #in~cond; {1646#false} is VALID [2020-07-10 15:27:45,056 INFO L280 TraceCheckUtils]: 32: Hoare triple {1646#false} assume 0 == ~cond; {1646#false} is VALID [2020-07-10 15:27:45,056 INFO L280 TraceCheckUtils]: 33: Hoare triple {1646#false} assume !false; {1646#false} is VALID [2020-07-10 15:27:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:45,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266423461] [2020-07-10 15:27:45,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698193191] [2020-07-10 15:27:45,059 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:45,094 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2020-07-10 15:27:45,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:45,095 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:27:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:45,191 INFO L263 TraceCheckUtils]: 0: Hoare triple {1645#true} call ULTIMATE.init(); {1645#true} is VALID [2020-07-10 15:27:45,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {1645#true} assume true; {1645#true} is VALID [2020-07-10 15:27:45,192 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1645#true} {1645#true} #37#return; {1645#true} is VALID [2020-07-10 15:27:45,192 INFO L263 TraceCheckUtils]: 3: Hoare triple {1645#true} call #t~ret2 := main(); {1645#true} is VALID [2020-07-10 15:27:45,193 INFO L280 TraceCheckUtils]: 4: Hoare triple {1645#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; {1649#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,193 INFO L280 TraceCheckUtils]: 5: Hoare triple {1649#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1649#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,194 INFO L280 TraceCheckUtils]: 6: Hoare triple {1649#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1649#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,194 INFO L280 TraceCheckUtils]: 7: Hoare triple {1649#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1650#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {1650#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1650#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,195 INFO L280 TraceCheckUtils]: 9: Hoare triple {1650#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1650#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,196 INFO L280 TraceCheckUtils]: 10: Hoare triple {1650#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1651#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,197 INFO L280 TraceCheckUtils]: 11: Hoare triple {1651#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1651#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,197 INFO L280 TraceCheckUtils]: 12: Hoare triple {1651#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1651#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,198 INFO L280 TraceCheckUtils]: 13: Hoare triple {1651#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1652#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:45,199 INFO L280 TraceCheckUtils]: 14: Hoare triple {1652#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1652#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:45,199 INFO L280 TraceCheckUtils]: 15: Hoare triple {1652#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1652#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:45,199 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1653#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:45,200 INFO L280 TraceCheckUtils]: 17: Hoare triple {1653#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1653#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:45,200 INFO L280 TraceCheckUtils]: 18: Hoare triple {1653#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1653#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:45,201 INFO L280 TraceCheckUtils]: 19: Hoare triple {1653#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1654#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:45,202 INFO L280 TraceCheckUtils]: 20: Hoare triple {1654#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1654#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:45,202 INFO L280 TraceCheckUtils]: 21: Hoare triple {1654#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1654#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:45,202 INFO L280 TraceCheckUtils]: 22: Hoare triple {1654#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1655#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:45,203 INFO L280 TraceCheckUtils]: 23: Hoare triple {1655#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1655#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:45,204 INFO L280 TraceCheckUtils]: 24: Hoare triple {1655#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1655#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:45,204 INFO L280 TraceCheckUtils]: 25: Hoare triple {1655#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1656#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:45,205 INFO L280 TraceCheckUtils]: 26: Hoare triple {1656#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1656#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:45,205 INFO L280 TraceCheckUtils]: 27: Hoare triple {1656#(<= main_~i~0 8)} assume !(~i~0 < 10); {1646#false} is VALID [2020-07-10 15:27:45,206 INFO L280 TraceCheckUtils]: 28: Hoare triple {1646#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1646#false} is VALID [2020-07-10 15:27:45,206 INFO L280 TraceCheckUtils]: 29: Hoare triple {1646#false} assume !(~i~0 <= ~n~0); {1646#false} is VALID [2020-07-10 15:27:45,206 INFO L263 TraceCheckUtils]: 30: Hoare triple {1646#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1646#false} is VALID [2020-07-10 15:27:45,206 INFO L280 TraceCheckUtils]: 31: Hoare triple {1646#false} ~cond := #in~cond; {1646#false} is VALID [2020-07-10 15:27:45,206 INFO L280 TraceCheckUtils]: 32: Hoare triple {1646#false} assume 0 == ~cond; {1646#false} is VALID [2020-07-10 15:27:45,207 INFO L280 TraceCheckUtils]: 33: Hoare triple {1646#false} assume !false; {1646#false} is VALID [2020-07-10 15:27:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:45,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:45,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-07-10 15:27:45,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707124421] [2020-07-10 15:27:45,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2020-07-10 15:27:45,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:45,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:27:45,250 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-10 15:27:45,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:27:45,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:27:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:27:45,251 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2020-07-10 15:27:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:45,418 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-10 15:27:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:27:45,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2020-07-10 15:27:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-10 15:27:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-10 15:27:45,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2020-07-10 15:27:45,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:45,470 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:27:45,470 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 15:27:45,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:27:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 15:27:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-10 15:27:45,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:45,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-10 15:27:45,496 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-10 15:27:45,497 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-10 15:27:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:45,498 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 15:27:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-10 15:27:45,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:45,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:45,499 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-10 15:27:45,499 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-10 15:27:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:45,501 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 15:27:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-10 15:27:45,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:45,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:45,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:45,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:27:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-10 15:27:45,504 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2020-07-10 15:27:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:45,504 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-10 15:27:45,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:27:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-10 15:27:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:27:45,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:45,505 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:45,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:45,706 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash -232382699, now seen corresponding path program 6 times [2020-07-10 15:27:45,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:45,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588698863] [2020-07-10 15:27:45,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {1960#true} assume true; {1960#true} is VALID [2020-07-10 15:27:45,829 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1960#true} {1960#true} #37#return; {1960#true} is VALID [2020-07-10 15:27:45,829 INFO L263 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2020-07-10 15:27:45,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {1960#true} assume true; {1960#true} is VALID [2020-07-10 15:27:45,830 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1960#true} {1960#true} #37#return; {1960#true} is VALID [2020-07-10 15:27:45,830 INFO L263 TraceCheckUtils]: 3: Hoare triple {1960#true} call #t~ret2 := main(); {1960#true} is VALID [2020-07-10 15:27:45,831 INFO L280 TraceCheckUtils]: 4: Hoare triple {1960#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; {1964#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,832 INFO L280 TraceCheckUtils]: 5: Hoare triple {1964#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1964#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,832 INFO L280 TraceCheckUtils]: 6: Hoare triple {1964#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1964#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {1964#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1965#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {1965#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1965#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {1965#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1965#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {1965#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1966#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,841 INFO L280 TraceCheckUtils]: 11: Hoare triple {1966#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1966#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,841 INFO L280 TraceCheckUtils]: 12: Hoare triple {1966#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1966#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,842 INFO L280 TraceCheckUtils]: 13: Hoare triple {1966#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1967#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:45,843 INFO L280 TraceCheckUtils]: 14: Hoare triple {1967#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1967#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:45,843 INFO L280 TraceCheckUtils]: 15: Hoare triple {1967#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1967#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:45,844 INFO L280 TraceCheckUtils]: 16: Hoare triple {1967#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1968#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:45,844 INFO L280 TraceCheckUtils]: 17: Hoare triple {1968#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1968#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:45,845 INFO L280 TraceCheckUtils]: 18: Hoare triple {1968#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1968#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:45,845 INFO L280 TraceCheckUtils]: 19: Hoare triple {1968#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1969#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:45,846 INFO L280 TraceCheckUtils]: 20: Hoare triple {1969#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1969#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:45,847 INFO L280 TraceCheckUtils]: 21: Hoare triple {1969#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1969#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:45,847 INFO L280 TraceCheckUtils]: 22: Hoare triple {1969#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1970#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:45,848 INFO L280 TraceCheckUtils]: 23: Hoare triple {1970#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1970#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:45,848 INFO L280 TraceCheckUtils]: 24: Hoare triple {1970#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1970#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:45,849 INFO L280 TraceCheckUtils]: 25: Hoare triple {1970#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1971#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:45,850 INFO L280 TraceCheckUtils]: 26: Hoare triple {1971#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1971#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:45,850 INFO L280 TraceCheckUtils]: 27: Hoare triple {1971#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1971#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:45,851 INFO L280 TraceCheckUtils]: 28: Hoare triple {1971#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1972#(<= main_~i~0 9)} is VALID [2020-07-10 15:27:45,851 INFO L280 TraceCheckUtils]: 29: Hoare triple {1972#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {1972#(<= main_~i~0 9)} is VALID [2020-07-10 15:27:45,852 INFO L280 TraceCheckUtils]: 30: Hoare triple {1972#(<= main_~i~0 9)} assume !(~i~0 < 10); {1961#false} is VALID [2020-07-10 15:27:45,852 INFO L280 TraceCheckUtils]: 31: Hoare triple {1961#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1961#false} is VALID [2020-07-10 15:27:45,853 INFO L280 TraceCheckUtils]: 32: Hoare triple {1961#false} assume !(~i~0 <= ~n~0); {1961#false} is VALID [2020-07-10 15:27:45,853 INFO L263 TraceCheckUtils]: 33: Hoare triple {1961#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1961#false} is VALID [2020-07-10 15:27:45,853 INFO L280 TraceCheckUtils]: 34: Hoare triple {1961#false} ~cond := #in~cond; {1961#false} is VALID [2020-07-10 15:27:45,853 INFO L280 TraceCheckUtils]: 35: Hoare triple {1961#false} assume 0 == ~cond; {1961#false} is VALID [2020-07-10 15:27:45,853 INFO L280 TraceCheckUtils]: 36: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2020-07-10 15:27:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:45,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588698863] [2020-07-10 15:27:45,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916580145] [2020-07-10 15:27:45,856 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:45,885 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2020-07-10 15:27:45,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:45,886 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 15:27:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,894 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:45,990 INFO L263 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2020-07-10 15:27:45,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {1960#true} assume true; {1960#true} is VALID [2020-07-10 15:27:45,990 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1960#true} {1960#true} #37#return; {1960#true} is VALID [2020-07-10 15:27:45,990 INFO L263 TraceCheckUtils]: 3: Hoare triple {1960#true} call #t~ret2 := main(); {1960#true} is VALID [2020-07-10 15:27:45,991 INFO L280 TraceCheckUtils]: 4: Hoare triple {1960#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; {1964#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,991 INFO L280 TraceCheckUtils]: 5: Hoare triple {1964#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1964#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,992 INFO L280 TraceCheckUtils]: 6: Hoare triple {1964#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1964#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,994 INFO L280 TraceCheckUtils]: 7: Hoare triple {1964#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1965#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,994 INFO L280 TraceCheckUtils]: 8: Hoare triple {1965#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1965#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,995 INFO L280 TraceCheckUtils]: 9: Hoare triple {1965#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1965#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:45,995 INFO L280 TraceCheckUtils]: 10: Hoare triple {1965#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1966#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,996 INFO L280 TraceCheckUtils]: 11: Hoare triple {1966#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1966#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:45,997 INFO L280 TraceCheckUtils]: 12: Hoare triple {1966#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1966#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:46,000 INFO L280 TraceCheckUtils]: 13: Hoare triple {1966#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1967#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:46,000 INFO L280 TraceCheckUtils]: 14: Hoare triple {1967#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1967#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:46,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {1967#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1967#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:46,001 INFO L280 TraceCheckUtils]: 16: Hoare triple {1967#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1968#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:46,001 INFO L280 TraceCheckUtils]: 17: Hoare triple {1968#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1968#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:46,002 INFO L280 TraceCheckUtils]: 18: Hoare triple {1968#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1968#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:46,002 INFO L280 TraceCheckUtils]: 19: Hoare triple {1968#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1969#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:46,003 INFO L280 TraceCheckUtils]: 20: Hoare triple {1969#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1969#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:46,003 INFO L280 TraceCheckUtils]: 21: Hoare triple {1969#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1969#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:46,004 INFO L280 TraceCheckUtils]: 22: Hoare triple {1969#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1970#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:46,004 INFO L280 TraceCheckUtils]: 23: Hoare triple {1970#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1970#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:46,004 INFO L280 TraceCheckUtils]: 24: Hoare triple {1970#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1970#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:46,005 INFO L280 TraceCheckUtils]: 25: Hoare triple {1970#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1971#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:46,006 INFO L280 TraceCheckUtils]: 26: Hoare triple {1971#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1971#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:46,006 INFO L280 TraceCheckUtils]: 27: Hoare triple {1971#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1971#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:46,007 INFO L280 TraceCheckUtils]: 28: Hoare triple {1971#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1972#(<= main_~i~0 9)} is VALID [2020-07-10 15:27:46,007 INFO L280 TraceCheckUtils]: 29: Hoare triple {1972#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {1972#(<= main_~i~0 9)} is VALID [2020-07-10 15:27:46,007 INFO L280 TraceCheckUtils]: 30: Hoare triple {1972#(<= main_~i~0 9)} assume !(~i~0 < 10); {1961#false} is VALID [2020-07-10 15:27:46,008 INFO L280 TraceCheckUtils]: 31: Hoare triple {1961#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1961#false} is VALID [2020-07-10 15:27:46,008 INFO L280 TraceCheckUtils]: 32: Hoare triple {1961#false} assume !(~i~0 <= ~n~0); {1961#false} is VALID [2020-07-10 15:27:46,008 INFO L263 TraceCheckUtils]: 33: Hoare triple {1961#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1961#false} is VALID [2020-07-10 15:27:46,008 INFO L280 TraceCheckUtils]: 34: Hoare triple {1961#false} ~cond := #in~cond; {1961#false} is VALID [2020-07-10 15:27:46,009 INFO L280 TraceCheckUtils]: 35: Hoare triple {1961#false} assume 0 == ~cond; {1961#false} is VALID [2020-07-10 15:27:46,009 INFO L280 TraceCheckUtils]: 36: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2020-07-10 15:27:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:46,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:46,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-07-10 15:27:46,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254943880] [2020-07-10 15:27:46,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-10 15:27:46,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:46,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:46,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:46,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:46,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:46,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:46,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:46,057 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 11 states. [2020-07-10 15:27:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,197 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-10 15:27:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:27:46,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-10 15:27:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2020-07-10 15:27:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2020-07-10 15:27:46,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2020-07-10 15:27:46,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:46,253 INFO L225 Difference]: With dead ends: 51 [2020-07-10 15:27:46,253 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 15:27:46,254 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 15:27:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-10 15:27:46,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:46,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-10 15:27:46,291 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-10 15:27:46,291 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-10 15:27:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,293 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-10 15:27:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 15:27:46,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,294 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-10 15:27:46,294 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-10 15:27:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,296 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-10 15:27:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 15:27:46,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:46,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 15:27:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-10 15:27:46,299 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2020-07-10 15:27:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:46,299 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-10 15:27:46,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-10 15:27:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 15:27:46,300 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:46,300 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:46,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-10 15:27:46,507 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1032151993, now seen corresponding path program 7 times [2020-07-10 15:27:46,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:46,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355118029] [2020-07-10 15:27:46,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:46,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:46,576 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:46,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:27:46,606 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:46,606 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:46,606 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:46,606 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:46,606 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:46,607 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:46,607 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:46,607 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:46,607 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:46,607 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:46,607 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:46,607 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:46,607 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:46,608 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:46,608 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-10 15:27:46,608 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-10 15:27:46,608 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:27:46,608 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:27:46,608 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:46,608 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:46,609 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:27:46,609 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:46,609 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-10 15:27:46,609 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:46,609 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:46,609 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-10 15:27:46,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:46 BoogieIcfgContainer [2020-07-10 15:27:46,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:46,615 INFO L168 Benchmark]: Toolchain (without parser) took 10234.76 ms. Allocated memory was 143.1 MB in the beginning and 316.1 MB in the end (delta: 173.0 MB). Free memory was 100.7 MB in the beginning and 87.0 MB in the end (delta: 13.8 MB). Peak memory consumption was 186.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:46,615 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:46,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.35 ms. Allocated memory is still 143.1 MB. Free memory was 100.3 MB in the beginning and 90.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:46,617 INFO L168 Benchmark]: Boogie Preprocessor took 127.82 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 90.8 MB in the beginning and 178.9 MB in the end (delta: -88.1 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:46,617 INFO L168 Benchmark]: RCFGBuilder took 315.43 ms. Allocated memory is still 199.8 MB. Free memory was 178.9 MB in the beginning and 162.5 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:46,618 INFO L168 Benchmark]: TraceAbstraction took 9538.16 ms. Allocated memory was 199.8 MB in the beginning and 316.1 MB in the end (delta: 116.4 MB). Free memory was 162.5 MB in the beginning and 87.0 MB in the end (delta: 75.6 MB). Peak memory consumption was 191.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:46,620 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.35 ms. Allocated memory is still 143.1 MB. Free memory was 100.3 MB in the beginning and 90.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.82 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 90.8 MB in the beginning and 178.9 MB in the end (delta: -88.1 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 315.43 ms. Allocated memory is still 199.8 MB. Free memory was 178.9 MB in the beginning and 162.5 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9538.16 ms. Allocated memory was 199.8 MB in the beginning and 316.1 MB in the end (delta: 116.4 MB). Free memory was 162.5 MB in the beginning and 87.0 MB in the end (delta: 75.6 MB). Peak memory consumption was 191.9 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=10, n=0] [L13] COND TRUE i<=n VAL [i=1, n=0, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=2, n=10] [L13] i++ VAL [i=2, n=10, n=2] [L13] COND TRUE i<=n VAL [i=2, n=10, n=2] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=10, n=4] [L13] COND TRUE i<=n VAL [i=3, n=10, n=4] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=10, n=6] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=10, n=8] [L13] i++ VAL [i=5, n=8, n=10] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=12, n=10] [L13] i++ VAL [i=7, n=10, n=12] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=10, n=14] [L13] i++ VAL [i=8, n=14, n=10] [L13] COND TRUE i<=n VAL [i=8, n=14, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=16, n=10] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=10, n=18] [L13] i++ VAL [i=10, n=18, n=10] [L13] COND TRUE i<=n VAL [i=10, n=18, n=10] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=10, n=18] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [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: 9.4s, OverallIterations: 11, TraceHistogramMax: 10, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 114 SDtfs, 61 SDslu, 464 SDs, 0 SdLazy, 536 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 29688 SizeOfPredicates, 12 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 145/780 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...