/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:51:40,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:40,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:40,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:40,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:40,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:40,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:40,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:40,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:40,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:40,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:40,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:40,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:40,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:40,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:40,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:40,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:40,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:40,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:40,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:40,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:40,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:40,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:40,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:40,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:40,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:40,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:40,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:40,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:40,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:40,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:40,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:40,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:40,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:40,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:40,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:40,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:40,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:40,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:40,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:40,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:40,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:51:40,703 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:40,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:40,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:40,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:40,706 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:40,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:40,706 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:40,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:40,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:40,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:40,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:40,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:40,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:40,708 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:40,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:40,709 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:40,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:40,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:40,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:40,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:40,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:40,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:40,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:40,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:40,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:40,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:40,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:40,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:40,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:40,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:40,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:40,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:40,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:40,990 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:40,990 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:40,991 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-17 22:51:41,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f1a805f/dc5cdffacbf243d88896c8d7c74ed397/FLAG9c25a4b86 [2020-07-17 22:51:41,498 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:41,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2020-07-17 22:51:41,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f1a805f/dc5cdffacbf243d88896c8d7c74ed397/FLAG9c25a4b86 [2020-07-17 22:51:41,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f1a805f/dc5cdffacbf243d88896c8d7c74ed397 [2020-07-17 22:51:41,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:51:41,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:51:41,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:41,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:51:41,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:51:41,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:41" (1/1) ... [2020-07-17 22:51:41,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a520b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:41, skipping insertion in model container [2020-07-17 22:51:41,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:41" (1/1) ... [2020-07-17 22:51:41,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:51:41,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:51:42,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:42,224 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:51:42,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:42,260 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:51:42,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42 WrapperNode [2020-07-17 22:51:42,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:42,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:51:42,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:51:42,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:51:42,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42" (1/1) ... [2020-07-17 22:51:42,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42" (1/1) ... [2020-07-17 22:51:42,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42" (1/1) ... [2020-07-17 22:51:42,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42" (1/1) ... [2020-07-17 22:51:42,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42" (1/1) ... [2020-07-17 22:51:42,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42" (1/1) ... [2020-07-17 22:51:42,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42" (1/1) ... [2020-07-17 22:51:42,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:51:42,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:51:42,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:51:42,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:51:42,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:42,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:51:42,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:51:42,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:51:42,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:51:42,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:51:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:51:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:51:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:51:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:51:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:51:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:51:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:51:42,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:51:42,802 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:51:42,803 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:51:42,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:42 BoogieIcfgContainer [2020-07-17 22:51:42,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:51:42,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:51:42,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:51:42,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:51:42,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:41" (1/3) ... [2020-07-17 22:51:42,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344c92e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:42, skipping insertion in model container [2020-07-17 22:51:42,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:42" (2/3) ... [2020-07-17 22:51:42,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344c92e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:42, skipping insertion in model container [2020-07-17 22:51:42,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:42" (3/3) ... [2020-07-17 22:51:42,820 INFO L109 eAbstractionObserver]: Analyzing ICFG large_const.i [2020-07-17 22:51:42,832 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:51:42,839 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:51:42,855 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:51:42,882 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:51:42,883 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:51:42,883 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:51:42,883 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:51:42,883 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:51:42,883 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:51:42,884 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:51:42,884 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:51:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-17 22:51:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:51:42,906 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:42,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:42,907 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:42,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1992019723, now seen corresponding path program 1 times [2020-07-17 22:51:42,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:42,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764109022] [2020-07-17 22:51:42,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:43,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-17 22:51:43,137 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28#true} {28#true} #73#return; {28#true} is VALID [2020-07-17 22:51:43,140 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2020-07-17 22:51:43,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-17 22:51:43,141 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #73#return; {28#true} is VALID [2020-07-17 22:51:43,141 INFO L263 TraceCheckUtils]: 3: Hoare triple {28#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {28#true} is VALID [2020-07-17 22:51:43,142 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {28#true} is VALID [2020-07-17 22:51:43,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {32#(<= main_~i~0 0)} is VALID [2020-07-17 22:51:43,145 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#(<= main_~i~0 0)} assume !(~i~0 < ~n~0); {33#(<= main_~n~0 0)} is VALID [2020-07-17 22:51:43,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#(<= main_~n~0 0)} ~j~0 := 0; {34#(<= main_~n~0 main_~j~0)} is VALID [2020-07-17 22:51:43,148 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {29#false} is VALID [2020-07-17 22:51:43,149 INFO L263 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {29#false} is VALID [2020-07-17 22:51:43,149 INFO L280 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2020-07-17 22:51:43,150 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2020-07-17 22:51:43,150 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-17 22:51:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:43,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764109022] [2020-07-17 22:51:43,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:43,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:43,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956496331] [2020-07-17 22:51:43,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:51:43,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:43,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:43,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:43,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:43,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:43,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:43,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:43,210 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-07-17 22:51:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:43,483 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2020-07-17 22:51:43,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:43,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:51:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:51:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:51:43,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-17 22:51:43,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:43,608 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:51:43,608 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:51:43,612 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-17 22:51:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:51:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-17 22:51:43,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:43,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:43,668 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:43,668 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:43,672 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-17 22:51:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-17 22:51:43,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:43,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:43,674 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:43,674 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:43,677 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-17 22:51:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-17 22:51:43,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:43,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:43,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:43,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:51:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-07-17 22:51:43,683 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2020-07-17 22:51:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:43,683 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-17 22:51:43,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-17 22:51:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:51:43,685 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:43,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:43,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:51:43,686 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:43,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:43,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2018685173, now seen corresponding path program 1 times [2020-07-17 22:51:43,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:43,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365730828] [2020-07-17 22:51:43,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:43,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-17 22:51:43,831 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {174#true} {174#true} #73#return; {174#true} is VALID [2020-07-17 22:51:43,831 INFO L263 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2020-07-17 22:51:43,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-17 22:51:43,832 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {174#true} {174#true} #73#return; {174#true} is VALID [2020-07-17 22:51:43,832 INFO L263 TraceCheckUtils]: 3: Hoare triple {174#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {174#true} is VALID [2020-07-17 22:51:43,833 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {178#(<= 4000 main_~c1~0)} is VALID [2020-07-17 22:51:43,834 INFO L280 TraceCheckUtils]: 5: Hoare triple {178#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {179#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-17 22:51:43,835 INFO L280 TraceCheckUtils]: 6: Hoare triple {179#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {179#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-17 22:51:43,836 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {179#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-17 22:51:43,837 INFO L280 TraceCheckUtils]: 8: Hoare triple {179#(<= 4000 (+ main_~c1~0 main_~k~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {180#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:43,838 INFO L280 TraceCheckUtils]: 9: Hoare triple {180#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {180#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:43,839 INFO L280 TraceCheckUtils]: 10: Hoare triple {180#(<= 4000 main_~k~0)} ~j~0 := 0; {180#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:43,840 INFO L280 TraceCheckUtils]: 11: Hoare triple {180#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {180#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:43,841 INFO L263 TraceCheckUtils]: 12: Hoare triple {180#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {181#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:43,842 INFO L280 TraceCheckUtils]: 13: Hoare triple {181#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {182#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:43,843 INFO L280 TraceCheckUtils]: 14: Hoare triple {182#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {175#false} is VALID [2020-07-17 22:51:43,844 INFO L280 TraceCheckUtils]: 15: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-17 22:51:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:43,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365730828] [2020-07-17 22:51:43,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139709308] [2020-07-17 22:51:43,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:43,888 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:51:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:43,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:44,046 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:44,113 INFO L263 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2020-07-17 22:51:44,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-17 22:51:44,114 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {174#true} {174#true} #73#return; {174#true} is VALID [2020-07-17 22:51:44,114 INFO L263 TraceCheckUtils]: 3: Hoare triple {174#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {174#true} is VALID [2020-07-17 22:51:44,116 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {178#(<= 4000 main_~c1~0)} is VALID [2020-07-17 22:51:44,117 INFO L280 TraceCheckUtils]: 5: Hoare triple {178#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {201#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:44,119 INFO L280 TraceCheckUtils]: 6: Hoare triple {201#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {201#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:44,120 INFO L280 TraceCheckUtils]: 7: Hoare triple {201#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {201#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:44,122 INFO L280 TraceCheckUtils]: 8: Hoare triple {201#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {180#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:44,123 INFO L280 TraceCheckUtils]: 9: Hoare triple {180#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {180#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:44,125 INFO L280 TraceCheckUtils]: 10: Hoare triple {180#(<= 4000 main_~k~0)} ~j~0 := 0; {180#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:44,126 INFO L280 TraceCheckUtils]: 11: Hoare triple {180#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {180#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:44,127 INFO L263 TraceCheckUtils]: 12: Hoare triple {180#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:44,129 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:44,131 INFO L280 TraceCheckUtils]: 14: Hoare triple {227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {175#false} is VALID [2020-07-17 22:51:44,132 INFO L280 TraceCheckUtils]: 15: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-17 22:51:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:44,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:44,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-17 22:51:44,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810718153] [2020-07-17 22:51:44,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-07-17 22:51:44,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:44,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:51:44,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:44,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:51:44,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:44,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:51:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:51:44,177 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2020-07-17 22:51:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:44,571 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2020-07-17 22:51:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:51:44,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-07-17 22:51:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:51:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-17 22:51:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:51:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-17 22:51:44,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-17 22:51:44,653 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-17 22:51:44,655 INFO L225 Difference]: With dead ends: 41 [2020-07-17 22:51:44,656 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:51:44,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:51:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:51:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2020-07-17 22:51:44,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:44,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 31 states. [2020-07-17 22:51:44,686 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 31 states. [2020-07-17 22:51:44,686 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 31 states. [2020-07-17 22:51:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:44,691 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2020-07-17 22:51:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2020-07-17 22:51:44,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:44,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:44,693 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 39 states. [2020-07-17 22:51:44,693 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 39 states. [2020-07-17 22:51:44,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:44,698 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2020-07-17 22:51:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2020-07-17 22:51:44,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:44,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:44,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:44,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:51:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2020-07-17 22:51:44,702 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2020-07-17 22:51:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:44,703 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-07-17 22:51:44,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:51:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2020-07-17 22:51:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:51:44,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:44,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:44,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:51:44,919 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash 23130030, now seen corresponding path program 1 times [2020-07-17 22:51:44,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:44,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984457195] [2020-07-17 22:51:44,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:45,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-17 22:51:45,123 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {415#true} {415#true} #73#return; {415#true} is VALID [2020-07-17 22:51:45,123 INFO L263 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2020-07-17 22:51:45,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-17 22:51:45,124 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {415#true} {415#true} #73#return; {415#true} is VALID [2020-07-17 22:51:45,124 INFO L263 TraceCheckUtils]: 3: Hoare triple {415#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {415#true} is VALID [2020-07-17 22:51:45,128 INFO L280 TraceCheckUtils]: 4: Hoare triple {415#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {419#(<= 2000 main_~c2~0)} is VALID [2020-07-17 22:51:45,129 INFO L280 TraceCheckUtils]: 5: Hoare triple {419#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {420#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-17 22:51:45,130 INFO L280 TraceCheckUtils]: 6: Hoare triple {420#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {420#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-17 22:51:45,130 INFO L280 TraceCheckUtils]: 7: Hoare triple {420#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {420#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-17 22:51:45,131 INFO L280 TraceCheckUtils]: 8: Hoare triple {420#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !(0 == ~v~0); {420#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-17 22:51:45,132 INFO L280 TraceCheckUtils]: 9: Hoare triple {420#(<= 2000 (+ main_~c2~0 main_~k~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {421#(<= 2000 main_~k~0)} is VALID [2020-07-17 22:51:45,132 INFO L280 TraceCheckUtils]: 10: Hoare triple {421#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {421#(<= 2000 main_~k~0)} is VALID [2020-07-17 22:51:45,134 INFO L280 TraceCheckUtils]: 11: Hoare triple {421#(<= 2000 main_~k~0)} ~j~0 := 0; {421#(<= 2000 main_~k~0)} is VALID [2020-07-17 22:51:45,135 INFO L280 TraceCheckUtils]: 12: Hoare triple {421#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {421#(<= 2000 main_~k~0)} is VALID [2020-07-17 22:51:45,136 INFO L263 TraceCheckUtils]: 13: Hoare triple {421#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {422#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:45,136 INFO L280 TraceCheckUtils]: 14: Hoare triple {422#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {423#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:45,137 INFO L280 TraceCheckUtils]: 15: Hoare triple {423#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {416#false} is VALID [2020-07-17 22:51:45,137 INFO L280 TraceCheckUtils]: 16: Hoare triple {416#false} assume !false; {416#false} is VALID [2020-07-17 22:51:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:45,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984457195] [2020-07-17 22:51:45,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536030229] [2020-07-17 22:51:45,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:51:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:45,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:45,182 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:45,273 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:45,315 INFO L263 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2020-07-17 22:51:45,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-17 22:51:45,316 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {415#true} {415#true} #73#return; {415#true} is VALID [2020-07-17 22:51:45,316 INFO L263 TraceCheckUtils]: 3: Hoare triple {415#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {415#true} is VALID [2020-07-17 22:51:45,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {415#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {419#(<= 2000 main_~c2~0)} is VALID [2020-07-17 22:51:45,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {419#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {442#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:45,319 INFO L280 TraceCheckUtils]: 6: Hoare triple {442#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {442#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:45,319 INFO L280 TraceCheckUtils]: 7: Hoare triple {442#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {442#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:45,320 INFO L280 TraceCheckUtils]: 8: Hoare triple {442#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume !(0 == ~v~0); {442#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:45,321 INFO L280 TraceCheckUtils]: 9: Hoare triple {442#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {421#(<= 2000 main_~k~0)} is VALID [2020-07-17 22:51:45,322 INFO L280 TraceCheckUtils]: 10: Hoare triple {421#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {421#(<= 2000 main_~k~0)} is VALID [2020-07-17 22:51:45,323 INFO L280 TraceCheckUtils]: 11: Hoare triple {421#(<= 2000 main_~k~0)} ~j~0 := 0; {421#(<= 2000 main_~k~0)} is VALID [2020-07-17 22:51:45,323 INFO L280 TraceCheckUtils]: 12: Hoare triple {421#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {421#(<= 2000 main_~k~0)} is VALID [2020-07-17 22:51:45,325 INFO L263 TraceCheckUtils]: 13: Hoare triple {421#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {467#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:45,325 INFO L280 TraceCheckUtils]: 14: Hoare triple {467#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {471#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:45,326 INFO L280 TraceCheckUtils]: 15: Hoare triple {471#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {416#false} is VALID [2020-07-17 22:51:45,326 INFO L280 TraceCheckUtils]: 16: Hoare triple {416#false} assume !false; {416#false} is VALID [2020-07-17 22:51:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:45,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:45,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-17 22:51:45,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790801934] [2020-07-17 22:51:45,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-17 22:51:45,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:45,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:51:45,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:45,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:51:45,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:51:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:51:45,357 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 10 states. [2020-07-17 22:51:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:45,719 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2020-07-17 22:51:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:51:45,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-17 22:51:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:51:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-17 22:51:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:51:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-17 22:51:45,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-17 22:51:45,782 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-17 22:51:45,785 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:51:45,785 INFO L226 Difference]: Without dead ends: 49 [2020-07-17 22:51:45,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:51:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-17 22:51:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2020-07-17 22:51:45,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:45,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 37 states. [2020-07-17 22:51:45,815 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 37 states. [2020-07-17 22:51:45,816 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 37 states. [2020-07-17 22:51:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:45,820 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2020-07-17 22:51:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2020-07-17 22:51:45,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:45,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:45,822 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 49 states. [2020-07-17 22:51:45,822 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 49 states. [2020-07-17 22:51:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:45,826 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2020-07-17 22:51:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2020-07-17 22:51:45,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:45,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:45,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:45,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-17 22:51:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2020-07-17 22:51:45,830 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 17 [2020-07-17 22:51:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:45,830 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2020-07-17 22:51:45,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:51:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2020-07-17 22:51:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:51:45,832 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:45,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:46,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:46,046 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:46,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:46,047 INFO L82 PathProgramCache]: Analyzing trace with hash -786216596, now seen corresponding path program 1 times [2020-07-17 22:51:46,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:46,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975265675] [2020-07-17 22:51:46,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:46,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:51:46,206 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {700#true} {700#true} #73#return; {700#true} is VALID [2020-07-17 22:51:46,206 INFO L263 TraceCheckUtils]: 0: Hoare triple {700#true} call ULTIMATE.init(); {700#true} is VALID [2020-07-17 22:51:46,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:51:46,207 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {700#true} {700#true} #73#return; {700#true} is VALID [2020-07-17 22:51:46,207 INFO L263 TraceCheckUtils]: 3: Hoare triple {700#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {700#true} is VALID [2020-07-17 22:51:46,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {700#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {704#(<= 10000 main_~c3~0)} is VALID [2020-07-17 22:51:46,209 INFO L280 TraceCheckUtils]: 5: Hoare triple {704#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {705#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-17 22:51:46,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {705#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-17 22:51:46,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {705#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-17 22:51:46,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(0 == ~v~0); {705#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-17 22:51:46,212 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {706#(<= 10000 main_~k~0)} is VALID [2020-07-17 22:51:46,213 INFO L280 TraceCheckUtils]: 10: Hoare triple {706#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {706#(<= 10000 main_~k~0)} is VALID [2020-07-17 22:51:46,214 INFO L280 TraceCheckUtils]: 11: Hoare triple {706#(<= 10000 main_~k~0)} ~j~0 := 0; {706#(<= 10000 main_~k~0)} is VALID [2020-07-17 22:51:46,214 INFO L280 TraceCheckUtils]: 12: Hoare triple {706#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {706#(<= 10000 main_~k~0)} is VALID [2020-07-17 22:51:46,217 INFO L263 TraceCheckUtils]: 13: Hoare triple {706#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {707#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:46,218 INFO L280 TraceCheckUtils]: 14: Hoare triple {707#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {708#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:46,223 INFO L280 TraceCheckUtils]: 15: Hoare triple {708#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {701#false} is VALID [2020-07-17 22:51:46,223 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-17 22:51:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:46,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975265675] [2020-07-17 22:51:46,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966434224] [2020-07-17 22:51:46,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:46,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:51:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:46,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:46,336 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:46,377 INFO L263 TraceCheckUtils]: 0: Hoare triple {700#true} call ULTIMATE.init(); {700#true} is VALID [2020-07-17 22:51:46,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} assume true; {700#true} is VALID [2020-07-17 22:51:46,378 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {700#true} {700#true} #73#return; {700#true} is VALID [2020-07-17 22:51:46,378 INFO L263 TraceCheckUtils]: 3: Hoare triple {700#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {700#true} is VALID [2020-07-17 22:51:46,379 INFO L280 TraceCheckUtils]: 4: Hoare triple {700#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {704#(<= 10000 main_~c3~0)} is VALID [2020-07-17 22:51:46,380 INFO L280 TraceCheckUtils]: 5: Hoare triple {704#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {727#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:46,381 INFO L280 TraceCheckUtils]: 6: Hoare triple {727#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {727#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:46,382 INFO L280 TraceCheckUtils]: 7: Hoare triple {727#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {727#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:46,383 INFO L280 TraceCheckUtils]: 8: Hoare triple {727#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(0 == ~v~0); {727#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2020-07-17 22:51:46,384 INFO L280 TraceCheckUtils]: 9: Hoare triple {727#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {706#(<= 10000 main_~k~0)} is VALID [2020-07-17 22:51:46,385 INFO L280 TraceCheckUtils]: 10: Hoare triple {706#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {706#(<= 10000 main_~k~0)} is VALID [2020-07-17 22:51:46,385 INFO L280 TraceCheckUtils]: 11: Hoare triple {706#(<= 10000 main_~k~0)} ~j~0 := 0; {706#(<= 10000 main_~k~0)} is VALID [2020-07-17 22:51:46,386 INFO L280 TraceCheckUtils]: 12: Hoare triple {706#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {706#(<= 10000 main_~k~0)} is VALID [2020-07-17 22:51:46,387 INFO L263 TraceCheckUtils]: 13: Hoare triple {706#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:46,388 INFO L280 TraceCheckUtils]: 14: Hoare triple {752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:46,388 INFO L280 TraceCheckUtils]: 15: Hoare triple {756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {701#false} is VALID [2020-07-17 22:51:46,389 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-17 22:51:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:46,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:46,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-17 22:51:46,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335356283] [2020-07-17 22:51:46,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-17 22:51:46,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:46,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:51:46,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:46,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:51:46,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:46,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:51:46,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:51:46,419 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 10 states. [2020-07-17 22:51:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:46,810 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2020-07-17 22:51:46,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:51:46,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-17 22:51:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:51:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-17 22:51:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:51:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-17 22:51:46,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-17 22:51:46,875 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-17 22:51:46,879 INFO L225 Difference]: With dead ends: 55 [2020-07-17 22:51:46,879 INFO L226 Difference]: Without dead ends: 53 [2020-07-17 22:51:46,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:51:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-17 22:51:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2020-07-17 22:51:46,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:46,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 42 states. [2020-07-17 22:51:46,923 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 42 states. [2020-07-17 22:51:46,923 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 42 states. [2020-07-17 22:51:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:46,927 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-07-17 22:51:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2020-07-17 22:51:46,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:46,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:46,928 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 53 states. [2020-07-17 22:51:46,929 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 53 states. [2020-07-17 22:51:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:46,932 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-07-17 22:51:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2020-07-17 22:51:46,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:46,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:46,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:46,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:51:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-07-17 22:51:46,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 17 [2020-07-17 22:51:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:46,936 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-07-17 22:51:46,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:51:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-07-17 22:51:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:51:46,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:46,938 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:47,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:47,146 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash -986746962, now seen corresponding path program 1 times [2020-07-17 22:51:47,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:47,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169017694] [2020-07-17 22:51:47,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:47,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {1004#true} assume true; {1004#true} is VALID [2020-07-17 22:51:47,216 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1004#true} {1004#true} #73#return; {1004#true} is VALID [2020-07-17 22:51:47,216 INFO L263 TraceCheckUtils]: 0: Hoare triple {1004#true} call ULTIMATE.init(); {1004#true} is VALID [2020-07-17 22:51:47,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {1004#true} assume true; {1004#true} is VALID [2020-07-17 22:51:47,217 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1004#true} {1004#true} #73#return; {1004#true} is VALID [2020-07-17 22:51:47,217 INFO L263 TraceCheckUtils]: 3: Hoare triple {1004#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {1004#true} is VALID [2020-07-17 22:51:47,217 INFO L280 TraceCheckUtils]: 4: Hoare triple {1004#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {1004#true} is VALID [2020-07-17 22:51:47,220 INFO L280 TraceCheckUtils]: 5: Hoare triple {1004#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1008#(<= 0 main_~i~0)} is VALID [2020-07-17 22:51:47,221 INFO L280 TraceCheckUtils]: 6: Hoare triple {1008#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {1009#(<= 1 main_~i~0)} is VALID [2020-07-17 22:51:47,222 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1010#(<= main_~n~0 main_~i~0)} is VALID [2020-07-17 22:51:47,222 INFO L280 TraceCheckUtils]: 8: Hoare triple {1010#(<= main_~n~0 main_~i~0)} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1010#(<= main_~n~0 main_~i~0)} is VALID [2020-07-17 22:51:47,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {1010#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {1005#false} is VALID [2020-07-17 22:51:47,235 INFO L280 TraceCheckUtils]: 10: Hoare triple {1005#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1005#false} is VALID [2020-07-17 22:51:47,235 INFO L280 TraceCheckUtils]: 11: Hoare triple {1005#false} assume !(0 == ~v~0); {1005#false} is VALID [2020-07-17 22:51:47,235 INFO L280 TraceCheckUtils]: 12: Hoare triple {1005#false} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {1005#false} is VALID [2020-07-17 22:51:47,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {1005#false} assume !(~i~0 < ~n~0); {1005#false} is VALID [2020-07-17 22:51:47,236 INFO L280 TraceCheckUtils]: 14: Hoare triple {1005#false} ~j~0 := 0; {1005#false} is VALID [2020-07-17 22:51:47,236 INFO L280 TraceCheckUtils]: 15: Hoare triple {1005#false} assume !!(~j~0 < ~n~0); {1005#false} is VALID [2020-07-17 22:51:47,236 INFO L263 TraceCheckUtils]: 16: Hoare triple {1005#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1005#false} is VALID [2020-07-17 22:51:47,237 INFO L280 TraceCheckUtils]: 17: Hoare triple {1005#false} ~cond := #in~cond; {1005#false} is VALID [2020-07-17 22:51:47,237 INFO L280 TraceCheckUtils]: 18: Hoare triple {1005#false} assume 0 == ~cond; {1005#false} is VALID [2020-07-17 22:51:47,237 INFO L280 TraceCheckUtils]: 19: Hoare triple {1005#false} assume !false; {1005#false} is VALID [2020-07-17 22:51:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:47,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169017694] [2020-07-17 22:51:47,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763125648] [2020-07-17 22:51:47,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:47,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:51:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:47,276 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:47,339 INFO L263 TraceCheckUtils]: 0: Hoare triple {1004#true} call ULTIMATE.init(); {1004#true} is VALID [2020-07-17 22:51:47,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {1004#true} assume true; {1004#true} is VALID [2020-07-17 22:51:47,340 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1004#true} {1004#true} #73#return; {1004#true} is VALID [2020-07-17 22:51:47,340 INFO L263 TraceCheckUtils]: 3: Hoare triple {1004#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {1004#true} is VALID [2020-07-17 22:51:47,341 INFO L280 TraceCheckUtils]: 4: Hoare triple {1004#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {1004#true} is VALID [2020-07-17 22:51:47,342 INFO L280 TraceCheckUtils]: 5: Hoare triple {1004#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1008#(<= 0 main_~i~0)} is VALID [2020-07-17 22:51:47,344 INFO L280 TraceCheckUtils]: 6: Hoare triple {1008#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {1009#(<= 1 main_~i~0)} is VALID [2020-07-17 22:51:47,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1035#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:51:47,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {1035#(and (< main_~n~0 2) (<= 1 main_~i~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1035#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:51:47,348 INFO L280 TraceCheckUtils]: 9: Hoare triple {1035#(and (< main_~n~0 2) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {1005#false} is VALID [2020-07-17 22:51:47,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {1005#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1005#false} is VALID [2020-07-17 22:51:47,348 INFO L280 TraceCheckUtils]: 11: Hoare triple {1005#false} assume !(0 == ~v~0); {1005#false} is VALID [2020-07-17 22:51:47,349 INFO L280 TraceCheckUtils]: 12: Hoare triple {1005#false} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {1005#false} is VALID [2020-07-17 22:51:47,349 INFO L280 TraceCheckUtils]: 13: Hoare triple {1005#false} assume !(~i~0 < ~n~0); {1005#false} is VALID [2020-07-17 22:51:47,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {1005#false} ~j~0 := 0; {1005#false} is VALID [2020-07-17 22:51:47,349 INFO L280 TraceCheckUtils]: 15: Hoare triple {1005#false} assume !!(~j~0 < ~n~0); {1005#false} is VALID [2020-07-17 22:51:47,350 INFO L263 TraceCheckUtils]: 16: Hoare triple {1005#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1005#false} is VALID [2020-07-17 22:51:47,350 INFO L280 TraceCheckUtils]: 17: Hoare triple {1005#false} ~cond := #in~cond; {1005#false} is VALID [2020-07-17 22:51:47,350 INFO L280 TraceCheckUtils]: 18: Hoare triple {1005#false} assume 0 == ~cond; {1005#false} is VALID [2020-07-17 22:51:47,350 INFO L280 TraceCheckUtils]: 19: Hoare triple {1005#false} assume !false; {1005#false} is VALID [2020-07-17 22:51:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:47,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:51:47,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2020-07-17 22:51:47,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492094066] [2020-07-17 22:51:47,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:51:47,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:47,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:47,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:47,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:47,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:47,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:47,378 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 5 states. [2020-07-17 22:51:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:47,463 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2020-07-17 22:51:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:51:47,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:51:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:51:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:51:47,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-17 22:51:47,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:47,509 INFO L225 Difference]: With dead ends: 61 [2020-07-17 22:51:47,509 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:51:47,510 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:51:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-17 22:51:47,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:47,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2020-07-17 22:51:47,536 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2020-07-17 22:51:47,536 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2020-07-17 22:51:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:47,538 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:51:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:51:47,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:47,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:47,539 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2020-07-17 22:51:47,539 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2020-07-17 22:51:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:47,541 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:51:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:51:47,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:47,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:47,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:47,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:51:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-17 22:51:47,544 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2020-07-17 22:51:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:47,544 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-17 22:51:47,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:51:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:51:47,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:47,546 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] [2020-07-17 22:51:47,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:47,747 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:47,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1470890089, now seen corresponding path program 1 times [2020-07-17 22:51:47,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:47,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271507618] [2020-07-17 22:51:47,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:47,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {1253#true} assume true; {1253#true} is VALID [2020-07-17 22:51:47,862 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1253#true} {1253#true} #73#return; {1253#true} is VALID [2020-07-17 22:51:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:47,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {1253#true} ~cond := #in~cond; {1253#true} is VALID [2020-07-17 22:51:47,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {1253#true} assume !(0 == ~cond); {1253#true} is VALID [2020-07-17 22:51:47,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {1253#true} assume true; {1253#true} is VALID [2020-07-17 22:51:47,873 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1253#true} {1259#(<= 4000 main_~k~0)} #77#return; {1259#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:47,874 INFO L263 TraceCheckUtils]: 0: Hoare triple {1253#true} call ULTIMATE.init(); {1253#true} is VALID [2020-07-17 22:51:47,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {1253#true} assume true; {1253#true} is VALID [2020-07-17 22:51:47,874 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1253#true} {1253#true} #73#return; {1253#true} is VALID [2020-07-17 22:51:47,875 INFO L263 TraceCheckUtils]: 3: Hoare triple {1253#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {1253#true} is VALID [2020-07-17 22:51:47,877 INFO L280 TraceCheckUtils]: 4: Hoare triple {1253#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {1257#(<= 4000 main_~c1~0)} is VALID [2020-07-17 22:51:47,878 INFO L280 TraceCheckUtils]: 5: Hoare triple {1257#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1258#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-17 22:51:47,879 INFO L280 TraceCheckUtils]: 6: Hoare triple {1258#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {1258#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-17 22:51:47,879 INFO L280 TraceCheckUtils]: 7: Hoare triple {1258#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1258#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-17 22:51:47,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {1258#(<= 4000 (+ main_~c1~0 main_~k~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1259#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:47,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {1259#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {1259#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:47,881 INFO L280 TraceCheckUtils]: 10: Hoare triple {1259#(<= 4000 main_~k~0)} ~j~0 := 0; {1259#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:47,882 INFO L280 TraceCheckUtils]: 11: Hoare triple {1259#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {1259#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:47,882 INFO L263 TraceCheckUtils]: 12: Hoare triple {1259#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1253#true} is VALID [2020-07-17 22:51:47,883 INFO L280 TraceCheckUtils]: 13: Hoare triple {1253#true} ~cond := #in~cond; {1253#true} is VALID [2020-07-17 22:51:47,883 INFO L280 TraceCheckUtils]: 14: Hoare triple {1253#true} assume !(0 == ~cond); {1253#true} is VALID [2020-07-17 22:51:47,883 INFO L280 TraceCheckUtils]: 15: Hoare triple {1253#true} assume true; {1253#true} is VALID [2020-07-17 22:51:47,884 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1253#true} {1259#(<= 4000 main_~k~0)} #77#return; {1259#(<= 4000 main_~k~0)} is VALID [2020-07-17 22:51:47,885 INFO L280 TraceCheckUtils]: 17: Hoare triple {1259#(<= 4000 main_~k~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := #t~post4 - 1;havoc #t~post4; {1264#(<= 3999 main_~k~0)} is VALID [2020-07-17 22:51:47,886 INFO L280 TraceCheckUtils]: 18: Hoare triple {1264#(<= 3999 main_~k~0)} assume !!(~j~0 < ~n~0); {1264#(<= 3999 main_~k~0)} is VALID [2020-07-17 22:51:47,887 INFO L263 TraceCheckUtils]: 19: Hoare triple {1264#(<= 3999 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1265#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:47,888 INFO L280 TraceCheckUtils]: 20: Hoare triple {1265#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1266#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:47,889 INFO L280 TraceCheckUtils]: 21: Hoare triple {1266#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1254#false} is VALID [2020-07-17 22:51:47,889 INFO L280 TraceCheckUtils]: 22: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2020-07-17 22:51:47,890 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-17 22:51:47,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271507618] [2020-07-17 22:51:47,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519208487] [2020-07-17 22:51:47,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:47,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:51:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:47,943 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:48,046 INFO L263 TraceCheckUtils]: 0: Hoare triple {1253#true} call ULTIMATE.init(); {1253#true} is VALID [2020-07-17 22:51:48,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {1253#true} assume true; {1253#true} is VALID [2020-07-17 22:51:48,047 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1253#true} {1253#true} #73#return; {1253#true} is VALID [2020-07-17 22:51:48,047 INFO L263 TraceCheckUtils]: 3: Hoare triple {1253#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {1253#true} is VALID [2020-07-17 22:51:48,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {1253#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {1253#true} is VALID [2020-07-17 22:51:48,048 INFO L280 TraceCheckUtils]: 5: Hoare triple {1253#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1253#true} is VALID [2020-07-17 22:51:48,048 INFO L280 TraceCheckUtils]: 6: Hoare triple {1253#true} assume !!(~i~0 < ~n~0);#t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~v~0 := #t~nondet2;havoc #t~nondet2; {1253#true} is VALID [2020-07-17 22:51:48,049 INFO L280 TraceCheckUtils]: 7: Hoare triple {1253#true} assume !!(0 <= ~v~0 && ~n~0 < 2); {1291#(< main_~n~0 2)} is VALID [2020-07-17 22:51:48,049 INFO L280 TraceCheckUtils]: 8: Hoare triple {1291#(< main_~n~0 2)} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1291#(< main_~n~0 2)} is VALID [2020-07-17 22:51:48,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {1291#(< main_~n~0 2)} assume !(~i~0 < ~n~0); {1291#(< main_~n~0 2)} is VALID [2020-07-17 22:51:48,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {1291#(< main_~n~0 2)} ~j~0 := 0; {1301#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2020-07-17 22:51:48,052 INFO L280 TraceCheckUtils]: 11: Hoare triple {1301#(and (<= 0 main_~j~0) (< main_~n~0 2))} assume !!(~j~0 < ~n~0); {1301#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2020-07-17 22:51:48,052 INFO L263 TraceCheckUtils]: 12: Hoare triple {1301#(and (<= 0 main_~j~0) (< main_~n~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1253#true} is VALID [2020-07-17 22:51:48,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {1253#true} ~cond := #in~cond; {1253#true} is VALID [2020-07-17 22:51:48,053 INFO L280 TraceCheckUtils]: 14: Hoare triple {1253#true} assume !(0 == ~cond); {1253#true} is VALID [2020-07-17 22:51:48,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {1253#true} assume true; {1253#true} is VALID [2020-07-17 22:51:48,054 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1253#true} {1301#(and (<= 0 main_~j~0) (< main_~n~0 2))} #77#return; {1301#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2020-07-17 22:51:48,055 INFO L280 TraceCheckUtils]: 17: Hoare triple {1301#(and (<= 0 main_~j~0) (< main_~n~0 2))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := #t~post4 - 1;havoc #t~post4; {1323#(and (<= 1 main_~j~0) (< main_~n~0 2))} is VALID [2020-07-17 22:51:48,056 INFO L280 TraceCheckUtils]: 18: Hoare triple {1323#(and (<= 1 main_~j~0) (< main_~n~0 2))} assume !!(~j~0 < ~n~0); {1254#false} is VALID [2020-07-17 22:51:48,056 INFO L263 TraceCheckUtils]: 19: Hoare triple {1254#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1254#false} is VALID [2020-07-17 22:51:48,056 INFO L280 TraceCheckUtils]: 20: Hoare triple {1254#false} ~cond := #in~cond; {1254#false} is VALID [2020-07-17 22:51:48,057 INFO L280 TraceCheckUtils]: 21: Hoare triple {1254#false} assume 0 == ~cond; {1254#false} is VALID [2020-07-17 22:51:48,057 INFO L280 TraceCheckUtils]: 22: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2020-07-17 22:51:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:48,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:51:48,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2020-07-17 22:51:48,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85928622] [2020-07-17 22:51:48,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-17 22:51:48,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:48,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:48,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:48,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:48,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:48,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:48,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:51:48,089 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2020-07-17 22:51:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:48,175 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:51:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:51:48,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-17 22:51:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-17 22:51:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-17 22:51:48,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2020-07-17 22:51:48,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:48,221 INFO L225 Difference]: With dead ends: 29 [2020-07-17 22:51:48,221 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:48,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:51:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:48,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:48,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:48,224 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:48,224 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:48,224 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:48,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:48,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:48,225 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:48,225 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:48,226 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:48,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:48,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:48,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:48,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:48,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-17 22:51:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:48,227 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:48,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:48,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:48,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:51:48,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:48,746 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:51:48,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:48,747 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:48,747 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:48,747 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:48,747 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:48,747 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:48,747 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:51:48,747 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:48,747 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:48,747 INFO L264 CegarLoopResult]: At program point L35-2(lines 35 39) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 4000 main_~c1~0)) (.cse2 (<= 2000 main_~c2~0)) (.cse3 (< main_~n~0 2)) (.cse4 (<= 1 main_~i~0))) (or (and .cse0 (<= 2000 main_~k~0) .cse1 .cse2 (<= 0 main_~j~0) .cse3 .cse4) (and (<= main_~i~0 0) (<= main_~n~0 0) (<= main_~n~0 main_~j~0)) (and .cse0 (<= 1 main_~j~0) .cse1 .cse2 .cse3 .cse4))) [2020-07-17 22:51:48,748 INFO L268 CegarLoopResult]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2020-07-17 22:51:48,748 INFO L268 CegarLoopResult]: For program point L29(lines 29 32) no Hoare annotation was computed. [2020-07-17 22:51:48,748 INFO L268 CegarLoopResult]: For program point L27(lines 27 32) no Hoare annotation was computed. [2020-07-17 22:51:48,748 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 (<= 0 main_~i~0) .cse1 .cse2 (<= 0 main_~k~0)) (and .cse0 (<= 2000 main_~k~0) .cse1 .cse2 (< main_~n~0 2) (<= 1 main_~i~0)))) [2020-07-17 22:51:48,748 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 41) no Hoare annotation was computed. [2020-07-17 22:51:48,748 INFO L268 CegarLoopResult]: For program point L23-2(lines 23 33) no Hoare annotation was computed. [2020-07-17 22:51:48,748 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 41) no Hoare annotation was computed. [2020-07-17 22:51:48,748 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 2000 main_~k~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 0 main_~j~0) (< main_~n~0 2) (<= 1 main_~i~0)) [2020-07-17 22:51:48,749 INFO L268 CegarLoopResult]: For program point L36-1(line 36) no Hoare annotation was computed. [2020-07-17 22:51:48,749 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 41) the Hoare annotation is: true [2020-07-17 22:51:48,749 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-17 22:51:48,749 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-17 22:51:48,749 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:51:48,749 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:48,749 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:51:48,749 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:51:48,749 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:48,750 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:51:48,753 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:48,753 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:48,754 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:51:48,755 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:48,756 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:51:48,756 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:51:48,760 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:48,760 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:48,760 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-17 22:51:48,761 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:51:48,761 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-17 22:51:48,761 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:51:48,761 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:51:48,761 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:51:48,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:48 BoogieIcfgContainer [2020-07-17 22:51:48,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:48,798 INFO L168 Benchmark]: Toolchain (without parser) took 6888.88 ms. Allocated memory was 138.4 MB in the beginning and 280.5 MB in the end (delta: 142.1 MB). Free memory was 103.3 MB in the beginning and 229.9 MB in the end (delta: -126.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:48,800 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:48,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.09 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 92.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:48,802 INFO L168 Benchmark]: Boogie Preprocessor took 112.90 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 181.1 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:48,808 INFO L168 Benchmark]: RCFGBuilder took 434.78 ms. Allocated memory is still 201.9 MB. Free memory was 181.1 MB in the beginning and 157.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:48,809 INFO L168 Benchmark]: TraceAbstraction took 5981.33 ms. Allocated memory was 201.9 MB in the beginning and 280.5 MB in the end (delta: 78.6 MB). Free memory was 157.2 MB in the beginning and 229.9 MB in the end (delta: -72.8 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:48,814 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 353.09 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 92.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.90 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 181.1 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 434.78 ms. Allocated memory is still 201.9 MB. Free memory was 181.1 MB in the beginning and 157.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5981.33 ms. Allocated memory was 201.9 MB in the beginning and 280.5 MB in the end (delta: 78.6 MB). Free memory was 157.2 MB in the beginning and 229.9 MB in the end (delta: -72.8 MB). Peak memory consumption was 5.9 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) && 0 <= i) && 4000 <= c1) && 2000 <= c2) && 0 <= k) || (((((10000 <= c3 && 2000 <= k) && 4000 <= c1) && 2000 <= c2) && n < 2) && 1 <= i) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((10000 <= c3 && 2000 <= k) && 4000 <= c1) && 2000 <= c2) && 0 <= j) && n < 2) && 1 <= i) || ((i <= 0 && n <= 0) && n <= j)) || (((((10000 <= c3 && 1 <= j) && 4000 <= c1) && 2000 <= c2) && n < 2) && 1 <= i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.5s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 146 SDtfs, 145 SDslu, 448 SDs, 0 SdLazy, 247 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 12 PreInvPairs, 18 NumberOfFragments, 118 HoareAnnotationTreeSize, 12 FomulaSimplifications, 152 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 88 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 8384 SizeOfPredicates, 12 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 16/26 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...