/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:38:06,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:38:06,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:38:06,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:38:06,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:38:06,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:38:06,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:38:06,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:38:06,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:38:06,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:38:06,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:38:06,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:38:06,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:38:06,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:38:06,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:38:06,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:38:06,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:38:06,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:38:06,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:38:06,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:38:06,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:38:06,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:38:06,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:38:06,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:38:06,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:38:06,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:38:06,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:38:06,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:38:06,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:38:06,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:38:06,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:38:06,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:38:06,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:38:06,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:38:06,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:38:06,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:38:06,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:38:06,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:38:06,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:38:06,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:38:06,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:38:06,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 06:38:06,807 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:38:06,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:38:06,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:38:06,809 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:38:06,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:38:06,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:38:06,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:38:06,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:38:06,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:38:06,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:38:06,811 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:38:06,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:38:06,811 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:38:06,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:38:06,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:38:06,812 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:38:06,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:38:06,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:38:06,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:38:06,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:38:06,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:38:06,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:38:06,814 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 06:38:07,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:38:07,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:38:07,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:38:07,145 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:38:07,146 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:38:07,147 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2020-07-18 06:38:07,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aab097f3/734d1216ec6e421bbdf06f33ecabdfd3/FLAG8a4288fc4 [2020-07-18 06:38:07,638 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:38:07,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2020-07-18 06:38:07,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aab097f3/734d1216ec6e421bbdf06f33ecabdfd3/FLAG8a4288fc4 [2020-07-18 06:38:08,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aab097f3/734d1216ec6e421bbdf06f33ecabdfd3 [2020-07-18 06:38:08,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:38:08,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:38:08,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:38:08,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:38:08,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:38:08,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:38:08" (1/1) ... [2020-07-18 06:38:08,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fd6bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08, skipping insertion in model container [2020-07-18 06:38:08,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:38:08" (1/1) ... [2020-07-18 06:38:08,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:38:08,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:38:08,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:38:08,248 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:38:08,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:38:08,287 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:38:08,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08 WrapperNode [2020-07-18 06:38:08,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:38:08,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:38:08,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:38:08,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:38:08,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08" (1/1) ... [2020-07-18 06:38:08,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08" (1/1) ... [2020-07-18 06:38:08,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08" (1/1) ... [2020-07-18 06:38:08,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08" (1/1) ... [2020-07-18 06:38:08,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08" (1/1) ... [2020-07-18 06:38:08,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08" (1/1) ... [2020-07-18 06:38:08,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08" (1/1) ... [2020-07-18 06:38:08,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:38:08,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:38:08,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:38:08,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:38:08,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08" (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-18 06:38:08,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:38:08,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:38:08,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 06:38:08,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:38:08,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:38:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:38:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 06:38:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 06:38:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:38:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 06:38:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:38:08,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:38:08,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:38:08,926 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:38:08,926 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 06:38:08,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:38:08 BoogieIcfgContainer [2020-07-18 06:38:08,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:38:08,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:38:08,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:38:08,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:38:08,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:38:08" (1/3) ... [2020-07-18 06:38:08,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee2ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:38:08, skipping insertion in model container [2020-07-18 06:38:08,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:08" (2/3) ... [2020-07-18 06:38:08,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee2ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:38:08, skipping insertion in model container [2020-07-18 06:38:08,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:38:08" (3/3) ... [2020-07-18 06:38:08,939 INFO L109 eAbstractionObserver]: Analyzing ICFG large_const.i [2020-07-18 06:38:08,950 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:38:08,958 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:38:08,972 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:38:08,992 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:38:08,993 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:38:08,993 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:38:08,993 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:38:08,993 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:38:08,993 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:38:08,993 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:38:08,994 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:38:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-18 06:38:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 06:38:09,018 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:09,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:09,020 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:09,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash 288343897, now seen corresponding path program 1 times [2020-07-18 06:38:09,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:09,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1966016143] [2020-07-18 06:38:09,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:09,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-18 06:38:09,173 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {58#true} {58#true} #104#return; {58#true} is VALID [2020-07-18 06:38:09,175 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2020-07-18 06:38:09,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-18 06:38:09,176 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #104#return; {58#true} is VALID [2020-07-18 06:38:09,177 INFO L263 TraceCheckUtils]: 3: Hoare triple {58#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {58#true} is VALID [2020-07-18 06:38:09,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {58#true} ~argc := #in~argc; {58#true} is VALID [2020-07-18 06:38:09,179 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {58#true} is VALID [2020-07-18 06:38:09,180 INFO L280 TraceCheckUtils]: 6: Hoare triple {58#true} ~c1~0 := 4000; {58#true} is VALID [2020-07-18 06:38:09,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#true} ~c2~0 := 2000; {58#true} is VALID [2020-07-18 06:38:09,181 INFO L280 TraceCheckUtils]: 8: Hoare triple {58#true} ~c3~0 := 10000; {58#true} is VALID [2020-07-18 06:38:09,181 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#true} havoc ~n~0; {58#true} is VALID [2020-07-18 06:38:09,182 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#true} havoc ~v~0; {58#true} is VALID [2020-07-18 06:38:09,182 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#true} havoc ~i~0; {58#true} is VALID [2020-07-18 06:38:09,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#true} havoc ~k~0; {58#true} is VALID [2020-07-18 06:38:09,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#true} havoc ~j~0; {58#true} is VALID [2020-07-18 06:38:09,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {58#true} is VALID [2020-07-18 06:38:09,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#true} ~n~0 := #t~nondet0; {58#true} is VALID [2020-07-18 06:38:09,184 INFO L280 TraceCheckUtils]: 16: Hoare triple {58#true} havoc #t~nondet0; {58#true} is VALID [2020-07-18 06:38:09,185 INFO L280 TraceCheckUtils]: 17: Hoare triple {58#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {58#true} is VALID [2020-07-18 06:38:09,185 INFO L280 TraceCheckUtils]: 18: Hoare triple {58#true} ~k~0 := 0; {58#true} is VALID [2020-07-18 06:38:09,185 INFO L280 TraceCheckUtils]: 19: Hoare triple {58#true} ~i~0 := 0; {58#true} is VALID [2020-07-18 06:38:09,190 INFO L280 TraceCheckUtils]: 20: Hoare triple {58#true} assume !true; {59#false} is VALID [2020-07-18 06:38:09,191 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} ~j~0 := 0; {59#false} is VALID [2020-07-18 06:38:09,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume !!(~j~0 < ~n~0); {59#false} is VALID [2020-07-18 06:38:09,192 INFO L263 TraceCheckUtils]: 23: Hoare triple {59#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {59#false} is VALID [2020-07-18 06:38:09,193 INFO L280 TraceCheckUtils]: 24: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-18 06:38:09,194 INFO L280 TraceCheckUtils]: 25: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-18 06:38:09,194 INFO L280 TraceCheckUtils]: 26: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-18 06:38:09,202 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-18 06:38:09,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1966016143] [2020-07-18 06:38:09,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:09,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 06:38:09,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062116099] [2020-07-18 06:38:09,215 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2020-07-18 06:38:09,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:09,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 06:38:09,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:09,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 06:38:09,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:09,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 06:38:09,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 06:38:09,296 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-07-18 06:38:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:09,433 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2020-07-18 06:38:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 06:38:09,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2020-07-18 06:38:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:38:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2020-07-18 06:38:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:38:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2020-07-18 06:38:09,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2020-07-18 06:38:09,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:09,613 INFO L225 Difference]: With dead ends: 75 [2020-07-18 06:38:09,613 INFO L226 Difference]: Without dead ends: 48 [2020-07-18 06:38:09,617 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-18 06:38:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-18 06:38:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-18 06:38:09,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:09,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-18 06:38:09,685 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-18 06:38:09,686 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-18 06:38:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:09,692 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-18 06:38:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-18 06:38:09,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:09,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:09,694 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-18 06:38:09,694 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-18 06:38:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:09,701 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-18 06:38:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-18 06:38:09,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:09,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:09,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:09,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 06:38:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-07-18 06:38:09,709 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 27 [2020-07-18 06:38:09,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:09,721 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-07-18 06:38:09,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 06:38:09,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 51 transitions. [2020-07-18 06:38:09,785 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-18 06:38:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-18 06:38:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 06:38:09,787 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:09,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:09,787 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:38:09,788 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash 320540924, now seen corresponding path program 1 times [2020-07-18 06:38:09,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:09,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1895260566] [2020-07-18 06:38:09,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:09,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-18 06:38:09,894 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {406#true} {406#true} #104#return; {406#true} is VALID [2020-07-18 06:38:09,894 INFO L263 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {406#true} is VALID [2020-07-18 06:38:09,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-18 06:38:09,895 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #104#return; {406#true} is VALID [2020-07-18 06:38:09,895 INFO L263 TraceCheckUtils]: 3: Hoare triple {406#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {406#true} is VALID [2020-07-18 06:38:09,895 INFO L280 TraceCheckUtils]: 4: Hoare triple {406#true} ~argc := #in~argc; {406#true} is VALID [2020-07-18 06:38:09,896 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {406#true} is VALID [2020-07-18 06:38:09,896 INFO L280 TraceCheckUtils]: 6: Hoare triple {406#true} ~c1~0 := 4000; {406#true} is VALID [2020-07-18 06:38:09,896 INFO L280 TraceCheckUtils]: 7: Hoare triple {406#true} ~c2~0 := 2000; {406#true} is VALID [2020-07-18 06:38:09,897 INFO L280 TraceCheckUtils]: 8: Hoare triple {406#true} ~c3~0 := 10000; {406#true} is VALID [2020-07-18 06:38:09,897 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#true} havoc ~n~0; {406#true} is VALID [2020-07-18 06:38:09,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#true} havoc ~v~0; {406#true} is VALID [2020-07-18 06:38:09,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {406#true} havoc ~i~0; {406#true} is VALID [2020-07-18 06:38:09,898 INFO L280 TraceCheckUtils]: 12: Hoare triple {406#true} havoc ~k~0; {406#true} is VALID [2020-07-18 06:38:09,898 INFO L280 TraceCheckUtils]: 13: Hoare triple {406#true} havoc ~j~0; {406#true} is VALID [2020-07-18 06:38:09,898 INFO L280 TraceCheckUtils]: 14: Hoare triple {406#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {406#true} is VALID [2020-07-18 06:38:09,899 INFO L280 TraceCheckUtils]: 15: Hoare triple {406#true} ~n~0 := #t~nondet0; {406#true} is VALID [2020-07-18 06:38:09,899 INFO L280 TraceCheckUtils]: 16: Hoare triple {406#true} havoc #t~nondet0; {406#true} is VALID [2020-07-18 06:38:09,899 INFO L280 TraceCheckUtils]: 17: Hoare triple {406#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {406#true} is VALID [2020-07-18 06:38:09,900 INFO L280 TraceCheckUtils]: 18: Hoare triple {406#true} ~k~0 := 0; {406#true} is VALID [2020-07-18 06:38:09,901 INFO L280 TraceCheckUtils]: 19: Hoare triple {406#true} ~i~0 := 0; {410#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:09,902 INFO L280 TraceCheckUtils]: 20: Hoare triple {410#(<= main_~i~0 0)} assume !(~i~0 < ~n~0); {411#(<= main_~n~0 0)} is VALID [2020-07-18 06:38:09,903 INFO L280 TraceCheckUtils]: 21: Hoare triple {411#(<= main_~n~0 0)} ~j~0 := 0; {412#(<= main_~n~0 main_~j~0)} is VALID [2020-07-18 06:38:09,903 INFO L280 TraceCheckUtils]: 22: Hoare triple {412#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {407#false} is VALID [2020-07-18 06:38:09,904 INFO L263 TraceCheckUtils]: 23: Hoare triple {407#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {407#false} is VALID [2020-07-18 06:38:09,904 INFO L280 TraceCheckUtils]: 24: Hoare triple {407#false} ~cond := #in~cond; {407#false} is VALID [2020-07-18 06:38:09,904 INFO L280 TraceCheckUtils]: 25: Hoare triple {407#false} assume 0 == ~cond; {407#false} is VALID [2020-07-18 06:38:09,905 INFO L280 TraceCheckUtils]: 26: Hoare triple {407#false} assume !false; {407#false} is VALID [2020-07-18 06:38:09,906 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-18 06:38:09,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1895260566] [2020-07-18 06:38:09,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:09,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:38:09,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442107583] [2020-07-18 06:38:09,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 06:38:09,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:09,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:38:09,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:09,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:38:09,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:09,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:38:09,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:38:09,943 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2020-07-18 06:38:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:10,196 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-18 06:38:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 06:38:10,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 06:38:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-18 06:38:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-18 06:38:10,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2020-07-18 06:38:10,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:10,290 INFO L225 Difference]: With dead ends: 67 [2020-07-18 06:38:10,291 INFO L226 Difference]: Without dead ends: 51 [2020-07-18 06:38:10,292 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:38:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-18 06:38:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-07-18 06:38:10,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:10,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2020-07-18 06:38:10,325 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2020-07-18 06:38:10,325 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2020-07-18 06:38:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:10,329 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-18 06:38:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-18 06:38:10,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:10,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:10,330 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2020-07-18 06:38:10,331 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2020-07-18 06:38:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:10,334 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-18 06:38:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-18 06:38:10,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:10,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:10,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:10,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-18 06:38:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2020-07-18 06:38:10,339 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2020-07-18 06:38:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:10,340 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2020-07-18 06:38:10,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:38:10,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 52 transitions. [2020-07-18 06:38:10,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-18 06:38:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 06:38:10,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:10,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:10,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:38:10,399 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash 751787059, now seen corresponding path program 1 times [2020-07-18 06:38:10,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:10,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [646158559] [2020-07-18 06:38:10,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:10,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {753#true} assume true; {753#true} is VALID [2020-07-18 06:38:10,551 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {753#true} {753#true} #104#return; {753#true} is VALID [2020-07-18 06:38:10,552 INFO L263 TraceCheckUtils]: 0: Hoare triple {753#true} call ULTIMATE.init(); {753#true} is VALID [2020-07-18 06:38:10,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {753#true} assume true; {753#true} is VALID [2020-07-18 06:38:10,553 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {753#true} {753#true} #104#return; {753#true} is VALID [2020-07-18 06:38:10,553 INFO L263 TraceCheckUtils]: 3: Hoare triple {753#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {753#true} is VALID [2020-07-18 06:38:10,553 INFO L280 TraceCheckUtils]: 4: Hoare triple {753#true} ~argc := #in~argc; {753#true} is VALID [2020-07-18 06:38:10,554 INFO L280 TraceCheckUtils]: 5: Hoare triple {753#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {753#true} is VALID [2020-07-18 06:38:10,555 INFO L280 TraceCheckUtils]: 6: Hoare triple {753#true} ~c1~0 := 4000; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,555 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#(<= 4000 main_~c1~0)} ~c2~0 := 2000; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {757#(<= 4000 main_~c1~0)} ~c3~0 := 10000; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~n~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~v~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,558 INFO L280 TraceCheckUtils]: 11: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~i~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,559 INFO L280 TraceCheckUtils]: 12: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~k~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,560 INFO L280 TraceCheckUtils]: 13: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~j~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,561 INFO L280 TraceCheckUtils]: 14: Hoare triple {757#(<= 4000 main_~c1~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,561 INFO L280 TraceCheckUtils]: 15: Hoare triple {757#(<= 4000 main_~c1~0)} ~n~0 := #t~nondet0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,562 INFO L280 TraceCheckUtils]: 16: Hoare triple {757#(<= 4000 main_~c1~0)} havoc #t~nondet0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,563 INFO L280 TraceCheckUtils]: 17: Hoare triple {757#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10); {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:10,564 INFO L280 TraceCheckUtils]: 18: Hoare triple {757#(<= 4000 main_~c1~0)} ~k~0 := 0; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,565 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} ~i~0 := 0; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,566 INFO L280 TraceCheckUtils]: 20: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(~i~0 < ~n~0); {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,566 INFO L280 TraceCheckUtils]: 21: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} #t~post1 := ~i~0; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,567 INFO L280 TraceCheckUtils]: 22: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} ~i~0 := 1 + #t~post1; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,568 INFO L280 TraceCheckUtils]: 23: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} havoc #t~post1; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,569 INFO L280 TraceCheckUtils]: 24: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,570 INFO L280 TraceCheckUtils]: 25: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} ~v~0 := #t~nondet2; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,571 INFO L280 TraceCheckUtils]: 26: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} havoc #t~nondet2; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,572 INFO L280 TraceCheckUtils]: 27: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,572 INFO L280 TraceCheckUtils]: 28: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} assume 0 == ~v~0; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:10,574 INFO L280 TraceCheckUtils]: 29: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} ~k~0 := ~k~0 + ~c1~0; {759#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:10,574 INFO L280 TraceCheckUtils]: 30: Hoare triple {759#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {759#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:10,575 INFO L280 TraceCheckUtils]: 31: Hoare triple {759#(<= 4000 main_~k~0)} ~j~0 := 0; {759#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:10,576 INFO L280 TraceCheckUtils]: 32: Hoare triple {759#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {759#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:10,577 INFO L263 TraceCheckUtils]: 33: Hoare triple {759#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {760#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:10,578 INFO L280 TraceCheckUtils]: 34: Hoare triple {760#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {761#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:10,579 INFO L280 TraceCheckUtils]: 35: Hoare triple {761#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {754#false} is VALID [2020-07-18 06:38:10,579 INFO L280 TraceCheckUtils]: 36: Hoare triple {754#false} assume !false; {754#false} is VALID [2020-07-18 06:38:10,584 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-18 06:38:10,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [646158559] [2020-07-18 06:38:10,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:10,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 06:38:10,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630366742] [2020-07-18 06:38:10,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-18 06:38:10,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:10,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 06:38:10,640 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-18 06:38:10,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 06:38:10,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:10,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 06:38:10,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:38:10,641 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 7 states. [2020-07-18 06:38:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:11,116 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2020-07-18 06:38:11,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 06:38:11,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-18 06:38:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 06:38:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 06:38:11,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2020-07-18 06:38:11,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:11,243 INFO L225 Difference]: With dead ends: 88 [2020-07-18 06:38:11,243 INFO L226 Difference]: Without dead ends: 86 [2020-07-18 06:38:11,244 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-18 06:38:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-18 06:38:11,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2020-07-18 06:38:11,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:11,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 66 states. [2020-07-18 06:38:11,351 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 66 states. [2020-07-18 06:38:11,351 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 66 states. [2020-07-18 06:38:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:11,355 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2020-07-18 06:38:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-07-18 06:38:11,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:11,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:11,356 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 86 states. [2020-07-18 06:38:11,357 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 86 states. [2020-07-18 06:38:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:11,361 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2020-07-18 06:38:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-07-18 06:38:11,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:11,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:11,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:11,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-18 06:38:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-07-18 06:38:11,366 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 37 [2020-07-18 06:38:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:11,366 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-07-18 06:38:11,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 06:38:11,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 71 transitions. [2020-07-18 06:38:11,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-07-18 06:38:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 06:38:11,450 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:11,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:11,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:38:11,450 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:11,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:11,451 INFO L82 PathProgramCache]: Analyzing trace with hash 3796503, now seen corresponding path program 1 times [2020-07-18 06:38:11,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:11,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711412087] [2020-07-18 06:38:11,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:11,555 INFO L280 TraceCheckUtils]: 0: Hoare triple {1250#true} assume true; {1250#true} is VALID [2020-07-18 06:38:11,555 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1250#true} {1250#true} #104#return; {1250#true} is VALID [2020-07-18 06:38:11,556 INFO L263 TraceCheckUtils]: 0: Hoare triple {1250#true} call ULTIMATE.init(); {1250#true} is VALID [2020-07-18 06:38:11,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {1250#true} assume true; {1250#true} is VALID [2020-07-18 06:38:11,556 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1250#true} {1250#true} #104#return; {1250#true} is VALID [2020-07-18 06:38:11,557 INFO L263 TraceCheckUtils]: 3: Hoare triple {1250#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {1250#true} is VALID [2020-07-18 06:38:11,557 INFO L280 TraceCheckUtils]: 4: Hoare triple {1250#true} ~argc := #in~argc; {1250#true} is VALID [2020-07-18 06:38:11,557 INFO L280 TraceCheckUtils]: 5: Hoare triple {1250#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {1250#true} is VALID [2020-07-18 06:38:11,557 INFO L280 TraceCheckUtils]: 6: Hoare triple {1250#true} ~c1~0 := 4000; {1250#true} is VALID [2020-07-18 06:38:11,558 INFO L280 TraceCheckUtils]: 7: Hoare triple {1250#true} ~c2~0 := 2000; {1250#true} is VALID [2020-07-18 06:38:11,559 INFO L280 TraceCheckUtils]: 8: Hoare triple {1250#true} ~c3~0 := 10000; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,559 INFO L280 TraceCheckUtils]: 9: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~n~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,560 INFO L280 TraceCheckUtils]: 10: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~v~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,560 INFO L280 TraceCheckUtils]: 11: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~i~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,561 INFO L280 TraceCheckUtils]: 12: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~k~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~j~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,562 INFO L280 TraceCheckUtils]: 14: Hoare triple {1254#(<= 10000 main_~c3~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,563 INFO L280 TraceCheckUtils]: 15: Hoare triple {1254#(<= 10000 main_~c3~0)} ~n~0 := #t~nondet0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,563 INFO L280 TraceCheckUtils]: 16: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc #t~nondet0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,564 INFO L280 TraceCheckUtils]: 17: Hoare triple {1254#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10); {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:11,565 INFO L280 TraceCheckUtils]: 18: Hoare triple {1254#(<= 10000 main_~c3~0)} ~k~0 := 0; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,565 INFO L280 TraceCheckUtils]: 19: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} ~i~0 := 0; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,566 INFO L280 TraceCheckUtils]: 20: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(~i~0 < ~n~0); {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,566 INFO L280 TraceCheckUtils]: 21: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} #t~post1 := ~i~0; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,567 INFO L280 TraceCheckUtils]: 22: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} ~i~0 := 1 + #t~post1; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,572 INFO L280 TraceCheckUtils]: 23: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} havoc #t~post1; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,573 INFO L280 TraceCheckUtils]: 24: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,574 INFO L280 TraceCheckUtils]: 25: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} ~v~0 := #t~nondet2; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,574 INFO L280 TraceCheckUtils]: 26: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} havoc #t~nondet2; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,575 INFO L280 TraceCheckUtils]: 27: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,576 INFO L280 TraceCheckUtils]: 28: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(0 == ~v~0); {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,576 INFO L280 TraceCheckUtils]: 29: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(1 == ~v~0); {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:11,577 INFO L280 TraceCheckUtils]: 30: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} ~k~0 := ~k~0 + ~c3~0; {1256#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:11,578 INFO L280 TraceCheckUtils]: 31: Hoare triple {1256#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {1256#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:11,579 INFO L280 TraceCheckUtils]: 32: Hoare triple {1256#(<= 10000 main_~k~0)} ~j~0 := 0; {1256#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:11,579 INFO L280 TraceCheckUtils]: 33: Hoare triple {1256#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {1256#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:11,580 INFO L263 TraceCheckUtils]: 34: Hoare triple {1256#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1257#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:11,581 INFO L280 TraceCheckUtils]: 35: Hoare triple {1257#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1258#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:11,582 INFO L280 TraceCheckUtils]: 36: Hoare triple {1258#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1251#false} is VALID [2020-07-18 06:38:11,582 INFO L280 TraceCheckUtils]: 37: Hoare triple {1251#false} assume !false; {1251#false} is VALID [2020-07-18 06:38:11,585 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-18 06:38:11,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711412087] [2020-07-18 06:38:11,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:11,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 06:38:11,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227359175] [2020-07-18 06:38:11,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 06:38:11,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:11,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 06:38:11,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:11,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 06:38:11,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:11,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 06:38:11,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:38:11,632 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 7 states. [2020-07-18 06:38:12,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:12,280 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2020-07-18 06:38:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 06:38:12,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 06:38:12,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 06:38:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 06:38:12,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2020-07-18 06:38:12,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:12,400 INFO L225 Difference]: With dead ends: 105 [2020-07-18 06:38:12,400 INFO L226 Difference]: Without dead ends: 103 [2020-07-18 06:38:12,401 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-18 06:38:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-18 06:38:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2020-07-18 06:38:12,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:12,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 85 states. [2020-07-18 06:38:12,551 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 85 states. [2020-07-18 06:38:12,551 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 85 states. [2020-07-18 06:38:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:12,556 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-07-18 06:38:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-07-18 06:38:12,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:12,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:12,558 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 103 states. [2020-07-18 06:38:12,558 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 103 states. [2020-07-18 06:38:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:12,562 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-07-18 06:38:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-07-18 06:38:12,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:12,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:12,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:12,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-18 06:38:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-18 06:38:12,568 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 38 [2020-07-18 06:38:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:12,568 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-18 06:38:12,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 06:38:12,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-18 06:38:12,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-18 06:38:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 06:38:12,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:12,679 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:12,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 06:38:12,679 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash 197728887, now seen corresponding path program 1 times [2020-07-18 06:38:12,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:12,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [84611295] [2020-07-18 06:38:12,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:12,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-18 06:38:12,806 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1853#true} {1853#true} #104#return; {1853#true} is VALID [2020-07-18 06:38:12,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {1853#true} call ULTIMATE.init(); {1853#true} is VALID [2020-07-18 06:38:12,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-18 06:38:12,807 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1853#true} {1853#true} #104#return; {1853#true} is VALID [2020-07-18 06:38:12,808 INFO L263 TraceCheckUtils]: 3: Hoare triple {1853#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {1853#true} is VALID [2020-07-18 06:38:12,808 INFO L280 TraceCheckUtils]: 4: Hoare triple {1853#true} ~argc := #in~argc; {1853#true} is VALID [2020-07-18 06:38:12,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {1853#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {1853#true} is VALID [2020-07-18 06:38:12,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {1853#true} ~c1~0 := 4000; {1853#true} is VALID [2020-07-18 06:38:12,809 INFO L280 TraceCheckUtils]: 7: Hoare triple {1853#true} ~c2~0 := 2000; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,810 INFO L280 TraceCheckUtils]: 8: Hoare triple {1857#(<= 2000 main_~c2~0)} ~c3~0 := 10000; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,810 INFO L280 TraceCheckUtils]: 9: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~n~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,811 INFO L280 TraceCheckUtils]: 10: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~v~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,812 INFO L280 TraceCheckUtils]: 11: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~i~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,812 INFO L280 TraceCheckUtils]: 12: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~k~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,813 INFO L280 TraceCheckUtils]: 13: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~j~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {1857#(<= 2000 main_~c2~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,814 INFO L280 TraceCheckUtils]: 15: Hoare triple {1857#(<= 2000 main_~c2~0)} ~n~0 := #t~nondet0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,814 INFO L280 TraceCheckUtils]: 16: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc #t~nondet0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,815 INFO L280 TraceCheckUtils]: 17: Hoare triple {1857#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10); {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:12,816 INFO L280 TraceCheckUtils]: 18: Hoare triple {1857#(<= 2000 main_~c2~0)} ~k~0 := 0; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,816 INFO L280 TraceCheckUtils]: 19: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} ~i~0 := 0; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,817 INFO L280 TraceCheckUtils]: 20: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(~i~0 < ~n~0); {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,818 INFO L280 TraceCheckUtils]: 21: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} #t~post1 := ~i~0; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,818 INFO L280 TraceCheckUtils]: 22: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} ~i~0 := 1 + #t~post1; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,821 INFO L280 TraceCheckUtils]: 23: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} havoc #t~post1; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,822 INFO L280 TraceCheckUtils]: 24: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,823 INFO L280 TraceCheckUtils]: 25: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} ~v~0 := #t~nondet2; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,823 INFO L280 TraceCheckUtils]: 26: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} havoc #t~nondet2; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,824 INFO L280 TraceCheckUtils]: 27: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,824 INFO L280 TraceCheckUtils]: 28: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !(0 == ~v~0); {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,825 INFO L280 TraceCheckUtils]: 29: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume 1 == ~v~0; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:12,826 INFO L280 TraceCheckUtils]: 30: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} ~k~0 := ~k~0 + ~c2~0; {1859#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:12,827 INFO L280 TraceCheckUtils]: 31: Hoare triple {1859#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {1859#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:12,827 INFO L280 TraceCheckUtils]: 32: Hoare triple {1859#(<= 2000 main_~k~0)} ~j~0 := 0; {1859#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:12,828 INFO L280 TraceCheckUtils]: 33: Hoare triple {1859#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {1859#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:12,829 INFO L263 TraceCheckUtils]: 34: Hoare triple {1859#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1860#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:12,830 INFO L280 TraceCheckUtils]: 35: Hoare triple {1860#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1861#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:12,830 INFO L280 TraceCheckUtils]: 36: Hoare triple {1861#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1854#false} is VALID [2020-07-18 06:38:12,830 INFO L280 TraceCheckUtils]: 37: Hoare triple {1854#false} assume !false; {1854#false} is VALID [2020-07-18 06:38:12,832 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-18 06:38:12,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [84611295] [2020-07-18 06:38:12,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:12,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 06:38:12,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588498227] [2020-07-18 06:38:12,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 06:38:12,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:12,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 06:38:12,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:12,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 06:38:12,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:12,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 06:38:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:38:12,879 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2020-07-18 06:38:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:13,534 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2020-07-18 06:38:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 06:38:13,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 06:38:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 06:38:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 06:38:13,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2020-07-18 06:38:13,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:13,640 INFO L225 Difference]: With dead ends: 116 [2020-07-18 06:38:13,640 INFO L226 Difference]: Without dead ends: 114 [2020-07-18 06:38:13,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-18 06:38:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-18 06:38:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2020-07-18 06:38:13,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:13,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 97 states. [2020-07-18 06:38:13,859 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 97 states. [2020-07-18 06:38:13,860 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 97 states. [2020-07-18 06:38:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:13,864 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2020-07-18 06:38:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2020-07-18 06:38:13,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:13,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:13,865 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 114 states. [2020-07-18 06:38:13,866 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 114 states. [2020-07-18 06:38:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:13,870 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2020-07-18 06:38:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2020-07-18 06:38:13,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:13,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:13,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:13,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-18 06:38:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2020-07-18 06:38:13,875 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 38 [2020-07-18 06:38:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:13,875 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2020-07-18 06:38:13,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 06:38:13,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 110 transitions. [2020-07-18 06:38:14,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2020-07-18 06:38:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 06:38:14,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:14,051 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:14,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 06:38:14,051 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash 88652198, now seen corresponding path program 1 times [2020-07-18 06:38:14,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:14,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1732885484] [2020-07-18 06:38:14,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:14,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {2524#true} assume true; {2524#true} is VALID [2020-07-18 06:38:14,187 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2524#true} {2524#true} #104#return; {2524#true} is VALID [2020-07-18 06:38:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:14,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2020-07-18 06:38:14,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2020-07-18 06:38:14,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {2524#true} assume true; {2524#true} is VALID [2020-07-18 06:38:14,195 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2524#true} {2530#(<= 4000 main_~k~0)} #108#return; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:14,195 INFO L263 TraceCheckUtils]: 0: Hoare triple {2524#true} call ULTIMATE.init(); {2524#true} is VALID [2020-07-18 06:38:14,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {2524#true} assume true; {2524#true} is VALID [2020-07-18 06:38:14,195 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2524#true} {2524#true} #104#return; {2524#true} is VALID [2020-07-18 06:38:14,196 INFO L263 TraceCheckUtils]: 3: Hoare triple {2524#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {2524#true} is VALID [2020-07-18 06:38:14,196 INFO L280 TraceCheckUtils]: 4: Hoare triple {2524#true} ~argc := #in~argc; {2524#true} is VALID [2020-07-18 06:38:14,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {2524#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {2524#true} is VALID [2020-07-18 06:38:14,197 INFO L280 TraceCheckUtils]: 6: Hoare triple {2524#true} ~c1~0 := 4000; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,198 INFO L280 TraceCheckUtils]: 7: Hoare triple {2528#(<= 4000 main_~c1~0)} ~c2~0 := 2000; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {2528#(<= 4000 main_~c1~0)} ~c3~0 := 10000; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,201 INFO L280 TraceCheckUtils]: 9: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~n~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,202 INFO L280 TraceCheckUtils]: 10: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~v~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,203 INFO L280 TraceCheckUtils]: 11: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~i~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,203 INFO L280 TraceCheckUtils]: 12: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~k~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,203 INFO L280 TraceCheckUtils]: 13: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~j~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,204 INFO L280 TraceCheckUtils]: 14: Hoare triple {2528#(<= 4000 main_~c1~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,204 INFO L280 TraceCheckUtils]: 15: Hoare triple {2528#(<= 4000 main_~c1~0)} ~n~0 := #t~nondet0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,205 INFO L280 TraceCheckUtils]: 16: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc #t~nondet0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,205 INFO L280 TraceCheckUtils]: 17: Hoare triple {2528#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10); {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-18 06:38:14,206 INFO L280 TraceCheckUtils]: 18: Hoare triple {2528#(<= 4000 main_~c1~0)} ~k~0 := 0; {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,206 INFO L280 TraceCheckUtils]: 19: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} ~i~0 := 0; {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,207 INFO L280 TraceCheckUtils]: 20: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(~i~0 < ~n~0); {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,211 INFO L280 TraceCheckUtils]: 21: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} #t~post1 := ~i~0; {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,212 INFO L280 TraceCheckUtils]: 22: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} ~i~0 := 1 + #t~post1; {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,212 INFO L280 TraceCheckUtils]: 23: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} havoc #t~post1; {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,212 INFO L280 TraceCheckUtils]: 24: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,213 INFO L280 TraceCheckUtils]: 25: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} ~v~0 := #t~nondet2; {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,213 INFO L280 TraceCheckUtils]: 26: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} havoc #t~nondet2; {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,214 INFO L280 TraceCheckUtils]: 27: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,214 INFO L280 TraceCheckUtils]: 28: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} assume 0 == ~v~0; {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 06:38:14,215 INFO L280 TraceCheckUtils]: 29: Hoare triple {2529#(<= 4000 (+ main_~c1~0 main_~k~0))} ~k~0 := ~k~0 + ~c1~0; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:14,215 INFO L280 TraceCheckUtils]: 30: Hoare triple {2530#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {2530#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:14,216 INFO L280 TraceCheckUtils]: 31: Hoare triple {2530#(<= 4000 main_~k~0)} ~j~0 := 0; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:14,220 INFO L280 TraceCheckUtils]: 32: Hoare triple {2530#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {2530#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:14,220 INFO L263 TraceCheckUtils]: 33: Hoare triple {2530#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2524#true} is VALID [2020-07-18 06:38:14,220 INFO L280 TraceCheckUtils]: 34: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2020-07-18 06:38:14,221 INFO L280 TraceCheckUtils]: 35: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2020-07-18 06:38:14,221 INFO L280 TraceCheckUtils]: 36: Hoare triple {2524#true} assume true; {2524#true} is VALID [2020-07-18 06:38:14,221 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2524#true} {2530#(<= 4000 main_~k~0)} #108#return; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:14,222 INFO L280 TraceCheckUtils]: 38: Hoare triple {2530#(<= 4000 main_~k~0)} #t~post3 := ~j~0; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:14,222 INFO L280 TraceCheckUtils]: 39: Hoare triple {2530#(<= 4000 main_~k~0)} ~j~0 := 1 + #t~post3; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:14,223 INFO L280 TraceCheckUtils]: 40: Hoare triple {2530#(<= 4000 main_~k~0)} havoc #t~post3; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-18 06:38:14,223 INFO L280 TraceCheckUtils]: 41: Hoare triple {2530#(<= 4000 main_~k~0)} #t~post4 := ~k~0; {2535#(<= 4000 |main_#t~post4|)} is VALID [2020-07-18 06:38:14,225 INFO L280 TraceCheckUtils]: 42: Hoare triple {2535#(<= 4000 |main_#t~post4|)} ~k~0 := #t~post4 - 1; {2536#(<= 3999 main_~k~0)} is VALID [2020-07-18 06:38:14,225 INFO L280 TraceCheckUtils]: 43: Hoare triple {2536#(<= 3999 main_~k~0)} havoc #t~post4; {2536#(<= 3999 main_~k~0)} is VALID [2020-07-18 06:38:14,226 INFO L280 TraceCheckUtils]: 44: Hoare triple {2536#(<= 3999 main_~k~0)} assume !!(~j~0 < ~n~0); {2536#(<= 3999 main_~k~0)} is VALID [2020-07-18 06:38:14,226 INFO L263 TraceCheckUtils]: 45: Hoare triple {2536#(<= 3999 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2537#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:14,227 INFO L280 TraceCheckUtils]: 46: Hoare triple {2537#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2538#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:14,227 INFO L280 TraceCheckUtils]: 47: Hoare triple {2538#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2525#false} is VALID [2020-07-18 06:38:14,228 INFO L280 TraceCheckUtils]: 48: Hoare triple {2525#false} assume !false; {2525#false} is VALID [2020-07-18 06:38:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:14,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1732885484] [2020-07-18 06:38:14,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:14,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 06:38:14,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838147133] [2020-07-18 06:38:14,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-18 06:38:14,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:14,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 06:38:14,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:14,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 06:38:14,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:14,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 06:38:14,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-18 06:38:14,282 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 9 states. [2020-07-18 06:38:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:15,152 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2020-07-18 06:38:15,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 06:38:15,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-18 06:38:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:38:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2020-07-18 06:38:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:38:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2020-07-18 06:38:15,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 105 transitions. [2020-07-18 06:38:15,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:15,274 INFO L225 Difference]: With dead ends: 129 [2020-07-18 06:38:15,275 INFO L226 Difference]: Without dead ends: 127 [2020-07-18 06:38:15,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-18 06:38:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-18 06:38:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2020-07-18 06:38:15,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:15,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 110 states. [2020-07-18 06:38:15,533 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 110 states. [2020-07-18 06:38:15,533 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 110 states. [2020-07-18 06:38:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:15,537 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2020-07-18 06:38:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2020-07-18 06:38:15,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:15,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:15,538 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 127 states. [2020-07-18 06:38:15,538 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 127 states. [2020-07-18 06:38:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:15,543 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2020-07-18 06:38:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2020-07-18 06:38:15,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:15,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:15,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:15,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-18 06:38:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2020-07-18 06:38:15,548 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 49 [2020-07-18 06:38:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:15,549 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2020-07-18 06:38:15,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 06:38:15,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 123 transitions. [2020-07-18 06:38:15,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2020-07-18 06:38:15,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 06:38:15,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:15,724 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:15,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 06:38:15,725 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:15,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1084443264, now seen corresponding path program 1 times [2020-07-18 06:38:15,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:15,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1416670203] [2020-07-18 06:38:15,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:15,800 INFO L280 TraceCheckUtils]: 0: Hoare triple {3285#true} assume true; {3285#true} is VALID [2020-07-18 06:38:15,800 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3285#true} {3285#true} #104#return; {3285#true} is VALID [2020-07-18 06:38:15,800 INFO L263 TraceCheckUtils]: 0: Hoare triple {3285#true} call ULTIMATE.init(); {3285#true} is VALID [2020-07-18 06:38:15,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {3285#true} assume true; {3285#true} is VALID [2020-07-18 06:38:15,801 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3285#true} {3285#true} #104#return; {3285#true} is VALID [2020-07-18 06:38:15,801 INFO L263 TraceCheckUtils]: 3: Hoare triple {3285#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {3285#true} is VALID [2020-07-18 06:38:15,801 INFO L280 TraceCheckUtils]: 4: Hoare triple {3285#true} ~argc := #in~argc; {3285#true} is VALID [2020-07-18 06:38:15,801 INFO L280 TraceCheckUtils]: 5: Hoare triple {3285#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {3285#true} is VALID [2020-07-18 06:38:15,801 INFO L280 TraceCheckUtils]: 6: Hoare triple {3285#true} ~c1~0 := 4000; {3285#true} is VALID [2020-07-18 06:38:15,801 INFO L280 TraceCheckUtils]: 7: Hoare triple {3285#true} ~c2~0 := 2000; {3285#true} is VALID [2020-07-18 06:38:15,802 INFO L280 TraceCheckUtils]: 8: Hoare triple {3285#true} ~c3~0 := 10000; {3285#true} is VALID [2020-07-18 06:38:15,802 INFO L280 TraceCheckUtils]: 9: Hoare triple {3285#true} havoc ~n~0; {3285#true} is VALID [2020-07-18 06:38:15,802 INFO L280 TraceCheckUtils]: 10: Hoare triple {3285#true} havoc ~v~0; {3285#true} is VALID [2020-07-18 06:38:15,802 INFO L280 TraceCheckUtils]: 11: Hoare triple {3285#true} havoc ~i~0; {3285#true} is VALID [2020-07-18 06:38:15,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {3285#true} havoc ~k~0; {3285#true} is VALID [2020-07-18 06:38:15,802 INFO L280 TraceCheckUtils]: 13: Hoare triple {3285#true} havoc ~j~0; {3285#true} is VALID [2020-07-18 06:38:15,803 INFO L280 TraceCheckUtils]: 14: Hoare triple {3285#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3285#true} is VALID [2020-07-18 06:38:15,803 INFO L280 TraceCheckUtils]: 15: Hoare triple {3285#true} ~n~0 := #t~nondet0; {3285#true} is VALID [2020-07-18 06:38:15,803 INFO L280 TraceCheckUtils]: 16: Hoare triple {3285#true} havoc #t~nondet0; {3285#true} is VALID [2020-07-18 06:38:15,803 INFO L280 TraceCheckUtils]: 17: Hoare triple {3285#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {3285#true} is VALID [2020-07-18 06:38:15,803 INFO L280 TraceCheckUtils]: 18: Hoare triple {3285#true} ~k~0 := 0; {3285#true} is VALID [2020-07-18 06:38:15,808 INFO L280 TraceCheckUtils]: 19: Hoare triple {3285#true} ~i~0 := 0; {3289#(<= 0 main_~i~0)} is VALID [2020-07-18 06:38:15,810 INFO L280 TraceCheckUtils]: 20: Hoare triple {3289#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0); {3289#(<= 0 main_~i~0)} is VALID [2020-07-18 06:38:15,813 INFO L280 TraceCheckUtils]: 21: Hoare triple {3289#(<= 0 main_~i~0)} #t~post1 := ~i~0; {3290#(<= 0 |main_#t~post1|)} is VALID [2020-07-18 06:38:15,815 INFO L280 TraceCheckUtils]: 22: Hoare triple {3290#(<= 0 |main_#t~post1|)} ~i~0 := 1 + #t~post1; {3291#(<= 1 main_~i~0)} is VALID [2020-07-18 06:38:15,815 INFO L280 TraceCheckUtils]: 23: Hoare triple {3291#(<= 1 main_~i~0)} havoc #t~post1; {3291#(<= 1 main_~i~0)} is VALID [2020-07-18 06:38:15,815 INFO L280 TraceCheckUtils]: 24: Hoare triple {3291#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3291#(<= 1 main_~i~0)} is VALID [2020-07-18 06:38:15,816 INFO L280 TraceCheckUtils]: 25: Hoare triple {3291#(<= 1 main_~i~0)} ~v~0 := #t~nondet2; {3291#(<= 1 main_~i~0)} is VALID [2020-07-18 06:38:15,817 INFO L280 TraceCheckUtils]: 26: Hoare triple {3291#(<= 1 main_~i~0)} havoc #t~nondet2; {3291#(<= 1 main_~i~0)} is VALID [2020-07-18 06:38:15,818 INFO L280 TraceCheckUtils]: 27: Hoare triple {3291#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {3292#(<= main_~n~0 main_~i~0)} is VALID [2020-07-18 06:38:15,818 INFO L280 TraceCheckUtils]: 28: Hoare triple {3292#(<= main_~n~0 main_~i~0)} assume 0 == ~v~0; {3292#(<= main_~n~0 main_~i~0)} is VALID [2020-07-18 06:38:15,818 INFO L280 TraceCheckUtils]: 29: Hoare triple {3292#(<= main_~n~0 main_~i~0)} ~k~0 := ~k~0 + ~c1~0; {3292#(<= main_~n~0 main_~i~0)} is VALID [2020-07-18 06:38:15,819 INFO L280 TraceCheckUtils]: 30: Hoare triple {3292#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0); {3286#false} is VALID [2020-07-18 06:38:15,819 INFO L280 TraceCheckUtils]: 31: Hoare triple {3286#false} #t~post1 := ~i~0; {3286#false} is VALID [2020-07-18 06:38:15,819 INFO L280 TraceCheckUtils]: 32: Hoare triple {3286#false} ~i~0 := 1 + #t~post1; {3286#false} is VALID [2020-07-18 06:38:15,819 INFO L280 TraceCheckUtils]: 33: Hoare triple {3286#false} havoc #t~post1; {3286#false} is VALID [2020-07-18 06:38:15,819 INFO L280 TraceCheckUtils]: 34: Hoare triple {3286#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3286#false} is VALID [2020-07-18 06:38:15,820 INFO L280 TraceCheckUtils]: 35: Hoare triple {3286#false} ~v~0 := #t~nondet2; {3286#false} is VALID [2020-07-18 06:38:15,820 INFO L280 TraceCheckUtils]: 36: Hoare triple {3286#false} havoc #t~nondet2; {3286#false} is VALID [2020-07-18 06:38:15,820 INFO L280 TraceCheckUtils]: 37: Hoare triple {3286#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {3286#false} is VALID [2020-07-18 06:38:15,820 INFO L280 TraceCheckUtils]: 38: Hoare triple {3286#false} assume !(0 == ~v~0); {3286#false} is VALID [2020-07-18 06:38:15,820 INFO L280 TraceCheckUtils]: 39: Hoare triple {3286#false} assume !(1 == ~v~0); {3286#false} is VALID [2020-07-18 06:38:15,820 INFO L280 TraceCheckUtils]: 40: Hoare triple {3286#false} ~k~0 := ~k~0 + ~c3~0; {3286#false} is VALID [2020-07-18 06:38:15,820 INFO L280 TraceCheckUtils]: 41: Hoare triple {3286#false} assume !(~i~0 < ~n~0); {3286#false} is VALID [2020-07-18 06:38:15,821 INFO L280 TraceCheckUtils]: 42: Hoare triple {3286#false} ~j~0 := 0; {3286#false} is VALID [2020-07-18 06:38:15,821 INFO L280 TraceCheckUtils]: 43: Hoare triple {3286#false} assume !!(~j~0 < ~n~0); {3286#false} is VALID [2020-07-18 06:38:15,821 INFO L263 TraceCheckUtils]: 44: Hoare triple {3286#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3286#false} is VALID [2020-07-18 06:38:15,821 INFO L280 TraceCheckUtils]: 45: Hoare triple {3286#false} ~cond := #in~cond; {3286#false} is VALID [2020-07-18 06:38:15,821 INFO L280 TraceCheckUtils]: 46: Hoare triple {3286#false} assume 0 == ~cond; {3286#false} is VALID [2020-07-18 06:38:15,822 INFO L280 TraceCheckUtils]: 47: Hoare triple {3286#false} assume !false; {3286#false} is VALID [2020-07-18 06:38:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:15,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1416670203] [2020-07-18 06:38:15,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:15,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 06:38:15,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276461132] [2020-07-18 06:38:15,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2020-07-18 06:38:15,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:15,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 06:38:15,875 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-18 06:38:15,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 06:38:15,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:15,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 06:38:15,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:38:15,877 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 6 states. [2020-07-18 06:38:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:16,250 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2020-07-18 06:38:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 06:38:16,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2020-07-18 06:38:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2020-07-18 06:38:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2020-07-18 06:38:16,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2020-07-18 06:38:16,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:16,335 INFO L225 Difference]: With dead ends: 150 [2020-07-18 06:38:16,335 INFO L226 Difference]: Without dead ends: 70 [2020-07-18 06:38:16,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-18 06:38:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-18 06:38:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2020-07-18 06:38:16,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:16,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2020-07-18 06:38:16,522 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2020-07-18 06:38:16,522 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2020-07-18 06:38:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:16,525 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-07-18 06:38:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-07-18 06:38:16,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:16,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:16,526 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2020-07-18 06:38:16,526 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2020-07-18 06:38:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:16,528 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-07-18 06:38:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-07-18 06:38:16,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:16,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:16,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:16,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-18 06:38:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-07-18 06:38:16,532 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 48 [2020-07-18 06:38:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:16,532 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-07-18 06:38:16,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 06:38:16,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2020-07-18 06:38:16,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-18 06:38:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 06:38:16,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:16,639 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:16,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 06:38:16,639 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:16,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1391225462, now seen corresponding path program 1 times [2020-07-18 06:38:16,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:16,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [31861528] [2020-07-18 06:38:16,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:16,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {3879#true} assume true; {3879#true} is VALID [2020-07-18 06:38:16,760 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3879#true} {3879#true} #104#return; {3879#true} is VALID [2020-07-18 06:38:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:16,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2020-07-18 06:38:16,766 INFO L280 TraceCheckUtils]: 1: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2020-07-18 06:38:16,766 INFO L280 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2020-07-18 06:38:16,766 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3885#(<= 10000 main_~k~0)} #108#return; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:16,767 INFO L263 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2020-07-18 06:38:16,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {3879#true} assume true; {3879#true} is VALID [2020-07-18 06:38:16,767 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3879#true} {3879#true} #104#return; {3879#true} is VALID [2020-07-18 06:38:16,767 INFO L263 TraceCheckUtils]: 3: Hoare triple {3879#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {3879#true} is VALID [2020-07-18 06:38:16,767 INFO L280 TraceCheckUtils]: 4: Hoare triple {3879#true} ~argc := #in~argc; {3879#true} is VALID [2020-07-18 06:38:16,768 INFO L280 TraceCheckUtils]: 5: Hoare triple {3879#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {3879#true} is VALID [2020-07-18 06:38:16,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {3879#true} ~c1~0 := 4000; {3879#true} is VALID [2020-07-18 06:38:16,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {3879#true} ~c2~0 := 2000; {3879#true} is VALID [2020-07-18 06:38:16,772 INFO L280 TraceCheckUtils]: 8: Hoare triple {3879#true} ~c3~0 := 10000; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,774 INFO L280 TraceCheckUtils]: 9: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~n~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~v~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,775 INFO L280 TraceCheckUtils]: 11: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~i~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,776 INFO L280 TraceCheckUtils]: 12: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~k~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,776 INFO L280 TraceCheckUtils]: 13: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~j~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,777 INFO L280 TraceCheckUtils]: 14: Hoare triple {3883#(<= 10000 main_~c3~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,777 INFO L280 TraceCheckUtils]: 15: Hoare triple {3883#(<= 10000 main_~c3~0)} ~n~0 := #t~nondet0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,778 INFO L280 TraceCheckUtils]: 16: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc #t~nondet0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,779 INFO L280 TraceCheckUtils]: 17: Hoare triple {3883#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10); {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-18 06:38:16,779 INFO L280 TraceCheckUtils]: 18: Hoare triple {3883#(<= 10000 main_~c3~0)} ~k~0 := 0; {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,779 INFO L280 TraceCheckUtils]: 19: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} ~i~0 := 0; {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,780 INFO L280 TraceCheckUtils]: 20: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(~i~0 < ~n~0); {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,780 INFO L280 TraceCheckUtils]: 21: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} #t~post1 := ~i~0; {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,781 INFO L280 TraceCheckUtils]: 22: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} ~i~0 := 1 + #t~post1; {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,781 INFO L280 TraceCheckUtils]: 23: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} havoc #t~post1; {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,781 INFO L280 TraceCheckUtils]: 24: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,782 INFO L280 TraceCheckUtils]: 25: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} ~v~0 := #t~nondet2; {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,783 INFO L280 TraceCheckUtils]: 26: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} havoc #t~nondet2; {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,783 INFO L280 TraceCheckUtils]: 27: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,784 INFO L280 TraceCheckUtils]: 28: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(0 == ~v~0); {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,784 INFO L280 TraceCheckUtils]: 29: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(1 == ~v~0); {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 06:38:16,785 INFO L280 TraceCheckUtils]: 30: Hoare triple {3884#(<= 10000 (+ main_~c3~0 main_~k~0))} ~k~0 := ~k~0 + ~c3~0; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:16,785 INFO L280 TraceCheckUtils]: 31: Hoare triple {3885#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {3885#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:16,785 INFO L280 TraceCheckUtils]: 32: Hoare triple {3885#(<= 10000 main_~k~0)} ~j~0 := 0; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:16,786 INFO L280 TraceCheckUtils]: 33: Hoare triple {3885#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {3885#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:16,786 INFO L263 TraceCheckUtils]: 34: Hoare triple {3885#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3879#true} is VALID [2020-07-18 06:38:16,786 INFO L280 TraceCheckUtils]: 35: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2020-07-18 06:38:16,786 INFO L280 TraceCheckUtils]: 36: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2020-07-18 06:38:16,786 INFO L280 TraceCheckUtils]: 37: Hoare triple {3879#true} assume true; {3879#true} is VALID [2020-07-18 06:38:16,787 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3879#true} {3885#(<= 10000 main_~k~0)} #108#return; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:16,787 INFO L280 TraceCheckUtils]: 39: Hoare triple {3885#(<= 10000 main_~k~0)} #t~post3 := ~j~0; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:16,788 INFO L280 TraceCheckUtils]: 40: Hoare triple {3885#(<= 10000 main_~k~0)} ~j~0 := 1 + #t~post3; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:16,788 INFO L280 TraceCheckUtils]: 41: Hoare triple {3885#(<= 10000 main_~k~0)} havoc #t~post3; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-18 06:38:16,788 INFO L280 TraceCheckUtils]: 42: Hoare triple {3885#(<= 10000 main_~k~0)} #t~post4 := ~k~0; {3890#(<= 10000 |main_#t~post4|)} is VALID [2020-07-18 06:38:16,789 INFO L280 TraceCheckUtils]: 43: Hoare triple {3890#(<= 10000 |main_#t~post4|)} ~k~0 := #t~post4 - 1; {3891#(<= 9999 main_~k~0)} is VALID [2020-07-18 06:38:16,789 INFO L280 TraceCheckUtils]: 44: Hoare triple {3891#(<= 9999 main_~k~0)} havoc #t~post4; {3891#(<= 9999 main_~k~0)} is VALID [2020-07-18 06:38:16,790 INFO L280 TraceCheckUtils]: 45: Hoare triple {3891#(<= 9999 main_~k~0)} assume !!(~j~0 < ~n~0); {3891#(<= 9999 main_~k~0)} is VALID [2020-07-18 06:38:16,790 INFO L263 TraceCheckUtils]: 46: Hoare triple {3891#(<= 9999 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3892#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:16,791 INFO L280 TraceCheckUtils]: 47: Hoare triple {3892#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3893#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:16,791 INFO L280 TraceCheckUtils]: 48: Hoare triple {3893#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3880#false} is VALID [2020-07-18 06:38:16,791 INFO L280 TraceCheckUtils]: 49: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2020-07-18 06:38:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:16,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [31861528] [2020-07-18 06:38:16,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:16,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 06:38:16,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947496360] [2020-07-18 06:38:16,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-18 06:38:16,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:16,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 06:38:16,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:16,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 06:38:16,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 06:38:16,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-18 06:38:16,849 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 9 states. [2020-07-18 06:38:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:17,567 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2020-07-18 06:38:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 06:38:17,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-18 06:38:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:38:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2020-07-18 06:38:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:38:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2020-07-18 06:38:17,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2020-07-18 06:38:17,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:17,649 INFO L225 Difference]: With dead ends: 96 [2020-07-18 06:38:17,649 INFO L226 Difference]: Without dead ends: 94 [2020-07-18 06:38:17,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-18 06:38:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-18 06:38:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2020-07-18 06:38:17,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:17,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 69 states. [2020-07-18 06:38:17,834 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 69 states. [2020-07-18 06:38:17,834 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 69 states. [2020-07-18 06:38:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:17,838 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2020-07-18 06:38:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2020-07-18 06:38:17,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:17,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:17,839 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 94 states. [2020-07-18 06:38:17,839 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 94 states. [2020-07-18 06:38:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:17,844 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2020-07-18 06:38:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2020-07-18 06:38:17,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:17,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:17,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:17,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-18 06:38:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-07-18 06:38:17,847 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 50 [2020-07-18 06:38:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:17,848 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-07-18 06:38:17,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 06:38:17,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2020-07-18 06:38:17,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-18 06:38:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 06:38:17,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:17,982 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:17,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 06:38:17,983 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash -798805526, now seen corresponding path program 1 times [2020-07-18 06:38:17,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:17,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592613041] [2020-07-18 06:38:17,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:18,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {4426#true} assume true; {4426#true} is VALID [2020-07-18 06:38:18,103 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4426#true} {4426#true} #104#return; {4426#true} is VALID [2020-07-18 06:38:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:18,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {4426#true} ~cond := #in~cond; {4426#true} is VALID [2020-07-18 06:38:18,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {4426#true} assume !(0 == ~cond); {4426#true} is VALID [2020-07-18 06:38:18,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {4426#true} assume true; {4426#true} is VALID [2020-07-18 06:38:18,112 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4426#true} {4432#(<= 2000 main_~k~0)} #108#return; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:18,112 INFO L263 TraceCheckUtils]: 0: Hoare triple {4426#true} call ULTIMATE.init(); {4426#true} is VALID [2020-07-18 06:38:18,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {4426#true} assume true; {4426#true} is VALID [2020-07-18 06:38:18,112 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4426#true} {4426#true} #104#return; {4426#true} is VALID [2020-07-18 06:38:18,112 INFO L263 TraceCheckUtils]: 3: Hoare triple {4426#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {4426#true} is VALID [2020-07-18 06:38:18,113 INFO L280 TraceCheckUtils]: 4: Hoare triple {4426#true} ~argc := #in~argc; {4426#true} is VALID [2020-07-18 06:38:18,113 INFO L280 TraceCheckUtils]: 5: Hoare triple {4426#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {4426#true} is VALID [2020-07-18 06:38:18,113 INFO L280 TraceCheckUtils]: 6: Hoare triple {4426#true} ~c1~0 := 4000; {4426#true} is VALID [2020-07-18 06:38:18,114 INFO L280 TraceCheckUtils]: 7: Hoare triple {4426#true} ~c2~0 := 2000; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,114 INFO L280 TraceCheckUtils]: 8: Hoare triple {4430#(<= 2000 main_~c2~0)} ~c3~0 := 10000; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,115 INFO L280 TraceCheckUtils]: 9: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~n~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,115 INFO L280 TraceCheckUtils]: 10: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~v~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,116 INFO L280 TraceCheckUtils]: 11: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~i~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,116 INFO L280 TraceCheckUtils]: 12: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~k~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,117 INFO L280 TraceCheckUtils]: 13: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~j~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,117 INFO L280 TraceCheckUtils]: 14: Hoare triple {4430#(<= 2000 main_~c2~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,118 INFO L280 TraceCheckUtils]: 15: Hoare triple {4430#(<= 2000 main_~c2~0)} ~n~0 := #t~nondet0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,118 INFO L280 TraceCheckUtils]: 16: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc #t~nondet0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,119 INFO L280 TraceCheckUtils]: 17: Hoare triple {4430#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10); {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-18 06:38:18,119 INFO L280 TraceCheckUtils]: 18: Hoare triple {4430#(<= 2000 main_~c2~0)} ~k~0 := 0; {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,120 INFO L280 TraceCheckUtils]: 19: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} ~i~0 := 0; {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,120 INFO L280 TraceCheckUtils]: 20: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(~i~0 < ~n~0); {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,121 INFO L280 TraceCheckUtils]: 21: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} #t~post1 := ~i~0; {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,121 INFO L280 TraceCheckUtils]: 22: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} ~i~0 := 1 + #t~post1; {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,122 INFO L280 TraceCheckUtils]: 23: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} havoc #t~post1; {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,122 INFO L280 TraceCheckUtils]: 24: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,123 INFO L280 TraceCheckUtils]: 25: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} ~v~0 := #t~nondet2; {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,123 INFO L280 TraceCheckUtils]: 26: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} havoc #t~nondet2; {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,124 INFO L280 TraceCheckUtils]: 27: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,124 INFO L280 TraceCheckUtils]: 28: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !(0 == ~v~0); {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,125 INFO L280 TraceCheckUtils]: 29: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} assume 1 == ~v~0; {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 06:38:18,125 INFO L280 TraceCheckUtils]: 30: Hoare triple {4431#(<= 2000 (+ main_~c2~0 main_~k~0))} ~k~0 := ~k~0 + ~c2~0; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:18,126 INFO L280 TraceCheckUtils]: 31: Hoare triple {4432#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {4432#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:18,126 INFO L280 TraceCheckUtils]: 32: Hoare triple {4432#(<= 2000 main_~k~0)} ~j~0 := 0; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:18,127 INFO L280 TraceCheckUtils]: 33: Hoare triple {4432#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {4432#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:18,127 INFO L263 TraceCheckUtils]: 34: Hoare triple {4432#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4426#true} is VALID [2020-07-18 06:38:18,127 INFO L280 TraceCheckUtils]: 35: Hoare triple {4426#true} ~cond := #in~cond; {4426#true} is VALID [2020-07-18 06:38:18,128 INFO L280 TraceCheckUtils]: 36: Hoare triple {4426#true} assume !(0 == ~cond); {4426#true} is VALID [2020-07-18 06:38:18,128 INFO L280 TraceCheckUtils]: 37: Hoare triple {4426#true} assume true; {4426#true} is VALID [2020-07-18 06:38:18,129 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4426#true} {4432#(<= 2000 main_~k~0)} #108#return; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:18,135 INFO L280 TraceCheckUtils]: 39: Hoare triple {4432#(<= 2000 main_~k~0)} #t~post3 := ~j~0; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:18,135 INFO L280 TraceCheckUtils]: 40: Hoare triple {4432#(<= 2000 main_~k~0)} ~j~0 := 1 + #t~post3; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:18,136 INFO L280 TraceCheckUtils]: 41: Hoare triple {4432#(<= 2000 main_~k~0)} havoc #t~post3; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-18 06:38:18,136 INFO L280 TraceCheckUtils]: 42: Hoare triple {4432#(<= 2000 main_~k~0)} #t~post4 := ~k~0; {4437#(<= 2000 |main_#t~post4|)} is VALID [2020-07-18 06:38:18,137 INFO L280 TraceCheckUtils]: 43: Hoare triple {4437#(<= 2000 |main_#t~post4|)} ~k~0 := #t~post4 - 1; {4438#(<= 1999 main_~k~0)} is VALID [2020-07-18 06:38:18,138 INFO L280 TraceCheckUtils]: 44: Hoare triple {4438#(<= 1999 main_~k~0)} havoc #t~post4; {4438#(<= 1999 main_~k~0)} is VALID [2020-07-18 06:38:18,138 INFO L280 TraceCheckUtils]: 45: Hoare triple {4438#(<= 1999 main_~k~0)} assume !!(~j~0 < ~n~0); {4438#(<= 1999 main_~k~0)} is VALID [2020-07-18 06:38:18,139 INFO L263 TraceCheckUtils]: 46: Hoare triple {4438#(<= 1999 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4439#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:18,140 INFO L280 TraceCheckUtils]: 47: Hoare triple {4439#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4440#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:18,140 INFO L280 TraceCheckUtils]: 48: Hoare triple {4440#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4427#false} is VALID [2020-07-18 06:38:18,141 INFO L280 TraceCheckUtils]: 49: Hoare triple {4427#false} assume !false; {4427#false} is VALID [2020-07-18 06:38:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:18,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592613041] [2020-07-18 06:38:18,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:18,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 06:38:18,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019053644] [2020-07-18 06:38:18,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-18 06:38:18,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:18,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 06:38:18,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:18,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 06:38:18,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 06:38:18,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-18 06:38:18,199 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 9 states. [2020-07-18 06:38:18,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:18,958 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2020-07-18 06:38:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 06:38:18,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-18 06:38:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:38:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2020-07-18 06:38:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:38:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2020-07-18 06:38:18,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2020-07-18 06:38:19,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:19,054 INFO L225 Difference]: With dead ends: 94 [2020-07-18 06:38:19,054 INFO L226 Difference]: Without dead ends: 92 [2020-07-18 06:38:19,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-18 06:38:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-18 06:38:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2020-07-18 06:38:19,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:19,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 67 states. [2020-07-18 06:38:19,268 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 67 states. [2020-07-18 06:38:19,268 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 67 states. [2020-07-18 06:38:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:19,272 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2020-07-18 06:38:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2020-07-18 06:38:19,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:19,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:19,273 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 92 states. [2020-07-18 06:38:19,273 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 92 states. [2020-07-18 06:38:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:19,276 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2020-07-18 06:38:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2020-07-18 06:38:19,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:19,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:19,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:19,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-18 06:38:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2020-07-18 06:38:19,279 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 50 [2020-07-18 06:38:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:19,279 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2020-07-18 06:38:19,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 06:38:19,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 69 transitions. [2020-07-18 06:38:19,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2020-07-18 06:38:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 06:38:19,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:19,401 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:19,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 06:38:19,401 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:19,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:19,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1367702887, now seen corresponding path program 2 times [2020-07-18 06:38:19,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:19,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768006002] [2020-07-18 06:38:19,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:19,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-18 06:38:19,502 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4961#true} {4961#true} #104#return; {4961#true} is VALID [2020-07-18 06:38:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:19,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {4961#true} ~cond := #in~cond; {4961#true} is VALID [2020-07-18 06:38:19,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {4961#true} assume !(0 == ~cond); {4961#true} is VALID [2020-07-18 06:38:19,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-18 06:38:19,526 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4961#true} {4966#(<= main_~n~0 (+ main_~j~0 1))} #108#return; {4966#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2020-07-18 06:38:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:19,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {4961#true} ~cond := #in~cond; {4961#true} is VALID [2020-07-18 06:38:19,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {4961#true} assume !(0 == ~cond); {4961#true} is VALID [2020-07-18 06:38:19,533 INFO L280 TraceCheckUtils]: 2: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-18 06:38:19,533 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4961#true} {4962#false} #108#return; {4962#false} is VALID [2020-07-18 06:38:19,533 INFO L263 TraceCheckUtils]: 0: Hoare triple {4961#true} call ULTIMATE.init(); {4961#true} is VALID [2020-07-18 06:38:19,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-18 06:38:19,534 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4961#true} {4961#true} #104#return; {4961#true} is VALID [2020-07-18 06:38:19,534 INFO L263 TraceCheckUtils]: 3: Hoare triple {4961#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {4961#true} is VALID [2020-07-18 06:38:19,534 INFO L280 TraceCheckUtils]: 4: Hoare triple {4961#true} ~argc := #in~argc; {4961#true} is VALID [2020-07-18 06:38:19,534 INFO L280 TraceCheckUtils]: 5: Hoare triple {4961#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {4961#true} is VALID [2020-07-18 06:38:19,534 INFO L280 TraceCheckUtils]: 6: Hoare triple {4961#true} ~c1~0 := 4000; {4961#true} is VALID [2020-07-18 06:38:19,535 INFO L280 TraceCheckUtils]: 7: Hoare triple {4961#true} ~c2~0 := 2000; {4961#true} is VALID [2020-07-18 06:38:19,535 INFO L280 TraceCheckUtils]: 8: Hoare triple {4961#true} ~c3~0 := 10000; {4961#true} is VALID [2020-07-18 06:38:19,535 INFO L280 TraceCheckUtils]: 9: Hoare triple {4961#true} havoc ~n~0; {4961#true} is VALID [2020-07-18 06:38:19,535 INFO L280 TraceCheckUtils]: 10: Hoare triple {4961#true} havoc ~v~0; {4961#true} is VALID [2020-07-18 06:38:19,535 INFO L280 TraceCheckUtils]: 11: Hoare triple {4961#true} havoc ~i~0; {4961#true} is VALID [2020-07-18 06:38:19,535 INFO L280 TraceCheckUtils]: 12: Hoare triple {4961#true} havoc ~k~0; {4961#true} is VALID [2020-07-18 06:38:19,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {4961#true} havoc ~j~0; {4961#true} is VALID [2020-07-18 06:38:19,536 INFO L280 TraceCheckUtils]: 14: Hoare triple {4961#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4961#true} is VALID [2020-07-18 06:38:19,536 INFO L280 TraceCheckUtils]: 15: Hoare triple {4961#true} ~n~0 := #t~nondet0; {4961#true} is VALID [2020-07-18 06:38:19,536 INFO L280 TraceCheckUtils]: 16: Hoare triple {4961#true} havoc #t~nondet0; {4961#true} is VALID [2020-07-18 06:38:19,536 INFO L280 TraceCheckUtils]: 17: Hoare triple {4961#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {4961#true} is VALID [2020-07-18 06:38:19,536 INFO L280 TraceCheckUtils]: 18: Hoare triple {4961#true} ~k~0 := 0; {4961#true} is VALID [2020-07-18 06:38:19,537 INFO L280 TraceCheckUtils]: 19: Hoare triple {4961#true} ~i~0 := 0; {4961#true} is VALID [2020-07-18 06:38:19,537 INFO L280 TraceCheckUtils]: 20: Hoare triple {4961#true} assume !!(~i~0 < ~n~0); {4961#true} is VALID [2020-07-18 06:38:19,537 INFO L280 TraceCheckUtils]: 21: Hoare triple {4961#true} #t~post1 := ~i~0; {4961#true} is VALID [2020-07-18 06:38:19,537 INFO L280 TraceCheckUtils]: 22: Hoare triple {4961#true} ~i~0 := 1 + #t~post1; {4961#true} is VALID [2020-07-18 06:38:19,537 INFO L280 TraceCheckUtils]: 23: Hoare triple {4961#true} havoc #t~post1; {4961#true} is VALID [2020-07-18 06:38:19,537 INFO L280 TraceCheckUtils]: 24: Hoare triple {4961#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4961#true} is VALID [2020-07-18 06:38:19,538 INFO L280 TraceCheckUtils]: 25: Hoare triple {4961#true} ~v~0 := #t~nondet2; {4961#true} is VALID [2020-07-18 06:38:19,538 INFO L280 TraceCheckUtils]: 26: Hoare triple {4961#true} havoc #t~nondet2; {4961#true} is VALID [2020-07-18 06:38:19,539 INFO L280 TraceCheckUtils]: 27: Hoare triple {4961#true} assume !!(0 <= ~v~0 && ~n~0 < 2); {4965#(<= main_~n~0 1)} is VALID [2020-07-18 06:38:19,539 INFO L280 TraceCheckUtils]: 28: Hoare triple {4965#(<= main_~n~0 1)} assume 0 == ~v~0; {4965#(<= main_~n~0 1)} is VALID [2020-07-18 06:38:19,540 INFO L280 TraceCheckUtils]: 29: Hoare triple {4965#(<= main_~n~0 1)} ~k~0 := ~k~0 + ~c1~0; {4965#(<= main_~n~0 1)} is VALID [2020-07-18 06:38:19,540 INFO L280 TraceCheckUtils]: 30: Hoare triple {4965#(<= main_~n~0 1)} assume !(~i~0 < ~n~0); {4965#(<= main_~n~0 1)} is VALID [2020-07-18 06:38:19,541 INFO L280 TraceCheckUtils]: 31: Hoare triple {4965#(<= main_~n~0 1)} ~j~0 := 0; {4966#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2020-07-18 06:38:19,541 INFO L280 TraceCheckUtils]: 32: Hoare triple {4966#(<= main_~n~0 (+ main_~j~0 1))} assume !!(~j~0 < ~n~0); {4966#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2020-07-18 06:38:19,541 INFO L263 TraceCheckUtils]: 33: Hoare triple {4966#(<= main_~n~0 (+ main_~j~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4961#true} is VALID [2020-07-18 06:38:19,542 INFO L280 TraceCheckUtils]: 34: Hoare triple {4961#true} ~cond := #in~cond; {4961#true} is VALID [2020-07-18 06:38:19,542 INFO L280 TraceCheckUtils]: 35: Hoare triple {4961#true} assume !(0 == ~cond); {4961#true} is VALID [2020-07-18 06:38:19,542 INFO L280 TraceCheckUtils]: 36: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-18 06:38:19,543 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {4961#true} {4966#(<= main_~n~0 (+ main_~j~0 1))} #108#return; {4966#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2020-07-18 06:38:19,544 INFO L280 TraceCheckUtils]: 38: Hoare triple {4966#(<= main_~n~0 (+ main_~j~0 1))} #t~post3 := ~j~0; {4971#(<= main_~n~0 (+ |main_#t~post3| 1))} is VALID [2020-07-18 06:38:19,544 INFO L280 TraceCheckUtils]: 39: Hoare triple {4971#(<= main_~n~0 (+ |main_#t~post3| 1))} ~j~0 := 1 + #t~post3; {4972#(<= main_~n~0 main_~j~0)} is VALID [2020-07-18 06:38:19,545 INFO L280 TraceCheckUtils]: 40: Hoare triple {4972#(<= main_~n~0 main_~j~0)} havoc #t~post3; {4972#(<= main_~n~0 main_~j~0)} is VALID [2020-07-18 06:38:19,546 INFO L280 TraceCheckUtils]: 41: Hoare triple {4972#(<= main_~n~0 main_~j~0)} #t~post4 := ~k~0; {4972#(<= main_~n~0 main_~j~0)} is VALID [2020-07-18 06:38:19,546 INFO L280 TraceCheckUtils]: 42: Hoare triple {4972#(<= main_~n~0 main_~j~0)} ~k~0 := #t~post4 - 1; {4972#(<= main_~n~0 main_~j~0)} is VALID [2020-07-18 06:38:19,547 INFO L280 TraceCheckUtils]: 43: Hoare triple {4972#(<= main_~n~0 main_~j~0)} havoc #t~post4; {4972#(<= main_~n~0 main_~j~0)} is VALID [2020-07-18 06:38:19,547 INFO L280 TraceCheckUtils]: 44: Hoare triple {4972#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {4962#false} is VALID [2020-07-18 06:38:19,548 INFO L263 TraceCheckUtils]: 45: Hoare triple {4962#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4961#true} is VALID [2020-07-18 06:38:19,548 INFO L280 TraceCheckUtils]: 46: Hoare triple {4961#true} ~cond := #in~cond; {4961#true} is VALID [2020-07-18 06:38:19,548 INFO L280 TraceCheckUtils]: 47: Hoare triple {4961#true} assume !(0 == ~cond); {4961#true} is VALID [2020-07-18 06:38:19,548 INFO L280 TraceCheckUtils]: 48: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-18 06:38:19,548 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {4961#true} {4962#false} #108#return; {4962#false} is VALID [2020-07-18 06:38:19,548 INFO L280 TraceCheckUtils]: 50: Hoare triple {4962#false} #t~post3 := ~j~0; {4962#false} is VALID [2020-07-18 06:38:19,549 INFO L280 TraceCheckUtils]: 51: Hoare triple {4962#false} ~j~0 := 1 + #t~post3; {4962#false} is VALID [2020-07-18 06:38:19,549 INFO L280 TraceCheckUtils]: 52: Hoare triple {4962#false} havoc #t~post3; {4962#false} is VALID [2020-07-18 06:38:19,549 INFO L280 TraceCheckUtils]: 53: Hoare triple {4962#false} #t~post4 := ~k~0; {4962#false} is VALID [2020-07-18 06:38:19,549 INFO L280 TraceCheckUtils]: 54: Hoare triple {4962#false} ~k~0 := #t~post4 - 1; {4962#false} is VALID [2020-07-18 06:38:19,549 INFO L280 TraceCheckUtils]: 55: Hoare triple {4962#false} havoc #t~post4; {4962#false} is VALID [2020-07-18 06:38:19,550 INFO L280 TraceCheckUtils]: 56: Hoare triple {4962#false} assume !!(~j~0 < ~n~0); {4962#false} is VALID [2020-07-18 06:38:19,550 INFO L263 TraceCheckUtils]: 57: Hoare triple {4962#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4962#false} is VALID [2020-07-18 06:38:19,550 INFO L280 TraceCheckUtils]: 58: Hoare triple {4962#false} ~cond := #in~cond; {4962#false} is VALID [2020-07-18 06:38:19,550 INFO L280 TraceCheckUtils]: 59: Hoare triple {4962#false} assume 0 == ~cond; {4962#false} is VALID [2020-07-18 06:38:19,550 INFO L280 TraceCheckUtils]: 60: Hoare triple {4962#false} assume !false; {4962#false} is VALID [2020-07-18 06:38:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-18 06:38:19,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768006002] [2020-07-18 06:38:19,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:19,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 06:38:19,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868536431] [2020-07-18 06:38:19,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-07-18 06:38:19,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:19,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 06:38:19,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:19,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 06:38:19,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:19,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 06:38:19,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:38:19,619 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 6 states. [2020-07-18 06:38:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:19,949 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-07-18 06:38:19,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 06:38:19,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-07-18 06:38:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-18 06:38:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-18 06:38:19,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2020-07-18 06:38:20,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:20,022 INFO L225 Difference]: With dead ends: 67 [2020-07-18 06:38:20,022 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 06:38:20,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-07-18 06:38:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 06:38:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 06:38:20,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:20,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:20,024 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:20,025 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:20,025 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:38:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:20,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:20,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:20,025 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:20,026 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:20,026 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:38:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:20,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:20,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:20,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:20,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 06:38:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 06:38:20,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-07-18 06:38:20,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:20,027 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 06:38:20,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 06:38:20,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 06:38:20,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:20,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:20,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 06:38:20,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 06:38:21,471 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2020-07-18 06:38:21,692 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:38:21,692 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:38:21,692 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:38:21,692 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 06:38:21,692 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 06:38:21,692 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:38:21,692 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:21,693 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:21,693 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 06:38:21,693 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 06:38:21,693 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:21,693 INFO L264 CegarLoopResult]: At program point L35-2(lines 35 39) the Hoare annotation is: (let ((.cse1 (<= 10000 main_~c3~0)) (.cse3 (<= 4000 main_~c1~0)) (.cse2 (<= 2000 main_~c2~0)) (.cse4 (<= 1 main_~i~0)) (.cse5 (<= main_~n~0 1)) (.cse0 (<= main_~n~0 main_~j~0))) (or (and (<= main_~i~0 0) (<= main_~n~0 0) .cse0) (and .cse1 (<= main_~n~0 (+ main_~j~0 1)) (<= 2000 main_~k~0) .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse3 .cse2 (<= 1999 main_~k~0) .cse4 .cse5 .cse0))) [2020-07-18 06:38:21,693 INFO L271 CegarLoopResult]: At program point L35-3(lines 35 39) the Hoare annotation is: true [2020-07-18 06:38:21,694 INFO L264 CegarLoopResult]: At program point L27(lines 27 32) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= main_~n~0 1) (<= 1 main_~i~0)) [2020-07-18 06:38:21,694 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 41) the Hoare annotation is: true [2020-07-18 06:38:21,694 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 33) the Hoare annotation is: (or (and (<= 10000 main_~c3~0) (<= 2000 main_~k~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 1 main_~i~0)) (and (<= main_~i~0 0) (<= main_~n~0 0))) [2020-07-18 06:38:21,694 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,694 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,695 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,695 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (<= 4000 main_~c1~0) [2020-07-18 06:38:21,695 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= main_~n~0 (+ main_~j~0 1)) (<= 2000 main_~k~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 1 main_~i~0) (<= main_~n~0 1)) [2020-07-18 06:38:21,695 INFO L264 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= main_~n~0 (+ main_~j~0 1)) (<= 2000 main_~k~0) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= main_~n~0 1) (<= 1 main_~i~0)) [2020-07-18 06:38:21,695 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= main_~n~0 1) (<= 1 main_~i~0)) [2020-07-18 06:38:21,695 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= main_~n~0 1) (<= 1 main_~i~0)) [2020-07-18 06:38:21,696 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 0 main_~i~0) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 2000 (+ main_~c2~0 main_~k~0))) [2020-07-18 06:38:21,696 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 0 main_~i~0) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 0 |main_#t~post1|)) [2020-07-18 06:38:21,696 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 0 |main_#t~post1|) (<= 1 main_~i~0)) [2020-07-18 06:38:21,696 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,696 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-07-18 06:38:21,696 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,697 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= main_~n~0 (+ main_~j~0 1)) (<= 2000 main_~k~0) (<= main_~n~0 (+ |main_#t~post3| 1)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= main_~n~0 1) (<= 1 main_~i~0)) [2020-07-18 06:38:21,697 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 2000 main_~k~0) (<= main_~n~0 (+ |main_#t~post3| 1)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= main_~n~0 1) (<= 1 main_~i~0) (<= main_~n~0 main_~j~0)) [2020-07-18 06:38:21,697 INFO L264 CegarLoopResult]: At program point L29(lines 29 32) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= main_~n~0 1) (<= 1 main_~i~0)) [2020-07-18 06:38:21,697 INFO L264 CegarLoopResult]: At program point L29-2(lines 23 33) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 4000 main_~c1~0)) (.cse2 (<= 2000 main_~c2~0))) (or (and (<= main_~i~0 0) .cse0 (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 0 main_~i~0) (<= 4000 (+ main_~c1~0 main_~k~0)) .cse1 .cse2 (<= 2000 (+ main_~c2~0 main_~k~0))) (and .cse0 (<= 2000 main_~k~0) .cse1 .cse2 (<= 1 main_~i~0) (<= main_~n~0 1)))) [2020-07-18 06:38:21,697 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 1 main_~i~0)) [2020-07-18 06:38:21,698 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 1 main_~i~0)) [2020-07-18 06:38:21,698 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 1 main_~i~0)) [2020-07-18 06:38:21,698 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,698 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,698 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,698 INFO L271 CegarLoopResult]: At program point L13(lines 13 41) the Hoare annotation is: true [2020-07-18 06:38:21,698 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 41) the Hoare annotation is: true [2020-07-18 06:38:21,699 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 2000 main_~k~0) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= main_~n~0 1) (<= 1 main_~i~0) (<= main_~n~0 main_~j~0)) [2020-07-18 06:38:21,699 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 2000 |main_#t~post4|) (<= 2000 main_~k~0) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= main_~n~0 main_~j~0)) [2020-07-18 06:38:21,699 INFO L264 CegarLoopResult]: At program point L38-2(line 38) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 2000 |main_#t~post4|) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 1999 main_~k~0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= main_~n~0 main_~j~0)) [2020-07-18 06:38:21,699 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= main_~n~0 1) (<= 1 main_~i~0)) [2020-07-18 06:38:21,699 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 41) the Hoare annotation is: true [2020-07-18 06:38:21,699 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 2000 (+ main_~c2~0 main_~k~0)) (<= 1 main_~i~0)) [2020-07-18 06:38:21,700 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-07-18 06:38:21,700 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 10000 (+ main_~c3~0 main_~k~0)) (<= 4000 (+ main_~c1~0 main_~k~0)) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 2000 (+ main_~c2~0 main_~k~0))) [2020-07-18 06:38:21,700 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,700 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,700 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-18 06:38:21,700 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-18 06:38:21,700 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 06:38:21,701 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 06:38:21,701 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:38:21,701 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 06:38:21,701 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 06:38:21,701 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:38:21,706 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 06:38:21,709 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:38:21,710 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:38:21,711 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 06:38:21,711 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 06:38:21,741 INFO L163 areAnnotationChecker]: CFG has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 06:38:21,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:38:21 BoogieIcfgContainer [2020-07-18 06:38:21,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:38:21,761 INFO L168 Benchmark]: Toolchain (without parser) took 13730.28 ms. Allocated memory was 146.3 MB in the beginning and 359.7 MB in the end (delta: 213.4 MB). Free memory was 104.1 MB in the beginning and 107.6 MB in the end (delta: -3.5 MB). Peak memory consumption was 209.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:21,762 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.8 MB in the beginning and 122.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 06:38:21,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.19 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 93.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:21,763 INFO L168 Benchmark]: Boogie Preprocessor took 141.35 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.6 MB in the beginning and 182.6 MB in the end (delta: -89.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:21,764 INFO L168 Benchmark]: RCFGBuilder took 500.74 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 157.3 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:21,764 INFO L168 Benchmark]: TraceAbstraction took 12826.43 ms. Allocated memory was 203.4 MB in the beginning and 359.7 MB in the end (delta: 156.2 MB). Free memory was 156.7 MB in the beginning and 107.6 MB in the end (delta: 49.1 MB). Peak memory consumption was 205.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:21,768 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.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.8 MB in the beginning and 122.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 255.19 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 93.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.35 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.6 MB in the beginning and 182.6 MB in the end (delta: -89.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 500.74 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 157.3 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12826.43 ms. Allocated memory was 203.4 MB in the beginning and 359.7 MB in the end (delta: 156.2 MB). Free memory was 156.7 MB in the beginning and 107.6 MB in the end (delta: 49.1 MB). Peak memory consumption was 205.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((i <= 0 && 10000 <= c3) && 10000 <= c3 + k) && 0 <= i) && 4000 <= c1 + k) && 4000 <= c1) && 2000 <= c2) && 2000 <= c2 + k) || (((((10000 <= c3 && 2000 <= k) && 4000 <= c1) && 2000 <= c2) && 1 <= i) && n <= 1) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((i <= 0 && n <= 0) && n <= j) || ((((((10000 <= c3 && n <= j + 1) && 2000 <= k) && 2000 <= c2) && 4000 <= c1) && 1 <= i) && n <= 1)) || ((((((10000 <= c3 && 4000 <= c1) && 2000 <= c2) && 1999 <= k) && 1 <= i) && n <= 1) && n <= j) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.0s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 564 SDtfs, 482 SDslu, 1848 SDs, 0 SdLazy, 473 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 125 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 97 PreInvPairs, 130 NumberOfFragments, 838 HoareAnnotationTreeSize, 97 FomulaSimplifications, 4010 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 55 FomulaSimplificationsInter, 1153 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 45031 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 37/50 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...