/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-46f3038-m [2020-07-08 23:40:02,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:40:02,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:40:02,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:40:02,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:40:02,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:40:02,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:40:02,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:40:02,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:40:02,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:40:02,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:40:02,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:40:02,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:40:02,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:40:02,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:40:02,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:40:02,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:40:02,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:40:02,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:40:02,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:40:02,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:40:02,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:40:02,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:40:02,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:40:02,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:40:02,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:40:02,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:40:02,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:40:02,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:40:02,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:40:02,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:40:02,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:40:02,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:40:02,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:40:02,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:40:02,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:40:02,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:40:02,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:40:02,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:40:02,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:40:02,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:40:02,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:40:02,425 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:40:02,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:40:02,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:40:02,432 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:40:02,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:40:02,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:40:02,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:40:02,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:40:02,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:40:02,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:40:02,433 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:40:02,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:40:02,436 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:40:02,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:40:02,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:40:02,436 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:40:02,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:40:02,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:40:02,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:40:02,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:40:02,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:40:02,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:40:02,440 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-08 23:40:02,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:40:02,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:40:02,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:40:02,819 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:40:02,819 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:40:02,820 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-08 23:40:02,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc26303c/8bcc7266c49545219bba0bf57990d41d/FLAGc0d4d008f [2020-07-08 23:40:03,472 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:40:03,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2020-07-08 23:40:03,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc26303c/8bcc7266c49545219bba0bf57990d41d/FLAGc0d4d008f [2020-07-08 23:40:03,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc26303c/8bcc7266c49545219bba0bf57990d41d [2020-07-08 23:40:03,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:40:03,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:40:03,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:40:03,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:40:03,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:40:03,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:40:03" (1/1) ... [2020-07-08 23:40:03,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf67ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:03, skipping insertion in model container [2020-07-08 23:40:03,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:40:03" (1/1) ... [2020-07-08 23:40:03,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:40:03,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:40:04,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:40:04,132 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:40:04,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:40:04,173 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:40:04,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04 WrapperNode [2020-07-08 23:40:04,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:40:04,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:40:04,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:40:04,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:40:04,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04" (1/1) ... [2020-07-08 23:40:04,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04" (1/1) ... [2020-07-08 23:40:04,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04" (1/1) ... [2020-07-08 23:40:04,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04" (1/1) ... [2020-07-08 23:40:04,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04" (1/1) ... [2020-07-08 23:40:04,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04" (1/1) ... [2020-07-08 23:40:04,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04" (1/1) ... [2020-07-08 23:40:04,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:40:04,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:40:04,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:40:04,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:40:04,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:40:04,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:40:04,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:40:04,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:40:04,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:40:04,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:40:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:40:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:40:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:40:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:40:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:40:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:40:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:40:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:40:04,895 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:40:04,896 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 23:40:04,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:40:04 BoogieIcfgContainer [2020-07-08 23:40:04,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:40:04,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:40:04,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:40:04,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:40:04,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:40:03" (1/3) ... [2020-07-08 23:40:04,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cb0ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:40:04, skipping insertion in model container [2020-07-08 23:40:04,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:40:04" (2/3) ... [2020-07-08 23:40:04,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cb0ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:40:04, skipping insertion in model container [2020-07-08 23:40:04,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:40:04" (3/3) ... [2020-07-08 23:40:04,914 INFO L109 eAbstractionObserver]: Analyzing ICFG large_const.i [2020-07-08 23:40:04,926 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:40:04,936 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:40:04,952 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:40:04,976 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:40:04,976 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:40:04,977 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:40:04,977 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:40:04,979 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:40:04,979 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:40:04,979 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:40:04,979 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:40:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-08 23:40:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 23:40:05,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:05,015 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-08 23:40:05,016 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash 288343897, now seen corresponding path program 1 times [2020-07-08 23:40:05,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:05,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068868254] [2020-07-08 23:40:05,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-08 23:40:05,200 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {58#true} {58#true} #104#return; {58#true} is VALID [2020-07-08 23:40:05,204 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2020-07-08 23:40:05,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-08 23:40:05,206 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #104#return; {58#true} is VALID [2020-07-08 23:40:05,206 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-08 23:40:05,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {58#true} ~argc := #in~argc; {58#true} is VALID [2020-07-08 23:40:05,207 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {58#true} is VALID [2020-07-08 23:40:05,208 INFO L280 TraceCheckUtils]: 6: Hoare triple {58#true} ~c1~0 := 4000; {58#true} is VALID [2020-07-08 23:40:05,209 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#true} ~c2~0 := 2000; {58#true} is VALID [2020-07-08 23:40:05,209 INFO L280 TraceCheckUtils]: 8: Hoare triple {58#true} ~c3~0 := 10000; {58#true} is VALID [2020-07-08 23:40:05,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#true} havoc ~n~0; {58#true} is VALID [2020-07-08 23:40:05,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#true} havoc ~v~0; {58#true} is VALID [2020-07-08 23:40:05,210 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#true} havoc ~i~0; {58#true} is VALID [2020-07-08 23:40:05,211 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#true} havoc ~k~0; {58#true} is VALID [2020-07-08 23:40:05,211 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#true} havoc ~j~0; {58#true} is VALID [2020-07-08 23:40:05,212 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {58#true} is VALID [2020-07-08 23:40:05,212 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#true} ~n~0 := #t~nondet0; {58#true} is VALID [2020-07-08 23:40:05,212 INFO L280 TraceCheckUtils]: 16: Hoare triple {58#true} havoc #t~nondet0; {58#true} is VALID [2020-07-08 23:40:05,213 INFO L280 TraceCheckUtils]: 17: Hoare triple {58#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {58#true} is VALID [2020-07-08 23:40:05,213 INFO L280 TraceCheckUtils]: 18: Hoare triple {58#true} ~k~0 := 0; {58#true} is VALID [2020-07-08 23:40:05,214 INFO L280 TraceCheckUtils]: 19: Hoare triple {58#true} ~i~0 := 0; {58#true} is VALID [2020-07-08 23:40:05,215 INFO L280 TraceCheckUtils]: 20: Hoare triple {58#true} assume !true; {59#false} is VALID [2020-07-08 23:40:05,216 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} ~j~0 := 0; {59#false} is VALID [2020-07-08 23:40:05,216 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume !!(~j~0 < ~n~0); {59#false} is VALID [2020-07-08 23:40:05,217 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-08 23:40:05,217 INFO L280 TraceCheckUtils]: 24: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-08 23:40:05,218 INFO L280 TraceCheckUtils]: 25: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-08 23:40:05,218 INFO L280 TraceCheckUtils]: 26: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-08 23:40:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:05,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068868254] [2020-07-08 23:40:05,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:05,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 23:40:05,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611341166] [2020-07-08 23:40:05,241 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2020-07-08 23:40:05,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:05,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 23:40:05,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:05,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 23:40:05,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:05,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 23:40:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:40:05,333 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-07-08 23:40:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:05,521 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2020-07-08 23:40:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 23:40:05,521 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2020-07-08 23:40:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:40:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2020-07-08 23:40:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:40:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2020-07-08 23:40:05,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2020-07-08 23:40:05,728 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-08 23:40:05,741 INFO L225 Difference]: With dead ends: 75 [2020-07-08 23:40:05,741 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 23:40:05,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:40:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 23:40:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-08 23:40:05,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:05,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-08 23:40:05,835 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-08 23:40:05,836 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-08 23:40:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:05,844 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-08 23:40:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-08 23:40:05,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:05,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:05,846 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-08 23:40:05,846 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-08 23:40:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:05,853 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-08 23:40:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-08 23:40:05,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:05,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:05,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:05,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-08 23:40:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-07-08 23:40:05,862 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 27 [2020-07-08 23:40:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:05,863 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-07-08 23:40:05,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 23:40:05,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 51 transitions. [2020-07-08 23:40:05,976 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-08 23:40:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-08 23:40:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 23:40:05,978 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:05,978 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-08 23:40:05,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:40:05,979 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash 320540924, now seen corresponding path program 1 times [2020-07-08 23:40:05,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:05,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [524085483] [2020-07-08 23:40:05,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:06,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-08 23:40:06,159 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {406#true} {406#true} #104#return; {406#true} is VALID [2020-07-08 23:40:06,159 INFO L263 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {406#true} is VALID [2020-07-08 23:40:06,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-08 23:40:06,160 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #104#return; {406#true} is VALID [2020-07-08 23:40:06,160 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-08 23:40:06,161 INFO L280 TraceCheckUtils]: 4: Hoare triple {406#true} ~argc := #in~argc; {406#true} is VALID [2020-07-08 23:40:06,161 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {406#true} is VALID [2020-07-08 23:40:06,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {406#true} ~c1~0 := 4000; {406#true} is VALID [2020-07-08 23:40:06,162 INFO L280 TraceCheckUtils]: 7: Hoare triple {406#true} ~c2~0 := 2000; {406#true} is VALID [2020-07-08 23:40:06,162 INFO L280 TraceCheckUtils]: 8: Hoare triple {406#true} ~c3~0 := 10000; {406#true} is VALID [2020-07-08 23:40:06,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#true} havoc ~n~0; {406#true} is VALID [2020-07-08 23:40:06,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#true} havoc ~v~0; {406#true} is VALID [2020-07-08 23:40:06,163 INFO L280 TraceCheckUtils]: 11: Hoare triple {406#true} havoc ~i~0; {406#true} is VALID [2020-07-08 23:40:06,163 INFO L280 TraceCheckUtils]: 12: Hoare triple {406#true} havoc ~k~0; {406#true} is VALID [2020-07-08 23:40:06,164 INFO L280 TraceCheckUtils]: 13: Hoare triple {406#true} havoc ~j~0; {406#true} is VALID [2020-07-08 23:40:06,164 INFO L280 TraceCheckUtils]: 14: Hoare triple {406#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {406#true} is VALID [2020-07-08 23:40:06,164 INFO L280 TraceCheckUtils]: 15: Hoare triple {406#true} ~n~0 := #t~nondet0; {406#true} is VALID [2020-07-08 23:40:06,165 INFO L280 TraceCheckUtils]: 16: Hoare triple {406#true} havoc #t~nondet0; {406#true} is VALID [2020-07-08 23:40:06,165 INFO L280 TraceCheckUtils]: 17: Hoare triple {406#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {406#true} is VALID [2020-07-08 23:40:06,165 INFO L280 TraceCheckUtils]: 18: Hoare triple {406#true} ~k~0 := 0; {406#true} is VALID [2020-07-08 23:40:06,167 INFO L280 TraceCheckUtils]: 19: Hoare triple {406#true} ~i~0 := 0; {410#(<= main_~i~0 0)} is VALID [2020-07-08 23:40:06,168 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-08 23:40:06,170 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-08 23:40:06,171 INFO L280 TraceCheckUtils]: 22: Hoare triple {412#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {407#false} is VALID [2020-07-08 23:40:06,172 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-08 23:40:06,172 INFO L280 TraceCheckUtils]: 24: Hoare triple {407#false} ~cond := #in~cond; {407#false} is VALID [2020-07-08 23:40:06,173 INFO L280 TraceCheckUtils]: 25: Hoare triple {407#false} assume 0 == ~cond; {407#false} is VALID [2020-07-08 23:40:06,173 INFO L280 TraceCheckUtils]: 26: Hoare triple {407#false} assume !false; {407#false} is VALID [2020-07-08 23:40:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:06,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [524085483] [2020-07-08 23:40:06,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:06,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:40:06,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457889266] [2020-07-08 23:40:06,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-08 23:40:06,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:06,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:40:06,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:06,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:40:06,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:06,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:40:06,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:40:06,224 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2020-07-08 23:40:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:06,649 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-08 23:40:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 23:40:06,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-08 23:40:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:40:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-08 23:40:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:40:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-08 23:40:06,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2020-07-08 23:40:06,775 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-08 23:40:06,779 INFO L225 Difference]: With dead ends: 67 [2020-07-08 23:40:06,779 INFO L226 Difference]: Without dead ends: 51 [2020-07-08 23:40:06,781 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-08 23:40:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-08 23:40:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-07-08 23:40:06,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:06,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2020-07-08 23:40:06,823 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2020-07-08 23:40:06,823 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2020-07-08 23:40:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:06,827 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-08 23:40:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-08 23:40:06,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:06,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:06,829 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2020-07-08 23:40:06,830 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2020-07-08 23:40:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:06,833 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-08 23:40:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-08 23:40:06,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:06,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:06,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:06,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-08 23:40:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2020-07-08 23:40:06,839 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2020-07-08 23:40:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:06,839 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2020-07-08 23:40:06,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:40:06,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 52 transitions. [2020-07-08 23:40:06,903 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-08 23:40:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-08 23:40:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 23:40:06,905 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:06,905 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-08 23:40:06,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:40:06,906 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:06,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:06,907 INFO L82 PathProgramCache]: Analyzing trace with hash 751787059, now seen corresponding path program 1 times [2020-07-08 23:40:06,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:06,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [747520876] [2020-07-08 23:40:06,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:07,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {753#true} assume true; {753#true} is VALID [2020-07-08 23:40:07,067 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {753#true} {753#true} #104#return; {753#true} is VALID [2020-07-08 23:40:07,068 INFO L263 TraceCheckUtils]: 0: Hoare triple {753#true} call ULTIMATE.init(); {753#true} is VALID [2020-07-08 23:40:07,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {753#true} assume true; {753#true} is VALID [2020-07-08 23:40:07,069 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {753#true} {753#true} #104#return; {753#true} is VALID [2020-07-08 23:40:07,069 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-08 23:40:07,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {753#true} ~argc := #in~argc; {753#true} is VALID [2020-07-08 23:40:07,070 INFO L280 TraceCheckUtils]: 5: Hoare triple {753#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {753#true} is VALID [2020-07-08 23:40:07,072 INFO L280 TraceCheckUtils]: 6: Hoare triple {753#true} ~c1~0 := 4000; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,073 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#(<= 4000 main_~c1~0)} ~c2~0 := 2000; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,074 INFO L280 TraceCheckUtils]: 8: Hoare triple {757#(<= 4000 main_~c1~0)} ~c3~0 := 10000; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,075 INFO L280 TraceCheckUtils]: 9: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~n~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,076 INFO L280 TraceCheckUtils]: 10: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~v~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,077 INFO L280 TraceCheckUtils]: 11: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~i~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,078 INFO L280 TraceCheckUtils]: 12: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~k~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,079 INFO L280 TraceCheckUtils]: 13: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~j~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,080 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-08 23:40:07,082 INFO L280 TraceCheckUtils]: 15: Hoare triple {757#(<= 4000 main_~c1~0)} ~n~0 := #t~nondet0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,083 INFO L280 TraceCheckUtils]: 16: Hoare triple {757#(<= 4000 main_~c1~0)} havoc #t~nondet0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:07,084 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-08 23:40:07,086 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-08 23:40:07,087 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-08 23:40:07,088 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-08 23:40:07,089 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-08 23:40:07,090 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-08 23:40:07,090 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-08 23:40:07,091 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-08 23:40:07,093 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-08 23:40:07,101 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-08 23:40:07,103 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-08 23:40:07,104 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-08 23:40:07,105 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-08 23:40:07,106 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-08 23:40:07,109 INFO L280 TraceCheckUtils]: 31: Hoare triple {759#(<= 4000 main_~k~0)} ~j~0 := 0; {759#(<= 4000 main_~k~0)} is VALID [2020-07-08 23:40:07,114 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-08 23:40:07,117 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-08 23:40:07,119 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-08 23:40:07,119 INFO L280 TraceCheckUtils]: 35: Hoare triple {761#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {754#false} is VALID [2020-07-08 23:40:07,120 INFO L280 TraceCheckUtils]: 36: Hoare triple {754#false} assume !false; {754#false} is VALID [2020-07-08 23:40:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:07,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [747520876] [2020-07-08 23:40:07,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:07,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 23:40:07,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298980779] [2020-07-08 23:40:07,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-08 23:40:07,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:07,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:40:07,188 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-08 23:40:07,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:40:07,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:40:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:40:07,190 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 7 states. [2020-07-08 23:40:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:07,844 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2020-07-08 23:40:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 23:40:07,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-08 23:40:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-08 23:40:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-08 23:40:07,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2020-07-08 23:40:07,994 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-08 23:40:07,999 INFO L225 Difference]: With dead ends: 88 [2020-07-08 23:40:07,999 INFO L226 Difference]: Without dead ends: 86 [2020-07-08 23:40:08,000 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:40:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-08 23:40:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2020-07-08 23:40:08,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:08,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 66 states. [2020-07-08 23:40:08,094 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 66 states. [2020-07-08 23:40:08,094 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 66 states. [2020-07-08 23:40:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:08,099 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2020-07-08 23:40:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-07-08 23:40:08,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:08,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:08,101 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 86 states. [2020-07-08 23:40:08,101 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 86 states. [2020-07-08 23:40:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:08,106 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2020-07-08 23:40:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-07-08 23:40:08,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:08,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:08,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:08,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-08 23:40:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-07-08 23:40:08,111 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 37 [2020-07-08 23:40:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:08,112 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-07-08 23:40:08,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:40:08,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 71 transitions. [2020-07-08 23:40:08,216 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-08 23:40:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-07-08 23:40:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 23:40:08,218 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:08,219 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-08 23:40:08,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:40:08,219 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:08,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:08,220 INFO L82 PathProgramCache]: Analyzing trace with hash 3796503, now seen corresponding path program 1 times [2020-07-08 23:40:08,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:08,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1941915852] [2020-07-08 23:40:08,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:08,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {1250#true} assume true; {1250#true} is VALID [2020-07-08 23:40:08,346 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1250#true} {1250#true} #104#return; {1250#true} is VALID [2020-07-08 23:40:08,346 INFO L263 TraceCheckUtils]: 0: Hoare triple {1250#true} call ULTIMATE.init(); {1250#true} is VALID [2020-07-08 23:40:08,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {1250#true} assume true; {1250#true} is VALID [2020-07-08 23:40:08,347 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1250#true} {1250#true} #104#return; {1250#true} is VALID [2020-07-08 23:40:08,347 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-08 23:40:08,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {1250#true} ~argc := #in~argc; {1250#true} is VALID [2020-07-08 23:40:08,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {1250#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {1250#true} is VALID [2020-07-08 23:40:08,348 INFO L280 TraceCheckUtils]: 6: Hoare triple {1250#true} ~c1~0 := 4000; {1250#true} is VALID [2020-07-08 23:40:08,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {1250#true} ~c2~0 := 2000; {1250#true} is VALID [2020-07-08 23:40:08,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {1250#true} ~c3~0 := 10000; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:08,354 INFO L280 TraceCheckUtils]: 9: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~n~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:08,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~v~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:08,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~i~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:08,356 INFO L280 TraceCheckUtils]: 12: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~k~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:08,356 INFO L280 TraceCheckUtils]: 13: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~j~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:08,357 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-08 23:40:08,357 INFO L280 TraceCheckUtils]: 15: Hoare triple {1254#(<= 10000 main_~c3~0)} ~n~0 := #t~nondet0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:08,358 INFO L280 TraceCheckUtils]: 16: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc #t~nondet0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:08,359 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-08 23:40:08,360 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-08 23:40:08,361 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-08 23:40:08,362 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-08 23:40:08,363 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-08 23:40:08,369 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-08 23:40:08,370 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-08 23:40:08,371 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-08 23:40:08,372 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-08 23:40:08,373 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-08 23:40:08,373 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-08 23:40:08,374 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-08 23:40:08,375 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-08 23:40:08,376 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-08 23:40:08,377 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-08 23:40:08,394 INFO L280 TraceCheckUtils]: 32: Hoare triple {1256#(<= 10000 main_~k~0)} ~j~0 := 0; {1256#(<= 10000 main_~k~0)} is VALID [2020-07-08 23:40:08,394 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-08 23:40:08,396 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-08 23:40:08,396 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-08 23:40:08,397 INFO L280 TraceCheckUtils]: 36: Hoare triple {1258#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1251#false} is VALID [2020-07-08 23:40:08,397 INFO L280 TraceCheckUtils]: 37: Hoare triple {1251#false} assume !false; {1251#false} is VALID [2020-07-08 23:40:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:08,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1941915852] [2020-07-08 23:40:08,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:08,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 23:40:08,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949064172] [2020-07-08 23:40:08,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 23:40:08,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:08,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:40:08,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:08,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:40:08,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:08,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:40:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:40:08,453 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 7 states. [2020-07-08 23:40:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:09,138 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2020-07-08 23:40:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 23:40:09,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 23:40:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-08 23:40:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-08 23:40:09,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2020-07-08 23:40:09,276 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-08 23:40:09,280 INFO L225 Difference]: With dead ends: 105 [2020-07-08 23:40:09,280 INFO L226 Difference]: Without dead ends: 103 [2020-07-08 23:40:09,282 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-08 23:40:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-08 23:40:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2020-07-08 23:40:09,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:09,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 85 states. [2020-07-08 23:40:09,471 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 85 states. [2020-07-08 23:40:09,471 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 85 states. [2020-07-08 23:40:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:09,477 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-07-08 23:40:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-07-08 23:40:09,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:09,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:09,478 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 103 states. [2020-07-08 23:40:09,478 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 103 states. [2020-07-08 23:40:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:09,484 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-07-08 23:40:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-07-08 23:40:09,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:09,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:09,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:09,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-08 23:40:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-08 23:40:09,490 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 38 [2020-07-08 23:40:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:09,490 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-08 23:40:09,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:40:09,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-08 23:40:09,631 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-08 23:40:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-08 23:40:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 23:40:09,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:09,633 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-08 23:40:09,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:40:09,633 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash 197728887, now seen corresponding path program 1 times [2020-07-08 23:40:09,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:09,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1471469412] [2020-07-08 23:40:09,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:09,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-08 23:40:09,759 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1853#true} {1853#true} #104#return; {1853#true} is VALID [2020-07-08 23:40:09,759 INFO L263 TraceCheckUtils]: 0: Hoare triple {1853#true} call ULTIMATE.init(); {1853#true} is VALID [2020-07-08 23:40:09,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-08 23:40:09,759 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1853#true} {1853#true} #104#return; {1853#true} is VALID [2020-07-08 23:40:09,759 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-08 23:40:09,760 INFO L280 TraceCheckUtils]: 4: Hoare triple {1853#true} ~argc := #in~argc; {1853#true} is VALID [2020-07-08 23:40:09,760 INFO L280 TraceCheckUtils]: 5: Hoare triple {1853#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {1853#true} is VALID [2020-07-08 23:40:09,760 INFO L280 TraceCheckUtils]: 6: Hoare triple {1853#true} ~c1~0 := 4000; {1853#true} is VALID [2020-07-08 23:40:09,761 INFO L280 TraceCheckUtils]: 7: Hoare triple {1853#true} ~c2~0 := 2000; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:09,761 INFO L280 TraceCheckUtils]: 8: Hoare triple {1857#(<= 2000 main_~c2~0)} ~c3~0 := 10000; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:09,761 INFO L280 TraceCheckUtils]: 9: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~n~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:09,762 INFO L280 TraceCheckUtils]: 10: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~v~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:09,762 INFO L280 TraceCheckUtils]: 11: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~i~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:09,763 INFO L280 TraceCheckUtils]: 12: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~k~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:09,763 INFO L280 TraceCheckUtils]: 13: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~j~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:09,764 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-08 23:40:09,764 INFO L280 TraceCheckUtils]: 15: Hoare triple {1857#(<= 2000 main_~c2~0)} ~n~0 := #t~nondet0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:09,764 INFO L280 TraceCheckUtils]: 16: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc #t~nondet0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:09,765 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-08 23:40:09,766 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-08 23:40:09,766 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-08 23:40:09,767 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-08 23:40:09,767 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-08 23:40:09,768 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-08 23:40:09,769 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-08 23:40:09,770 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-08 23:40:09,770 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-08 23:40:09,771 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-08 23:40:09,771 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-08 23:40:09,772 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-08 23:40:09,773 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-08 23:40:09,773 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-08 23:40:09,774 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-08 23:40:09,775 INFO L280 TraceCheckUtils]: 32: Hoare triple {1859#(<= 2000 main_~k~0)} ~j~0 := 0; {1859#(<= 2000 main_~k~0)} is VALID [2020-07-08 23:40:09,775 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-08 23:40:09,776 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-08 23:40:09,784 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-08 23:40:09,785 INFO L280 TraceCheckUtils]: 36: Hoare triple {1861#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1854#false} is VALID [2020-07-08 23:40:09,785 INFO L280 TraceCheckUtils]: 37: Hoare triple {1854#false} assume !false; {1854#false} is VALID [2020-07-08 23:40:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:40:09,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1471469412] [2020-07-08 23:40:09,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:09,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 23:40:09,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18775374] [2020-07-08 23:40:09,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 23:40:09,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:09,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:40:09,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:09,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:40:09,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:09,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:40:09,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:40:09,837 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2020-07-08 23:40:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:10,589 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2020-07-08 23:40:10,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 23:40:10,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 23:40:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-08 23:40:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:40:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-08 23:40:10,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2020-07-08 23:40:10,711 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-08 23:40:10,714 INFO L225 Difference]: With dead ends: 116 [2020-07-08 23:40:10,715 INFO L226 Difference]: Without dead ends: 114 [2020-07-08 23:40:10,716 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-08 23:40:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-08 23:40:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2020-07-08 23:40:10,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:10,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 97 states. [2020-07-08 23:40:10,934 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 97 states. [2020-07-08 23:40:10,935 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 97 states. [2020-07-08 23:40:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:10,940 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2020-07-08 23:40:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2020-07-08 23:40:10,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:10,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:10,941 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 114 states. [2020-07-08 23:40:10,941 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 114 states. [2020-07-08 23:40:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:10,946 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2020-07-08 23:40:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2020-07-08 23:40:10,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:10,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:10,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:10,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-08 23:40:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2020-07-08 23:40:10,951 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 38 [2020-07-08 23:40:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:10,951 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2020-07-08 23:40:10,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:40:10,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 110 transitions. [2020-07-08 23:40:11,126 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-08 23:40:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2020-07-08 23:40:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 23:40:11,128 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:11,129 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-08 23:40:11,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:40:11,130 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash 88652198, now seen corresponding path program 1 times [2020-07-08 23:40:11,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:11,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644603844] [2020-07-08 23:40:11,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:11,317 INFO L280 TraceCheckUtils]: 0: Hoare triple {2524#true} assume true; {2524#true} is VALID [2020-07-08 23:40:11,318 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2524#true} {2524#true} #104#return; {2524#true} is VALID [2020-07-08 23:40:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:11,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2020-07-08 23:40:11,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2020-07-08 23:40:11,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {2524#true} assume true; {2524#true} is VALID [2020-07-08 23:40:11,336 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2524#true} {2530#(<= 4000 main_~k~0)} #108#return; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-08 23:40:11,337 INFO L263 TraceCheckUtils]: 0: Hoare triple {2524#true} call ULTIMATE.init(); {2524#true} is VALID [2020-07-08 23:40:11,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {2524#true} assume true; {2524#true} is VALID [2020-07-08 23:40:11,338 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2524#true} {2524#true} #104#return; {2524#true} is VALID [2020-07-08 23:40:11,338 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-08 23:40:11,338 INFO L280 TraceCheckUtils]: 4: Hoare triple {2524#true} ~argc := #in~argc; {2524#true} is VALID [2020-07-08 23:40:11,338 INFO L280 TraceCheckUtils]: 5: Hoare triple {2524#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {2524#true} is VALID [2020-07-08 23:40:11,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {2524#true} ~c1~0 := 4000; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,342 INFO L280 TraceCheckUtils]: 7: Hoare triple {2528#(<= 4000 main_~c1~0)} ~c2~0 := 2000; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,343 INFO L280 TraceCheckUtils]: 8: Hoare triple {2528#(<= 4000 main_~c1~0)} ~c3~0 := 10000; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,348 INFO L280 TraceCheckUtils]: 9: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~n~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,349 INFO L280 TraceCheckUtils]: 10: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~v~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,349 INFO L280 TraceCheckUtils]: 11: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~i~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,350 INFO L280 TraceCheckUtils]: 12: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~k~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,351 INFO L280 TraceCheckUtils]: 13: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc ~j~0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,351 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-08 23:40:11,352 INFO L280 TraceCheckUtils]: 15: Hoare triple {2528#(<= 4000 main_~c1~0)} ~n~0 := #t~nondet0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,352 INFO L280 TraceCheckUtils]: 16: Hoare triple {2528#(<= 4000 main_~c1~0)} havoc #t~nondet0; {2528#(<= 4000 main_~c1~0)} is VALID [2020-07-08 23:40:11,353 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-08 23:40:11,354 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-08 23:40:11,354 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-08 23:40:11,362 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-08 23:40:11,363 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-08 23:40:11,364 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-08 23:40:11,364 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-08 23:40:11,365 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-08 23:40:11,366 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-08 23:40:11,367 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-08 23:40:11,368 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-08 23:40:11,369 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-08 23:40:11,370 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-08 23:40:11,370 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-08 23:40:11,371 INFO L280 TraceCheckUtils]: 31: Hoare triple {2530#(<= 4000 main_~k~0)} ~j~0 := 0; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-08 23:40:11,371 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-08 23:40:11,371 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-08 23:40:11,372 INFO L280 TraceCheckUtils]: 34: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2020-07-08 23:40:11,372 INFO L280 TraceCheckUtils]: 35: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2020-07-08 23:40:11,372 INFO L280 TraceCheckUtils]: 36: Hoare triple {2524#true} assume true; {2524#true} is VALID [2020-07-08 23:40:11,373 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2524#true} {2530#(<= 4000 main_~k~0)} #108#return; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-08 23:40:11,373 INFO L280 TraceCheckUtils]: 38: Hoare triple {2530#(<= 4000 main_~k~0)} #t~post3 := ~j~0; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-08 23:40:11,374 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-08 23:40:11,375 INFO L280 TraceCheckUtils]: 40: Hoare triple {2530#(<= 4000 main_~k~0)} havoc #t~post3; {2530#(<= 4000 main_~k~0)} is VALID [2020-07-08 23:40:11,376 INFO L280 TraceCheckUtils]: 41: Hoare triple {2530#(<= 4000 main_~k~0)} #t~post4 := ~k~0; {2535#(<= 4000 |main_#t~post4|)} is VALID [2020-07-08 23:40:11,377 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-08 23:40:11,378 INFO L280 TraceCheckUtils]: 43: Hoare triple {2536#(<= 3999 main_~k~0)} havoc #t~post4; {2536#(<= 3999 main_~k~0)} is VALID [2020-07-08 23:40:11,379 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-08 23:40:11,381 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-08 23:40:11,382 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-08 23:40:11,383 INFO L280 TraceCheckUtils]: 47: Hoare triple {2538#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2525#false} is VALID [2020-07-08 23:40:11,383 INFO L280 TraceCheckUtils]: 48: Hoare triple {2525#false} assume !false; {2525#false} is VALID [2020-07-08 23:40:11,386 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-08 23:40:11,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1644603844] [2020-07-08 23:40:11,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:11,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 23:40:11,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130379870] [2020-07-08 23:40:11,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-08 23:40:11,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:11,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:40:11,443 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-08 23:40:11,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:40:11,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:40:11,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:40:11,445 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 9 states. [2020-07-08 23:40:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:12,372 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2020-07-08 23:40:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 23:40:12,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-07-08 23:40:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2020-07-08 23:40:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2020-07-08 23:40:12,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 105 transitions. [2020-07-08 23:40:12,513 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-08 23:40:12,517 INFO L225 Difference]: With dead ends: 129 [2020-07-08 23:40:12,517 INFO L226 Difference]: Without dead ends: 127 [2020-07-08 23:40:12,518 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-08 23:40:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-08 23:40:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2020-07-08 23:40:12,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:12,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 110 states. [2020-07-08 23:40:12,845 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 110 states. [2020-07-08 23:40:12,845 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 110 states. [2020-07-08 23:40:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:12,851 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2020-07-08 23:40:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2020-07-08 23:40:12,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:12,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:12,852 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 127 states. [2020-07-08 23:40:12,852 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 127 states. [2020-07-08 23:40:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:12,857 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2020-07-08 23:40:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2020-07-08 23:40:12,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:12,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:12,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:12,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-08 23:40:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2020-07-08 23:40:12,862 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 49 [2020-07-08 23:40:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:12,863 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2020-07-08 23:40:12,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:40:12,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 123 transitions. [2020-07-08 23:40:13,038 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-08 23:40:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2020-07-08 23:40:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 23:40:13,040 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:13,040 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-08 23:40:13,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:40:13,041 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1084443264, now seen corresponding path program 1 times [2020-07-08 23:40:13,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:13,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205487967] [2020-07-08 23:40:13,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:13,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {3285#true} assume true; {3285#true} is VALID [2020-07-08 23:40:13,110 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3285#true} {3285#true} #104#return; {3285#true} is VALID [2020-07-08 23:40:13,110 INFO L263 TraceCheckUtils]: 0: Hoare triple {3285#true} call ULTIMATE.init(); {3285#true} is VALID [2020-07-08 23:40:13,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {3285#true} assume true; {3285#true} is VALID [2020-07-08 23:40:13,111 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3285#true} {3285#true} #104#return; {3285#true} is VALID [2020-07-08 23:40:13,111 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-08 23:40:13,111 INFO L280 TraceCheckUtils]: 4: Hoare triple {3285#true} ~argc := #in~argc; {3285#true} is VALID [2020-07-08 23:40:13,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {3285#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {3285#true} is VALID [2020-07-08 23:40:13,111 INFO L280 TraceCheckUtils]: 6: Hoare triple {3285#true} ~c1~0 := 4000; {3285#true} is VALID [2020-07-08 23:40:13,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {3285#true} ~c2~0 := 2000; {3285#true} is VALID [2020-07-08 23:40:13,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {3285#true} ~c3~0 := 10000; {3285#true} is VALID [2020-07-08 23:40:13,112 INFO L280 TraceCheckUtils]: 9: Hoare triple {3285#true} havoc ~n~0; {3285#true} is VALID [2020-07-08 23:40:13,112 INFO L280 TraceCheckUtils]: 10: Hoare triple {3285#true} havoc ~v~0; {3285#true} is VALID [2020-07-08 23:40:13,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {3285#true} havoc ~i~0; {3285#true} is VALID [2020-07-08 23:40:13,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {3285#true} havoc ~k~0; {3285#true} is VALID [2020-07-08 23:40:13,112 INFO L280 TraceCheckUtils]: 13: Hoare triple {3285#true} havoc ~j~0; {3285#true} is VALID [2020-07-08 23:40:13,113 INFO L280 TraceCheckUtils]: 14: Hoare triple {3285#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3285#true} is VALID [2020-07-08 23:40:13,113 INFO L280 TraceCheckUtils]: 15: Hoare triple {3285#true} ~n~0 := #t~nondet0; {3285#true} is VALID [2020-07-08 23:40:13,113 INFO L280 TraceCheckUtils]: 16: Hoare triple {3285#true} havoc #t~nondet0; {3285#true} is VALID [2020-07-08 23:40:13,113 INFO L280 TraceCheckUtils]: 17: Hoare triple {3285#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {3285#true} is VALID [2020-07-08 23:40:13,113 INFO L280 TraceCheckUtils]: 18: Hoare triple {3285#true} ~k~0 := 0; {3285#true} is VALID [2020-07-08 23:40:13,115 INFO L280 TraceCheckUtils]: 19: Hoare triple {3285#true} ~i~0 := 0; {3289#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:13,117 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-08 23:40:13,119 INFO L280 TraceCheckUtils]: 21: Hoare triple {3289#(<= 0 main_~i~0)} #t~post1 := ~i~0; {3290#(<= 0 |main_#t~post1|)} is VALID [2020-07-08 23:40:13,121 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-08 23:40:13,121 INFO L280 TraceCheckUtils]: 23: Hoare triple {3291#(<= 1 main_~i~0)} havoc #t~post1; {3291#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:13,122 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-08 23:40:13,122 INFO L280 TraceCheckUtils]: 25: Hoare triple {3291#(<= 1 main_~i~0)} ~v~0 := #t~nondet2; {3291#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:13,122 INFO L280 TraceCheckUtils]: 26: Hoare triple {3291#(<= 1 main_~i~0)} havoc #t~nondet2; {3291#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:13,123 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-08 23:40:13,123 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-08 23:40:13,124 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-08 23:40:13,124 INFO L280 TraceCheckUtils]: 30: Hoare triple {3292#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0); {3286#false} is VALID [2020-07-08 23:40:13,124 INFO L280 TraceCheckUtils]: 31: Hoare triple {3286#false} #t~post1 := ~i~0; {3286#false} is VALID [2020-07-08 23:40:13,124 INFO L280 TraceCheckUtils]: 32: Hoare triple {3286#false} ~i~0 := 1 + #t~post1; {3286#false} is VALID [2020-07-08 23:40:13,125 INFO L280 TraceCheckUtils]: 33: Hoare triple {3286#false} havoc #t~post1; {3286#false} is VALID [2020-07-08 23:40:13,125 INFO L280 TraceCheckUtils]: 34: Hoare triple {3286#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3286#false} is VALID [2020-07-08 23:40:13,125 INFO L280 TraceCheckUtils]: 35: Hoare triple {3286#false} ~v~0 := #t~nondet2; {3286#false} is VALID [2020-07-08 23:40:13,125 INFO L280 TraceCheckUtils]: 36: Hoare triple {3286#false} havoc #t~nondet2; {3286#false} is VALID [2020-07-08 23:40:13,125 INFO L280 TraceCheckUtils]: 37: Hoare triple {3286#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {3286#false} is VALID [2020-07-08 23:40:13,125 INFO L280 TraceCheckUtils]: 38: Hoare triple {3286#false} assume !(0 == ~v~0); {3286#false} is VALID [2020-07-08 23:40:13,125 INFO L280 TraceCheckUtils]: 39: Hoare triple {3286#false} assume !(1 == ~v~0); {3286#false} is VALID [2020-07-08 23:40:13,126 INFO L280 TraceCheckUtils]: 40: Hoare triple {3286#false} ~k~0 := ~k~0 + ~c3~0; {3286#false} is VALID [2020-07-08 23:40:13,126 INFO L280 TraceCheckUtils]: 41: Hoare triple {3286#false} assume !(~i~0 < ~n~0); {3286#false} is VALID [2020-07-08 23:40:13,126 INFO L280 TraceCheckUtils]: 42: Hoare triple {3286#false} ~j~0 := 0; {3286#false} is VALID [2020-07-08 23:40:13,126 INFO L280 TraceCheckUtils]: 43: Hoare triple {3286#false} assume !!(~j~0 < ~n~0); {3286#false} is VALID [2020-07-08 23:40:13,126 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-08 23:40:13,126 INFO L280 TraceCheckUtils]: 45: Hoare triple {3286#false} ~cond := #in~cond; {3286#false} is VALID [2020-07-08 23:40:13,127 INFO L280 TraceCheckUtils]: 46: Hoare triple {3286#false} assume 0 == ~cond; {3286#false} is VALID [2020-07-08 23:40:13,127 INFO L280 TraceCheckUtils]: 47: Hoare triple {3286#false} assume !false; {3286#false} is VALID [2020-07-08 23:40:13,128 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-08 23:40:13,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205487967] [2020-07-08 23:40:13,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:13,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 23:40:13,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770601559] [2020-07-08 23:40:13,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2020-07-08 23:40:13,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:13,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 23:40:13,171 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-08 23:40:13,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 23:40:13,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 23:40:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:40:13,172 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 6 states. [2020-07-08 23:40:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:13,532 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2020-07-08 23:40:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 23:40:13,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2020-07-08 23:40:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:40:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2020-07-08 23:40:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:40:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2020-07-08 23:40:13,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2020-07-08 23:40:13,615 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-08 23:40:13,617 INFO L225 Difference]: With dead ends: 150 [2020-07-08 23:40:13,617 INFO L226 Difference]: Without dead ends: 70 [2020-07-08 23:40:13,619 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-08 23:40:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-08 23:40:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2020-07-08 23:40:13,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:13,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2020-07-08 23:40:13,785 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2020-07-08 23:40:13,785 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2020-07-08 23:40:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:13,788 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-07-08 23:40:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-07-08 23:40:13,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:13,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:13,788 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2020-07-08 23:40:13,788 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2020-07-08 23:40:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:13,791 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-07-08 23:40:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-07-08 23:40:13,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:13,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:13,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:13,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-08 23:40:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-07-08 23:40:13,793 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 48 [2020-07-08 23:40:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:13,794 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-07-08 23:40:13,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 23:40:13,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2020-07-08 23:40:13,911 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-08 23:40:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-08 23:40:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 23:40:13,913 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:13,913 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-08 23:40:13,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 23:40:13,913 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:13,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1391225462, now seen corresponding path program 1 times [2020-07-08 23:40:13,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:13,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426950432] [2020-07-08 23:40:13,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:14,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {3879#true} assume true; {3879#true} is VALID [2020-07-08 23:40:14,031 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3879#true} {3879#true} #104#return; {3879#true} is VALID [2020-07-08 23:40:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:14,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2020-07-08 23:40:14,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2020-07-08 23:40:14,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2020-07-08 23:40:14,043 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3885#(<= 10000 main_~k~0)} #108#return; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-08 23:40:14,043 INFO L263 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2020-07-08 23:40:14,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {3879#true} assume true; {3879#true} is VALID [2020-07-08 23:40:14,043 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3879#true} {3879#true} #104#return; {3879#true} is VALID [2020-07-08 23:40:14,043 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-08 23:40:14,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {3879#true} ~argc := #in~argc; {3879#true} is VALID [2020-07-08 23:40:14,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {3879#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {3879#true} is VALID [2020-07-08 23:40:14,044 INFO L280 TraceCheckUtils]: 6: Hoare triple {3879#true} ~c1~0 := 4000; {3879#true} is VALID [2020-07-08 23:40:14,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {3879#true} ~c2~0 := 2000; {3879#true} is VALID [2020-07-08 23:40:14,049 INFO L280 TraceCheckUtils]: 8: Hoare triple {3879#true} ~c3~0 := 10000; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:14,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~n~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:14,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~v~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:14,052 INFO L280 TraceCheckUtils]: 11: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~i~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:14,052 INFO L280 TraceCheckUtils]: 12: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~k~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:14,053 INFO L280 TraceCheckUtils]: 13: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc ~j~0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:14,053 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-08 23:40:14,054 INFO L280 TraceCheckUtils]: 15: Hoare triple {3883#(<= 10000 main_~c3~0)} ~n~0 := #t~nondet0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:14,054 INFO L280 TraceCheckUtils]: 16: Hoare triple {3883#(<= 10000 main_~c3~0)} havoc #t~nondet0; {3883#(<= 10000 main_~c3~0)} is VALID [2020-07-08 23:40:14,054 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-08 23:40:14,055 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-08 23:40:14,055 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-08 23:40:14,056 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-08 23:40:14,056 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-08 23:40:14,057 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-08 23:40:14,057 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-08 23:40:14,058 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-08 23:40:14,058 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-08 23:40:14,059 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-08 23:40:14,059 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-08 23:40:14,060 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-08 23:40:14,060 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-08 23:40:14,061 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-08 23:40:14,062 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-08 23:40:14,062 INFO L280 TraceCheckUtils]: 32: Hoare triple {3885#(<= 10000 main_~k~0)} ~j~0 := 0; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-08 23:40:14,063 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-08 23:40:14,063 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-08 23:40:14,063 INFO L280 TraceCheckUtils]: 35: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2020-07-08 23:40:14,063 INFO L280 TraceCheckUtils]: 36: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2020-07-08 23:40:14,063 INFO L280 TraceCheckUtils]: 37: Hoare triple {3879#true} assume true; {3879#true} is VALID [2020-07-08 23:40:14,064 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3879#true} {3885#(<= 10000 main_~k~0)} #108#return; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-08 23:40:14,064 INFO L280 TraceCheckUtils]: 39: Hoare triple {3885#(<= 10000 main_~k~0)} #t~post3 := ~j~0; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-08 23:40:14,064 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-08 23:40:14,065 INFO L280 TraceCheckUtils]: 41: Hoare triple {3885#(<= 10000 main_~k~0)} havoc #t~post3; {3885#(<= 10000 main_~k~0)} is VALID [2020-07-08 23:40:14,065 INFO L280 TraceCheckUtils]: 42: Hoare triple {3885#(<= 10000 main_~k~0)} #t~post4 := ~k~0; {3890#(<= 10000 |main_#t~post4|)} is VALID [2020-07-08 23:40:14,066 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-08 23:40:14,066 INFO L280 TraceCheckUtils]: 44: Hoare triple {3891#(<= 9999 main_~k~0)} havoc #t~post4; {3891#(<= 9999 main_~k~0)} is VALID [2020-07-08 23:40:14,067 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-08 23:40:14,067 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-08 23:40:14,068 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-08 23:40:14,068 INFO L280 TraceCheckUtils]: 48: Hoare triple {3893#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3880#false} is VALID [2020-07-08 23:40:14,068 INFO L280 TraceCheckUtils]: 49: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2020-07-08 23:40:14,071 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-08 23:40:14,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426950432] [2020-07-08 23:40:14,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:14,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 23:40:14,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931093177] [2020-07-08 23:40:14,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-08 23:40:14,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:14,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:40:14,129 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-08 23:40:14,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:40:14,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:40:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:40:14,130 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 9 states. [2020-07-08 23:40:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:14,830 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2020-07-08 23:40:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 23:40:14,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-08 23:40:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2020-07-08 23:40:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2020-07-08 23:40:14,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2020-07-08 23:40:14,932 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-08 23:40:14,935 INFO L225 Difference]: With dead ends: 96 [2020-07-08 23:40:14,935 INFO L226 Difference]: Without dead ends: 94 [2020-07-08 23:40:14,936 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-08 23:40:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-08 23:40:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2020-07-08 23:40:15,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:15,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 69 states. [2020-07-08 23:40:15,157 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 69 states. [2020-07-08 23:40:15,158 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 69 states. [2020-07-08 23:40:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:15,165 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2020-07-08 23:40:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2020-07-08 23:40:15,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:15,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:15,166 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 94 states. [2020-07-08 23:40:15,166 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 94 states. [2020-07-08 23:40:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:15,171 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2020-07-08 23:40:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2020-07-08 23:40:15,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:15,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:15,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:15,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-08 23:40:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-07-08 23:40:15,175 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 50 [2020-07-08 23:40:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:15,175 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-07-08 23:40:15,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:40:15,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2020-07-08 23:40:15,304 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-08 23:40:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-08 23:40:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 23:40:15,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:15,305 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-08 23:40:15,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 23:40:15,306 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash -798805526, now seen corresponding path program 1 times [2020-07-08 23:40:15,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:15,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [788577746] [2020-07-08 23:40:15,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:15,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {4426#true} assume true; {4426#true} is VALID [2020-07-08 23:40:15,472 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4426#true} {4426#true} #104#return; {4426#true} is VALID [2020-07-08 23:40:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:15,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {4426#true} ~cond := #in~cond; {4426#true} is VALID [2020-07-08 23:40:15,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {4426#true} assume !(0 == ~cond); {4426#true} is VALID [2020-07-08 23:40:15,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {4426#true} assume true; {4426#true} is VALID [2020-07-08 23:40:15,492 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4426#true} {4432#(<= 2000 main_~k~0)} #108#return; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-08 23:40:15,493 INFO L263 TraceCheckUtils]: 0: Hoare triple {4426#true} call ULTIMATE.init(); {4426#true} is VALID [2020-07-08 23:40:15,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {4426#true} assume true; {4426#true} is VALID [2020-07-08 23:40:15,493 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4426#true} {4426#true} #104#return; {4426#true} is VALID [2020-07-08 23:40:15,493 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-08 23:40:15,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {4426#true} ~argc := #in~argc; {4426#true} is VALID [2020-07-08 23:40:15,494 INFO L280 TraceCheckUtils]: 5: Hoare triple {4426#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {4426#true} is VALID [2020-07-08 23:40:15,494 INFO L280 TraceCheckUtils]: 6: Hoare triple {4426#true} ~c1~0 := 4000; {4426#true} is VALID [2020-07-08 23:40:15,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {4426#true} ~c2~0 := 2000; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:15,495 INFO L280 TraceCheckUtils]: 8: Hoare triple {4430#(<= 2000 main_~c2~0)} ~c3~0 := 10000; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:15,495 INFO L280 TraceCheckUtils]: 9: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~n~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:15,496 INFO L280 TraceCheckUtils]: 10: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~v~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:15,497 INFO L280 TraceCheckUtils]: 11: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~i~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:15,497 INFO L280 TraceCheckUtils]: 12: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~k~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:15,498 INFO L280 TraceCheckUtils]: 13: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc ~j~0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:15,498 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-08 23:40:15,499 INFO L280 TraceCheckUtils]: 15: Hoare triple {4430#(<= 2000 main_~c2~0)} ~n~0 := #t~nondet0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:15,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {4430#(<= 2000 main_~c2~0)} havoc #t~nondet0; {4430#(<= 2000 main_~c2~0)} is VALID [2020-07-08 23:40:15,500 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-08 23:40:15,500 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-08 23:40:15,501 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-08 23:40:15,501 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-08 23:40:15,502 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-08 23:40:15,502 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-08 23:40:15,503 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-08 23:40:15,503 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-08 23:40:15,504 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-08 23:40:15,504 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-08 23:40:15,505 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-08 23:40:15,505 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-08 23:40:15,506 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-08 23:40:15,507 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-08 23:40:15,507 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-08 23:40:15,508 INFO L280 TraceCheckUtils]: 32: Hoare triple {4432#(<= 2000 main_~k~0)} ~j~0 := 0; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-08 23:40:15,511 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-08 23:40:15,511 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-08 23:40:15,511 INFO L280 TraceCheckUtils]: 35: Hoare triple {4426#true} ~cond := #in~cond; {4426#true} is VALID [2020-07-08 23:40:15,511 INFO L280 TraceCheckUtils]: 36: Hoare triple {4426#true} assume !(0 == ~cond); {4426#true} is VALID [2020-07-08 23:40:15,511 INFO L280 TraceCheckUtils]: 37: Hoare triple {4426#true} assume true; {4426#true} is VALID [2020-07-08 23:40:15,513 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4426#true} {4432#(<= 2000 main_~k~0)} #108#return; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-08 23:40:15,513 INFO L280 TraceCheckUtils]: 39: Hoare triple {4432#(<= 2000 main_~k~0)} #t~post3 := ~j~0; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-08 23:40:15,517 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-08 23:40:15,520 INFO L280 TraceCheckUtils]: 41: Hoare triple {4432#(<= 2000 main_~k~0)} havoc #t~post3; {4432#(<= 2000 main_~k~0)} is VALID [2020-07-08 23:40:15,521 INFO L280 TraceCheckUtils]: 42: Hoare triple {4432#(<= 2000 main_~k~0)} #t~post4 := ~k~0; {4437#(<= 2000 |main_#t~post4|)} is VALID [2020-07-08 23:40:15,522 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-08 23:40:15,522 INFO L280 TraceCheckUtils]: 44: Hoare triple {4438#(<= 1999 main_~k~0)} havoc #t~post4; {4438#(<= 1999 main_~k~0)} is VALID [2020-07-08 23:40:15,523 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-08 23:40:15,524 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-08 23:40:15,525 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-08 23:40:15,525 INFO L280 TraceCheckUtils]: 48: Hoare triple {4440#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4427#false} is VALID [2020-07-08 23:40:15,525 INFO L280 TraceCheckUtils]: 49: Hoare triple {4427#false} assume !false; {4427#false} is VALID [2020-07-08 23:40:15,528 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-08 23:40:15,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [788577746] [2020-07-08 23:40:15,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:15,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 23:40:15,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891493397] [2020-07-08 23:40:15,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-08 23:40:15,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:15,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:40:15,576 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-08 23:40:15,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:40:15,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:15,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:40:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:40:15,577 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 9 states. [2020-07-08 23:40:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:16,329 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2020-07-08 23:40:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 23:40:16,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-08 23:40:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2020-07-08 23:40:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:40:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2020-07-08 23:40:16,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2020-07-08 23:40:16,406 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-08 23:40:16,409 INFO L225 Difference]: With dead ends: 94 [2020-07-08 23:40:16,409 INFO L226 Difference]: Without dead ends: 92 [2020-07-08 23:40:16,409 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-08 23:40:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-08 23:40:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2020-07-08 23:40:16,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:16,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 67 states. [2020-07-08 23:40:16,581 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 67 states. [2020-07-08 23:40:16,581 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 67 states. [2020-07-08 23:40:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:16,590 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2020-07-08 23:40:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2020-07-08 23:40:16,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:16,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:16,595 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 92 states. [2020-07-08 23:40:16,595 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 92 states. [2020-07-08 23:40:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:16,603 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2020-07-08 23:40:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2020-07-08 23:40:16,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:16,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:16,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:16,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-08 23:40:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2020-07-08 23:40:16,611 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 50 [2020-07-08 23:40:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:16,611 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2020-07-08 23:40:16,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:40:16,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 69 transitions. [2020-07-08 23:40:16,729 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-08 23:40:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2020-07-08 23:40:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-08 23:40:16,731 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:16,731 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-08 23:40:16,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 23:40:16,731 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1367702887, now seen corresponding path program 2 times [2020-07-08 23:40:16,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:16,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [499724502] [2020-07-08 23:40:16,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:16,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-08 23:40:16,821 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4961#true} {4961#true} #104#return; {4961#true} is VALID [2020-07-08 23:40:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:16,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {4961#true} ~cond := #in~cond; {4961#true} is VALID [2020-07-08 23:40:16,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {4961#true} assume !(0 == ~cond); {4961#true} is VALID [2020-07-08 23:40:16,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-08 23:40:16,827 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-08 23:40:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:16,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {4961#true} ~cond := #in~cond; {4961#true} is VALID [2020-07-08 23:40:16,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {4961#true} assume !(0 == ~cond); {4961#true} is VALID [2020-07-08 23:40:16,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-08 23:40:16,832 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4961#true} {4962#false} #108#return; {4962#false} is VALID [2020-07-08 23:40:16,832 INFO L263 TraceCheckUtils]: 0: Hoare triple {4961#true} call ULTIMATE.init(); {4961#true} is VALID [2020-07-08 23:40:16,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-08 23:40:16,833 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4961#true} {4961#true} #104#return; {4961#true} is VALID [2020-07-08 23:40:16,833 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-08 23:40:16,833 INFO L280 TraceCheckUtils]: 4: Hoare triple {4961#true} ~argc := #in~argc; {4961#true} is VALID [2020-07-08 23:40:16,833 INFO L280 TraceCheckUtils]: 5: Hoare triple {4961#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {4961#true} is VALID [2020-07-08 23:40:16,833 INFO L280 TraceCheckUtils]: 6: Hoare triple {4961#true} ~c1~0 := 4000; {4961#true} is VALID [2020-07-08 23:40:16,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {4961#true} ~c2~0 := 2000; {4961#true} is VALID [2020-07-08 23:40:16,834 INFO L280 TraceCheckUtils]: 8: Hoare triple {4961#true} ~c3~0 := 10000; {4961#true} is VALID [2020-07-08 23:40:16,834 INFO L280 TraceCheckUtils]: 9: Hoare triple {4961#true} havoc ~n~0; {4961#true} is VALID [2020-07-08 23:40:16,834 INFO L280 TraceCheckUtils]: 10: Hoare triple {4961#true} havoc ~v~0; {4961#true} is VALID [2020-07-08 23:40:16,834 INFO L280 TraceCheckUtils]: 11: Hoare triple {4961#true} havoc ~i~0; {4961#true} is VALID [2020-07-08 23:40:16,835 INFO L280 TraceCheckUtils]: 12: Hoare triple {4961#true} havoc ~k~0; {4961#true} is VALID [2020-07-08 23:40:16,835 INFO L280 TraceCheckUtils]: 13: Hoare triple {4961#true} havoc ~j~0; {4961#true} is VALID [2020-07-08 23:40:16,835 INFO L280 TraceCheckUtils]: 14: Hoare triple {4961#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4961#true} is VALID [2020-07-08 23:40:16,835 INFO L280 TraceCheckUtils]: 15: Hoare triple {4961#true} ~n~0 := #t~nondet0; {4961#true} is VALID [2020-07-08 23:40:16,835 INFO L280 TraceCheckUtils]: 16: Hoare triple {4961#true} havoc #t~nondet0; {4961#true} is VALID [2020-07-08 23:40:16,835 INFO L280 TraceCheckUtils]: 17: Hoare triple {4961#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {4961#true} is VALID [2020-07-08 23:40:16,836 INFO L280 TraceCheckUtils]: 18: Hoare triple {4961#true} ~k~0 := 0; {4961#true} is VALID [2020-07-08 23:40:16,836 INFO L280 TraceCheckUtils]: 19: Hoare triple {4961#true} ~i~0 := 0; {4961#true} is VALID [2020-07-08 23:40:16,836 INFO L280 TraceCheckUtils]: 20: Hoare triple {4961#true} assume !!(~i~0 < ~n~0); {4961#true} is VALID [2020-07-08 23:40:16,836 INFO L280 TraceCheckUtils]: 21: Hoare triple {4961#true} #t~post1 := ~i~0; {4961#true} is VALID [2020-07-08 23:40:16,836 INFO L280 TraceCheckUtils]: 22: Hoare triple {4961#true} ~i~0 := 1 + #t~post1; {4961#true} is VALID [2020-07-08 23:40:16,837 INFO L280 TraceCheckUtils]: 23: Hoare triple {4961#true} havoc #t~post1; {4961#true} is VALID [2020-07-08 23:40:16,837 INFO L280 TraceCheckUtils]: 24: Hoare triple {4961#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4961#true} is VALID [2020-07-08 23:40:16,837 INFO L280 TraceCheckUtils]: 25: Hoare triple {4961#true} ~v~0 := #t~nondet2; {4961#true} is VALID [2020-07-08 23:40:16,837 INFO L280 TraceCheckUtils]: 26: Hoare triple {4961#true} havoc #t~nondet2; {4961#true} is VALID [2020-07-08 23:40:16,838 INFO L280 TraceCheckUtils]: 27: Hoare triple {4961#true} assume !!(0 <= ~v~0 && ~n~0 < 2); {4965#(<= main_~n~0 1)} is VALID [2020-07-08 23:40:16,839 INFO L280 TraceCheckUtils]: 28: Hoare triple {4965#(<= main_~n~0 1)} assume 0 == ~v~0; {4965#(<= main_~n~0 1)} is VALID [2020-07-08 23:40:16,839 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-08 23:40:16,840 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-08 23:40:16,841 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-08 23:40:16,841 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-08 23:40:16,841 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-08 23:40:16,842 INFO L280 TraceCheckUtils]: 34: Hoare triple {4961#true} ~cond := #in~cond; {4961#true} is VALID [2020-07-08 23:40:16,842 INFO L280 TraceCheckUtils]: 35: Hoare triple {4961#true} assume !(0 == ~cond); {4961#true} is VALID [2020-07-08 23:40:16,842 INFO L280 TraceCheckUtils]: 36: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-08 23:40:16,843 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-08 23:40:16,843 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-08 23:40:16,844 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-08 23:40:16,845 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-08 23:40:16,845 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-08 23:40:16,846 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-08 23:40:16,846 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-08 23:40:16,847 INFO L280 TraceCheckUtils]: 44: Hoare triple {4972#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {4962#false} is VALID [2020-07-08 23:40:16,847 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-08 23:40:16,847 INFO L280 TraceCheckUtils]: 46: Hoare triple {4961#true} ~cond := #in~cond; {4961#true} is VALID [2020-07-08 23:40:16,848 INFO L280 TraceCheckUtils]: 47: Hoare triple {4961#true} assume !(0 == ~cond); {4961#true} is VALID [2020-07-08 23:40:16,848 INFO L280 TraceCheckUtils]: 48: Hoare triple {4961#true} assume true; {4961#true} is VALID [2020-07-08 23:40:16,848 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {4961#true} {4962#false} #108#return; {4962#false} is VALID [2020-07-08 23:40:16,848 INFO L280 TraceCheckUtils]: 50: Hoare triple {4962#false} #t~post3 := ~j~0; {4962#false} is VALID [2020-07-08 23:40:16,848 INFO L280 TraceCheckUtils]: 51: Hoare triple {4962#false} ~j~0 := 1 + #t~post3; {4962#false} is VALID [2020-07-08 23:40:16,848 INFO L280 TraceCheckUtils]: 52: Hoare triple {4962#false} havoc #t~post3; {4962#false} is VALID [2020-07-08 23:40:16,849 INFO L280 TraceCheckUtils]: 53: Hoare triple {4962#false} #t~post4 := ~k~0; {4962#false} is VALID [2020-07-08 23:40:16,849 INFO L280 TraceCheckUtils]: 54: Hoare triple {4962#false} ~k~0 := #t~post4 - 1; {4962#false} is VALID [2020-07-08 23:40:16,849 INFO L280 TraceCheckUtils]: 55: Hoare triple {4962#false} havoc #t~post4; {4962#false} is VALID [2020-07-08 23:40:16,849 INFO L280 TraceCheckUtils]: 56: Hoare triple {4962#false} assume !!(~j~0 < ~n~0); {4962#false} is VALID [2020-07-08 23:40:16,849 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-08 23:40:16,850 INFO L280 TraceCheckUtils]: 58: Hoare triple {4962#false} ~cond := #in~cond; {4962#false} is VALID [2020-07-08 23:40:16,850 INFO L280 TraceCheckUtils]: 59: Hoare triple {4962#false} assume 0 == ~cond; {4962#false} is VALID [2020-07-08 23:40:16,850 INFO L280 TraceCheckUtils]: 60: Hoare triple {4962#false} assume !false; {4962#false} is VALID [2020-07-08 23:40:16,852 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-08 23:40:16,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [499724502] [2020-07-08 23:40:16,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:16,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 23:40:16,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624384127] [2020-07-08 23:40:16,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-07-08 23:40:16,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:16,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 23:40:16,908 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-08 23:40:16,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 23:40:16,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:16,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 23:40:16,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:40:16,910 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 6 states. [2020-07-08 23:40:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:17,245 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-07-08 23:40:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 23:40:17,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-07-08 23:40:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:40:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-08 23:40:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:40:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-08 23:40:17,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2020-07-08 23:40:17,324 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-08 23:40:17,324 INFO L225 Difference]: With dead ends: 67 [2020-07-08 23:40:17,324 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:40:17,326 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-08 23:40:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:40:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:40:17,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:17,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:17,327 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:17,327 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:17,327 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:40:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:17,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:17,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:17,328 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:17,328 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:17,328 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:40:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:17,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:17,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:17,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:17,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:40:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:40:17,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-07-08 23:40:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:17,329 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:40:17,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 23:40:17,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:40:17,330 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-08 23:40:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:17,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:17,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 23:40:17,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:40:18,927 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2020-07-08 23:40:19,149 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:40:19,149 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:40:19,149 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:40:19,149 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:40:19,150 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:40:19,150 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:40:19,150 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:19,150 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:19,150 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 23:40:19,150 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 23:40:19,150 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:19,151 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-08 23:40:19,151 INFO L271 CegarLoopResult]: At program point L35-3(lines 35 39) the Hoare annotation is: true [2020-07-08 23:40:19,151 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-08 23:40:19,151 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 41) the Hoare annotation is: true [2020-07-08 23:40:19,152 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-08 23:40:19,152 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-08 23:40:19,152 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-08 23:40:19,152 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-08 23:40:19,152 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (<= 4000 main_~c1~0) [2020-07-08 23:40:19,152 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-08 23:40:19,153 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-08 23:40:19,153 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-08 23:40:19,153 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-08 23:40:19,153 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-08 23:40:19,153 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-08 23:40:19,154 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-08 23:40:19,154 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-08 23:40:19,154 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-07-08 23:40:19,154 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-07-08 23:40:19,154 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-08 23:40:19,155 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-08 23:40:19,155 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-08 23:40:19,155 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-08 23:40:19,155 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-08 23:40:19,155 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-08 23:40:19,156 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-08 23:40:19,156 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-08 23:40:19,156 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-08 23:40:19,156 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-08 23:40:19,156 INFO L271 CegarLoopResult]: At program point L13(lines 13 41) the Hoare annotation is: true [2020-07-08 23:40:19,156 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 41) the Hoare annotation is: true [2020-07-08 23:40:19,157 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-08 23:40:19,157 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-08 23:40:19,157 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-08 23:40:19,157 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-08 23:40:19,157 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 41) the Hoare annotation is: true [2020-07-08 23:40:19,157 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-08 23:40:19,158 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-07-08 23:40:19,158 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-08 23:40:19,158 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-08 23:40:19,158 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-08 23:40:19,158 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-08 23:40:19,158 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-08 23:40:19,159 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 23:40:19,159 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-08 23:40:19,159 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:40:19,159 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-08 23:40:19,159 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-08 23:40:19,159 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:40:19,164 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:40:19,165 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:40:19,166 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:40:19,167 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 23:40:19,167 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 23:40:19,198 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-08 23:40:19,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:40:19 BoogieIcfgContainer [2020-07-08 23:40:19,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:40:19,236 INFO L168 Benchmark]: Toolchain (without parser) took 15391.65 ms. Allocated memory was 136.8 MB in the beginning and 362.8 MB in the end (delta: 226.0 MB). Free memory was 102.4 MB in the beginning and 130.7 MB in the end (delta: -28.4 MB). Peak memory consumption was 197.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:19,237 INFO L168 Benchmark]: CDTParser took 1.18 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-08 23:40:19,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.77 ms. Allocated memory is still 136.8 MB. Free memory was 102.1 MB in the beginning and 92.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:19,241 INFO L168 Benchmark]: Boogie Preprocessor took 134.52 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 92.0 MB in the beginning and 179.4 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:19,246 INFO L168 Benchmark]: RCFGBuilder took 593.02 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 154.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:19,247 INFO L168 Benchmark]: TraceAbstraction took 14329.28 ms. Allocated memory was 201.3 MB in the beginning and 362.8 MB in the end (delta: 161.5 MB). Free memory was 153.9 MB in the beginning and 130.7 MB in the end (delta: 23.2 MB). Peak memory consumption was 184.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:19,250 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.77 ms. Allocated memory is still 136.8 MB. Free memory was 102.1 MB in the beginning and 92.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.52 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 92.0 MB in the beginning and 179.4 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 593.02 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 154.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14329.28 ms. Allocated memory was 201.3 MB in the beginning and 362.8 MB in the end (delta: 161.5 MB). Free memory was 153.9 MB in the beginning and 130.7 MB in the end (delta: 23.2 MB). Peak memory consumption was 184.6 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: 12.3s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 564 SDtfs, 482 SDslu, 1848 SDs, 0 SdLazy, 473 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s 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.6s 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.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s 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...