/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:48:42,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:48:42,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:48:42,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:48:42,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:48:42,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:48:42,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:48:42,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:48:42,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:48:42,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:48:42,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:48:42,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:48:42,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:48:42,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:48:42,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:48:42,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:48:42,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:48:42,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:48:42,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:48:42,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:48:42,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:48:42,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:48:42,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:48:42,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:48:42,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:48:42,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:48:42,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:48:42,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:48:42,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:48:42,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:48:42,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:48:42,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:48:42,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:48:42,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:48:42,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:48:42,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:48:42,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:48:42,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:48:42,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:48:42,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:48:42,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:48:42,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:48:42,280 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:48:42,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:48:42,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:48:42,283 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:48:42,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:48:42,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:48:42,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:48:42,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:48:42,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:48:42,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:48:42,285 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:48:42,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:48:42,285 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:48:42,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:48:42,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:48:42,286 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:48:42,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:48:42,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:48:42,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:48:42,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:48:42,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:48:42,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:48:42,292 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:48:42,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:48:42,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:48:42,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:48:42,573 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:48:42,573 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:48:42,574 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2020-07-18 00:48:42,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751ca0b49/8187b24731cb468d9b79289923daac6a/FLAG01922f66f [2020-07-18 00:48:43,157 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:48:43,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2020-07-18 00:48:43,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751ca0b49/8187b24731cb468d9b79289923daac6a/FLAG01922f66f [2020-07-18 00:48:43,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751ca0b49/8187b24731cb468d9b79289923daac6a [2020-07-18 00:48:43,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:48:43,524 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:48:43,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:43,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:48:43,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:48:43,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:43" (1/1) ... [2020-07-18 00:48:43,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8562bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43, skipping insertion in model container [2020-07-18 00:48:43,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:43" (1/1) ... [2020-07-18 00:48:43,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:48:43,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:48:43,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:43,742 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:48:43,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:43,784 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:48:43,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43 WrapperNode [2020-07-18 00:48:43,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:43,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:48:43,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:48:43,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:48:43,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43" (1/1) ... [2020-07-18 00:48:43,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43" (1/1) ... [2020-07-18 00:48:43,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43" (1/1) ... [2020-07-18 00:48:43,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43" (1/1) ... [2020-07-18 00:48:43,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43" (1/1) ... [2020-07-18 00:48:43,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43" (1/1) ... [2020-07-18 00:48:43,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43" (1/1) ... [2020-07-18 00:48:43,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:48:43,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:48:43,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:48:43,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:48:43,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:48:44,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:48:44,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:48:44,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:48:44,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:48:44,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:48:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:48:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:48:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:48:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:48:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:48:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:48:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:48:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:48:44,478 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:48:44,478 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 00:48:44,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:44 BoogieIcfgContainer [2020-07-18 00:48:44,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:48:44,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:48:44,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:48:44,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:48:44,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:48:43" (1/3) ... [2020-07-18 00:48:44,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fb692c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:44, skipping insertion in model container [2020-07-18 00:48:44,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:43" (2/3) ... [2020-07-18 00:48:44,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fb692c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:44, skipping insertion in model container [2020-07-18 00:48:44,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:44" (3/3) ... [2020-07-18 00:48:44,492 INFO L109 eAbstractionObserver]: Analyzing ICFG large_const.i [2020-07-18 00:48:44,504 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:48:44,512 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:48:44,526 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:48:44,548 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:48:44,549 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:48:44,549 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:48:44,549 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:48:44,549 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:48:44,549 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:48:44,550 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:48:44,550 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:48:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-18 00:48:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:48:44,574 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:44,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:44,576 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:44,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:44,583 INFO L82 PathProgramCache]: Analyzing trace with hash 288343897, now seen corresponding path program 1 times [2020-07-18 00:48:44,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:44,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186312283] [2020-07-18 00:48:44,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:44,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-18 00:48:44,774 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {58#true} {58#true} #104#return; {58#true} is VALID [2020-07-18 00:48:44,775 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2020-07-18 00:48:44,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-18 00:48:44,776 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #104#return; {58#true} is VALID [2020-07-18 00:48:44,777 INFO L263 TraceCheckUtils]: 3: Hoare triple {58#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {58#true} is VALID [2020-07-18 00:48:44,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {58#true} ~argc := #in~argc; {58#true} is VALID [2020-07-18 00:48:44,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {58#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {58#true} is VALID [2020-07-18 00:48:44,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {58#true} ~c1~0 := 4000; {58#true} is VALID [2020-07-18 00:48:44,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#true} ~c2~0 := 2000; {58#true} is VALID [2020-07-18 00:48:44,779 INFO L280 TraceCheckUtils]: 8: Hoare triple {58#true} ~c3~0 := 10000; {58#true} is VALID [2020-07-18 00:48:44,779 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#true} havoc ~n~0; {58#true} is VALID [2020-07-18 00:48:44,779 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#true} havoc ~v~0; {58#true} is VALID [2020-07-18 00:48:44,780 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#true} havoc ~i~0; {58#true} is VALID [2020-07-18 00:48:44,780 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#true} havoc ~k~0; {58#true} is VALID [2020-07-18 00:48:44,781 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#true} havoc ~j~0; {58#true} is VALID [2020-07-18 00:48:44,781 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {58#true} is VALID [2020-07-18 00:48:44,782 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#true} ~n~0 := #t~nondet0; {58#true} is VALID [2020-07-18 00:48:44,782 INFO L280 TraceCheckUtils]: 16: Hoare triple {58#true} havoc #t~nondet0; {58#true} is VALID [2020-07-18 00:48:44,782 INFO L280 TraceCheckUtils]: 17: Hoare triple {58#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {58#true} is VALID [2020-07-18 00:48:44,783 INFO L280 TraceCheckUtils]: 18: Hoare triple {58#true} ~k~0 := 0; {58#true} is VALID [2020-07-18 00:48:44,783 INFO L280 TraceCheckUtils]: 19: Hoare triple {58#true} ~i~0 := 0; {58#true} is VALID [2020-07-18 00:48:44,792 INFO L280 TraceCheckUtils]: 20: Hoare triple {58#true} assume !true; {59#false} is VALID [2020-07-18 00:48:44,792 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#false} ~j~0 := 0; {59#false} is VALID [2020-07-18 00:48:44,793 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#false} assume !!(~j~0 < ~n~0); {59#false} is VALID [2020-07-18 00:48:44,793 INFO L263 TraceCheckUtils]: 23: Hoare triple {59#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {59#false} is VALID [2020-07-18 00:48:44,794 INFO L280 TraceCheckUtils]: 24: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2020-07-18 00:48:44,794 INFO L280 TraceCheckUtils]: 25: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2020-07-18 00:48:44,795 INFO L280 TraceCheckUtils]: 26: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-18 00:48:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:48:44,804 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:44,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [186312283] [2020-07-18 00:48:44,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:44,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 00:48:44,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628855109] [2020-07-18 00:48:44,817 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2020-07-18 00:48:44,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:44,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 00:48:44,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:44,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 00:48:44,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:44,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 00:48:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:48:44,899 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-07-18 00:48:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:45,220 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2020-07-18 00:48:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 00:48:45,220 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2020-07-18 00:48:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:48:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2020-07-18 00:48:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:48:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2020-07-18 00:48:45,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2020-07-18 00:48:45,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:45,433 INFO L225 Difference]: With dead ends: 75 [2020-07-18 00:48:45,434 INFO L226 Difference]: Without dead ends: 48 [2020-07-18 00:48:45,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:48:45,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-18 00:48:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-18 00:48:45,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:45,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:45,505 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:45,505 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:45,511 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-18 00:48:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-18 00:48:45,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:45,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:45,513 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:45,513 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-18 00:48:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:45,519 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-18 00:48:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-18 00:48:45,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:45,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:45,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:45,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 00:48:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-07-18 00:48:45,539 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 27 [2020-07-18 00:48:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:45,540 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-07-18 00:48:45,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 00:48:45,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 51 transitions. [2020-07-18 00:48:45,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-18 00:48:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:48:45,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:45,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:45,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:48:45,594 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:45,595 INFO L82 PathProgramCache]: Analyzing trace with hash 320540924, now seen corresponding path program 1 times [2020-07-18 00:48:45,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:45,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [694941152] [2020-07-18 00:48:45,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:45,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-18 00:48:45,692 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {406#true} {406#true} #104#return; {406#true} is VALID [2020-07-18 00:48:45,693 INFO L263 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {406#true} is VALID [2020-07-18 00:48:45,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-18 00:48:45,693 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #104#return; {406#true} is VALID [2020-07-18 00:48:45,694 INFO L263 TraceCheckUtils]: 3: Hoare triple {406#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {406#true} is VALID [2020-07-18 00:48:45,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {406#true} ~argc := #in~argc; {406#true} is VALID [2020-07-18 00:48:45,694 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {406#true} is VALID [2020-07-18 00:48:45,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {406#true} ~c1~0 := 4000; {406#true} is VALID [2020-07-18 00:48:45,695 INFO L280 TraceCheckUtils]: 7: Hoare triple {406#true} ~c2~0 := 2000; {406#true} is VALID [2020-07-18 00:48:45,695 INFO L280 TraceCheckUtils]: 8: Hoare triple {406#true} ~c3~0 := 10000; {406#true} is VALID [2020-07-18 00:48:45,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#true} havoc ~n~0; {406#true} is VALID [2020-07-18 00:48:45,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#true} havoc ~v~0; {406#true} is VALID [2020-07-18 00:48:45,696 INFO L280 TraceCheckUtils]: 11: Hoare triple {406#true} havoc ~i~0; {406#true} is VALID [2020-07-18 00:48:45,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {406#true} havoc ~k~0; {406#true} is VALID [2020-07-18 00:48:45,697 INFO L280 TraceCheckUtils]: 13: Hoare triple {406#true} havoc ~j~0; {406#true} is VALID [2020-07-18 00:48:45,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {406#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {406#true} is VALID [2020-07-18 00:48:45,697 INFO L280 TraceCheckUtils]: 15: Hoare triple {406#true} ~n~0 := #t~nondet0; {406#true} is VALID [2020-07-18 00:48:45,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {406#true} havoc #t~nondet0; {406#true} is VALID [2020-07-18 00:48:45,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {406#true} assume !!(0 <= ~n~0 && ~n~0 < 10); {406#true} is VALID [2020-07-18 00:48:45,698 INFO L280 TraceCheckUtils]: 18: Hoare triple {406#true} ~k~0 := 0; {406#true} is VALID [2020-07-18 00:48:45,699 INFO L280 TraceCheckUtils]: 19: Hoare triple {406#true} ~i~0 := 0; {410#(<= main_~i~0 0)} is VALID [2020-07-18 00:48:45,700 INFO L280 TraceCheckUtils]: 20: Hoare triple {410#(<= main_~i~0 0)} assume !(~i~0 < ~n~0); {411#(<= main_~n~0 0)} is VALID [2020-07-18 00:48:45,701 INFO L280 TraceCheckUtils]: 21: Hoare triple {411#(<= main_~n~0 0)} ~j~0 := 0; {412#(<= main_~n~0 main_~j~0)} is VALID [2020-07-18 00:48:45,702 INFO L280 TraceCheckUtils]: 22: Hoare triple {412#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {407#false} is VALID [2020-07-18 00:48:45,702 INFO L263 TraceCheckUtils]: 23: Hoare triple {407#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {407#false} is VALID [2020-07-18 00:48:45,702 INFO L280 TraceCheckUtils]: 24: Hoare triple {407#false} ~cond := #in~cond; {407#false} is VALID [2020-07-18 00:48:45,703 INFO L280 TraceCheckUtils]: 25: Hoare triple {407#false} assume 0 == ~cond; {407#false} is VALID [2020-07-18 00:48:45,703 INFO L280 TraceCheckUtils]: 26: Hoare triple {407#false} assume !false; {407#false} is VALID [2020-07-18 00:48:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:48:45,708 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:45,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [694941152] [2020-07-18 00:48:45,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:45,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:48:45,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989059796] [2020-07-18 00:48:45,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 00:48:45,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:45,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:48:45,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:45,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:48:45,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:45,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:48:45,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:48:45,744 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2020-07-18 00:48:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:45,999 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-18 00:48:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:48:46,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 00:48:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-18 00:48:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-18 00:48:46,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2020-07-18 00:48:46,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:46,110 INFO L225 Difference]: With dead ends: 67 [2020-07-18 00:48:46,110 INFO L226 Difference]: Without dead ends: 51 [2020-07-18 00:48:46,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-18 00:48:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-07-18 00:48:46,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:46,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2020-07-18 00:48:46,138 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2020-07-18 00:48:46,139 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2020-07-18 00:48:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:46,142 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-18 00:48:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-18 00:48:46,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:46,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:46,144 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2020-07-18 00:48:46,144 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2020-07-18 00:48:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:46,148 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-18 00:48:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-18 00:48:46,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:46,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:46,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:46,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-18 00:48:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2020-07-18 00:48:46,152 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2020-07-18 00:48:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:46,152 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2020-07-18 00:48:46,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:48:46,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 52 transitions. [2020-07-18 00:48:46,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-18 00:48:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 00:48:46,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:46,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:46,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:48:46,215 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:46,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:46,216 INFO L82 PathProgramCache]: Analyzing trace with hash 751787059, now seen corresponding path program 1 times [2020-07-18 00:48:46,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:46,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958513528] [2020-07-18 00:48:46,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:46,427 INFO L280 TraceCheckUtils]: 0: Hoare triple {753#true} assume true; {753#true} is VALID [2020-07-18 00:48:46,427 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {753#true} {753#true} #104#return; {753#true} is VALID [2020-07-18 00:48:46,428 INFO L263 TraceCheckUtils]: 0: Hoare triple {753#true} call ULTIMATE.init(); {753#true} is VALID [2020-07-18 00:48:46,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {753#true} assume true; {753#true} is VALID [2020-07-18 00:48:46,429 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {753#true} {753#true} #104#return; {753#true} is VALID [2020-07-18 00:48:46,429 INFO L263 TraceCheckUtils]: 3: Hoare triple {753#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {753#true} is VALID [2020-07-18 00:48:46,429 INFO L280 TraceCheckUtils]: 4: Hoare triple {753#true} ~argc := #in~argc; {753#true} is VALID [2020-07-18 00:48:46,430 INFO L280 TraceCheckUtils]: 5: Hoare triple {753#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {753#true} is VALID [2020-07-18 00:48:46,431 INFO L280 TraceCheckUtils]: 6: Hoare triple {753#true} ~c1~0 := 4000; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,432 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#(<= 4000 main_~c1~0)} ~c2~0 := 2000; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,432 INFO L280 TraceCheckUtils]: 8: Hoare triple {757#(<= 4000 main_~c1~0)} ~c3~0 := 10000; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,433 INFO L280 TraceCheckUtils]: 9: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~n~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,434 INFO L280 TraceCheckUtils]: 10: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~v~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,435 INFO L280 TraceCheckUtils]: 11: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~i~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,436 INFO L280 TraceCheckUtils]: 12: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~k~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,436 INFO L280 TraceCheckUtils]: 13: Hoare triple {757#(<= 4000 main_~c1~0)} havoc ~j~0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,437 INFO L280 TraceCheckUtils]: 14: Hoare triple {757#(<= 4000 main_~c1~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,438 INFO L280 TraceCheckUtils]: 15: Hoare triple {757#(<= 4000 main_~c1~0)} ~n~0 := #t~nondet0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,439 INFO L280 TraceCheckUtils]: 16: Hoare triple {757#(<= 4000 main_~c1~0)} havoc #t~nondet0; {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,440 INFO L280 TraceCheckUtils]: 17: Hoare triple {757#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10); {757#(<= 4000 main_~c1~0)} is VALID [2020-07-18 00:48:46,441 INFO L280 TraceCheckUtils]: 18: Hoare triple {757#(<= 4000 main_~c1~0)} ~k~0 := 0; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,441 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} ~i~0 := 0; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,442 INFO L280 TraceCheckUtils]: 20: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(~i~0 < ~n~0); {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,443 INFO L280 TraceCheckUtils]: 21: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} #t~post1 := ~i~0; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,444 INFO L280 TraceCheckUtils]: 22: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} ~i~0 := 1 + #t~post1; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,445 INFO L280 TraceCheckUtils]: 23: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} havoc #t~post1; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,446 INFO L280 TraceCheckUtils]: 24: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,446 INFO L280 TraceCheckUtils]: 25: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} ~v~0 := #t~nondet2; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,447 INFO L280 TraceCheckUtils]: 26: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} havoc #t~nondet2; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,448 INFO L280 TraceCheckUtils]: 27: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,449 INFO L280 TraceCheckUtils]: 28: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} assume 0 == ~v~0; {758#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2020-07-18 00:48:46,450 INFO L280 TraceCheckUtils]: 29: Hoare triple {758#(<= 4000 (+ main_~c1~0 main_~k~0))} ~k~0 := ~k~0 + ~c1~0; {759#(<= 4000 main_~k~0)} is VALID [2020-07-18 00:48:46,451 INFO L280 TraceCheckUtils]: 30: Hoare triple {759#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {759#(<= 4000 main_~k~0)} is VALID [2020-07-18 00:48:46,452 INFO L280 TraceCheckUtils]: 31: Hoare triple {759#(<= 4000 main_~k~0)} ~j~0 := 0; {759#(<= 4000 main_~k~0)} is VALID [2020-07-18 00:48:46,452 INFO L280 TraceCheckUtils]: 32: Hoare triple {759#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {759#(<= 4000 main_~k~0)} is VALID [2020-07-18 00:48:46,454 INFO L263 TraceCheckUtils]: 33: Hoare triple {759#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {760#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:46,455 INFO L280 TraceCheckUtils]: 34: Hoare triple {760#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {761#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:46,456 INFO L280 TraceCheckUtils]: 35: Hoare triple {761#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {754#false} is VALID [2020-07-18 00:48:46,456 INFO L280 TraceCheckUtils]: 36: Hoare triple {754#false} assume !false; {754#false} is VALID [2020-07-18 00:48:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:48:46,460 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:46,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1958513528] [2020-07-18 00:48:46,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:46,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:48:46,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442865783] [2020-07-18 00:48:46,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-18 00:48:46,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:46,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:48:46,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:46,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:48:46,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:46,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:48:46,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:46,518 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 7 states. [2020-07-18 00:48:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:47,002 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2020-07-18 00:48:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:48:47,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-18 00:48:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 00:48:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 00:48:47,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2020-07-18 00:48:47,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:47,130 INFO L225 Difference]: With dead ends: 88 [2020-07-18 00:48:47,130 INFO L226 Difference]: Without dead ends: 86 [2020-07-18 00:48:47,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:48:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-18 00:48:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2020-07-18 00:48:47,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:47,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 66 states. [2020-07-18 00:48:47,239 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 66 states. [2020-07-18 00:48:47,239 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 66 states. [2020-07-18 00:48:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:47,244 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2020-07-18 00:48:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-07-18 00:48:47,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:47,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:47,250 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 86 states. [2020-07-18 00:48:47,251 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 86 states. [2020-07-18 00:48:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:47,255 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2020-07-18 00:48:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-07-18 00:48:47,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:47,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:47,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:47,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-18 00:48:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-07-18 00:48:47,260 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 37 [2020-07-18 00:48:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:47,260 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-07-18 00:48:47,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:48:47,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 71 transitions. [2020-07-18 00:48:47,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-07-18 00:48:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 00:48:47,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:47,344 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:47,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:48:47,345 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash 3796503, now seen corresponding path program 1 times [2020-07-18 00:48:47,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:47,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580540306] [2020-07-18 00:48:47,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:47,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {1250#true} assume true; {1250#true} is VALID [2020-07-18 00:48:47,493 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1250#true} {1250#true} #104#return; {1250#true} is VALID [2020-07-18 00:48:47,493 INFO L263 TraceCheckUtils]: 0: Hoare triple {1250#true} call ULTIMATE.init(); {1250#true} is VALID [2020-07-18 00:48:47,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {1250#true} assume true; {1250#true} is VALID [2020-07-18 00:48:47,493 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1250#true} {1250#true} #104#return; {1250#true} is VALID [2020-07-18 00:48:47,494 INFO L263 TraceCheckUtils]: 3: Hoare triple {1250#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {1250#true} is VALID [2020-07-18 00:48:47,494 INFO L280 TraceCheckUtils]: 4: Hoare triple {1250#true} ~argc := #in~argc; {1250#true} is VALID [2020-07-18 00:48:47,494 INFO L280 TraceCheckUtils]: 5: Hoare triple {1250#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {1250#true} is VALID [2020-07-18 00:48:47,494 INFO L280 TraceCheckUtils]: 6: Hoare triple {1250#true} ~c1~0 := 4000; {1250#true} is VALID [2020-07-18 00:48:47,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {1250#true} ~c2~0 := 2000; {1250#true} is VALID [2020-07-18 00:48:47,498 INFO L280 TraceCheckUtils]: 8: Hoare triple {1250#true} ~c3~0 := 10000; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,499 INFO L280 TraceCheckUtils]: 9: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~n~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,499 INFO L280 TraceCheckUtils]: 10: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~v~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,500 INFO L280 TraceCheckUtils]: 11: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~i~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,500 INFO L280 TraceCheckUtils]: 12: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~k~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,501 INFO L280 TraceCheckUtils]: 13: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc ~j~0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,501 INFO L280 TraceCheckUtils]: 14: Hoare triple {1254#(<= 10000 main_~c3~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,502 INFO L280 TraceCheckUtils]: 15: Hoare triple {1254#(<= 10000 main_~c3~0)} ~n~0 := #t~nondet0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,502 INFO L280 TraceCheckUtils]: 16: Hoare triple {1254#(<= 10000 main_~c3~0)} havoc #t~nondet0; {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,503 INFO L280 TraceCheckUtils]: 17: Hoare triple {1254#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10); {1254#(<= 10000 main_~c3~0)} is VALID [2020-07-18 00:48:47,503 INFO L280 TraceCheckUtils]: 18: Hoare triple {1254#(<= 10000 main_~c3~0)} ~k~0 := 0; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,504 INFO L280 TraceCheckUtils]: 19: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} ~i~0 := 0; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,506 INFO L280 TraceCheckUtils]: 20: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(~i~0 < ~n~0); {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,507 INFO L280 TraceCheckUtils]: 21: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} #t~post1 := ~i~0; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,514 INFO L280 TraceCheckUtils]: 22: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} ~i~0 := 1 + #t~post1; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,515 INFO L280 TraceCheckUtils]: 23: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} havoc #t~post1; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,515 INFO L280 TraceCheckUtils]: 24: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,516 INFO L280 TraceCheckUtils]: 25: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} ~v~0 := #t~nondet2; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,517 INFO L280 TraceCheckUtils]: 26: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} havoc #t~nondet2; {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,517 INFO L280 TraceCheckUtils]: 27: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,518 INFO L280 TraceCheckUtils]: 28: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(0 == ~v~0); {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,519 INFO L280 TraceCheckUtils]: 29: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(1 == ~v~0); {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2020-07-18 00:48:47,520 INFO L280 TraceCheckUtils]: 30: Hoare triple {1255#(<= 10000 (+ main_~c3~0 main_~k~0))} ~k~0 := ~k~0 + ~c3~0; {1256#(<= 10000 main_~k~0)} is VALID [2020-07-18 00:48:47,521 INFO L280 TraceCheckUtils]: 31: Hoare triple {1256#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {1256#(<= 10000 main_~k~0)} is VALID [2020-07-18 00:48:47,521 INFO L280 TraceCheckUtils]: 32: Hoare triple {1256#(<= 10000 main_~k~0)} ~j~0 := 0; {1256#(<= 10000 main_~k~0)} is VALID [2020-07-18 00:48:47,522 INFO L280 TraceCheckUtils]: 33: Hoare triple {1256#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {1256#(<= 10000 main_~k~0)} is VALID [2020-07-18 00:48:47,522 INFO L263 TraceCheckUtils]: 34: Hoare triple {1256#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1257#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:47,523 INFO L280 TraceCheckUtils]: 35: Hoare triple {1257#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1258#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:47,523 INFO L280 TraceCheckUtils]: 36: Hoare triple {1258#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1251#false} is VALID [2020-07-18 00:48:47,524 INFO L280 TraceCheckUtils]: 37: Hoare triple {1251#false} assume !false; {1251#false} is VALID [2020-07-18 00:48:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:48:47,526 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:47,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580540306] [2020-07-18 00:48:47,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:47,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:48:47,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034938293] [2020-07-18 00:48:47,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 00:48:47,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:47,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:48:47,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:47,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:48:47,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:48:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:47,569 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 7 states. [2020-07-18 00:48:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:48,190 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2020-07-18 00:48:48,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:48:48,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 00:48:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 00:48:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 00:48:48,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2020-07-18 00:48:48,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:48,321 INFO L225 Difference]: With dead ends: 105 [2020-07-18 00:48:48,321 INFO L226 Difference]: Without dead ends: 103 [2020-07-18 00:48:48,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:48:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-18 00:48:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2020-07-18 00:48:48,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:48,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 85 states. [2020-07-18 00:48:48,495 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 85 states. [2020-07-18 00:48:48,495 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 85 states. [2020-07-18 00:48:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:48,502 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-07-18 00:48:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-07-18 00:48:48,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:48,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:48,502 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 103 states. [2020-07-18 00:48:48,503 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 103 states. [2020-07-18 00:48:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:48,509 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-07-18 00:48:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-07-18 00:48:48,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:48,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:48,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:48,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-18 00:48:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-18 00:48:48,514 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 38 [2020-07-18 00:48:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:48,515 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-18 00:48:48,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:48:48,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-18 00:48:48,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-18 00:48:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 00:48:48,628 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:48,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:48,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:48:48,629 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 197728887, now seen corresponding path program 1 times [2020-07-18 00:48:48,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:48,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15912794] [2020-07-18 00:48:48,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:48,789 INFO L280 TraceCheckUtils]: 0: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-18 00:48:48,789 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1853#true} {1853#true} #104#return; {1853#true} is VALID [2020-07-18 00:48:48,790 INFO L263 TraceCheckUtils]: 0: Hoare triple {1853#true} call ULTIMATE.init(); {1853#true} is VALID [2020-07-18 00:48:48,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-18 00:48:48,790 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1853#true} {1853#true} #104#return; {1853#true} is VALID [2020-07-18 00:48:48,791 INFO L263 TraceCheckUtils]: 3: Hoare triple {1853#true} call #t~ret5 := main(#in~argc, #in~argv.base, #in~argv.offset); {1853#true} is VALID [2020-07-18 00:48:48,791 INFO L280 TraceCheckUtils]: 4: Hoare triple {1853#true} ~argc := #in~argc; {1853#true} is VALID [2020-07-18 00:48:48,792 INFO L280 TraceCheckUtils]: 5: Hoare triple {1853#true} ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {1853#true} is VALID [2020-07-18 00:48:48,792 INFO L280 TraceCheckUtils]: 6: Hoare triple {1853#true} ~c1~0 := 4000; {1853#true} is VALID [2020-07-18 00:48:48,793 INFO L280 TraceCheckUtils]: 7: Hoare triple {1853#true} ~c2~0 := 2000; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,793 INFO L280 TraceCheckUtils]: 8: Hoare triple {1857#(<= 2000 main_~c2~0)} ~c3~0 := 10000; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,794 INFO L280 TraceCheckUtils]: 9: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~n~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~v~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,795 INFO L280 TraceCheckUtils]: 11: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~i~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,796 INFO L280 TraceCheckUtils]: 12: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~k~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,796 INFO L280 TraceCheckUtils]: 13: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc ~j~0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,798 INFO L280 TraceCheckUtils]: 14: Hoare triple {1857#(<= 2000 main_~c2~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,799 INFO L280 TraceCheckUtils]: 15: Hoare triple {1857#(<= 2000 main_~c2~0)} ~n~0 := #t~nondet0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,799 INFO L280 TraceCheckUtils]: 16: Hoare triple {1857#(<= 2000 main_~c2~0)} havoc #t~nondet0; {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,800 INFO L280 TraceCheckUtils]: 17: Hoare triple {1857#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10); {1857#(<= 2000 main_~c2~0)} is VALID [2020-07-18 00:48:48,801 INFO L280 TraceCheckUtils]: 18: Hoare triple {1857#(<= 2000 main_~c2~0)} ~k~0 := 0; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,802 INFO L280 TraceCheckUtils]: 19: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} ~i~0 := 0; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,802 INFO L280 TraceCheckUtils]: 20: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(~i~0 < ~n~0); {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,803 INFO L280 TraceCheckUtils]: 21: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} #t~post1 := ~i~0; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,804 INFO L280 TraceCheckUtils]: 22: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} ~i~0 := 1 + #t~post1; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,804 INFO L280 TraceCheckUtils]: 23: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} havoc #t~post1; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,805 INFO L280 TraceCheckUtils]: 24: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,805 INFO L280 TraceCheckUtils]: 25: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} ~v~0 := #t~nondet2; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,806 INFO L280 TraceCheckUtils]: 26: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} havoc #t~nondet2; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,807 INFO L280 TraceCheckUtils]: 27: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,807 INFO L280 TraceCheckUtils]: 28: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !(0 == ~v~0); {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,808 INFO L280 TraceCheckUtils]: 29: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} assume 1 == ~v~0; {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2020-07-18 00:48:48,813 INFO L280 TraceCheckUtils]: 30: Hoare triple {1858#(<= 2000 (+ main_~c2~0 main_~k~0))} ~k~0 := ~k~0 + ~c2~0; {1859#(<= 2000 main_~k~0)} is VALID [2020-07-18 00:48:48,814 INFO L280 TraceCheckUtils]: 31: Hoare triple {1859#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {1859#(<= 2000 main_~k~0)} is VALID [2020-07-18 00:48:48,815 INFO L280 TraceCheckUtils]: 32: Hoare triple {1859#(<= 2000 main_~k~0)} ~j~0 := 0; {1859#(<= 2000 main_~k~0)} is VALID [2020-07-18 00:48:48,816 INFO L280 TraceCheckUtils]: 33: Hoare triple {1859#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {1859#(<= 2000 main_~k~0)} is VALID [2020-07-18 00:48:48,817 INFO L263 TraceCheckUtils]: 34: Hoare triple {1859#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1860#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:48,818 INFO L280 TraceCheckUtils]: 35: Hoare triple {1860#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1861#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:48,818 INFO L280 TraceCheckUtils]: 36: Hoare triple {1861#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1854#false} is VALID [2020-07-18 00:48:48,819 INFO L280 TraceCheckUtils]: 37: Hoare triple {1854#false} assume !false; {1854#false} is VALID [2020-07-18 00:48:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:48:48,822 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:48,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15912794] [2020-07-18 00:48:48,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:48,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:48:48,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244335679] [2020-07-18 00:48:48,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 00:48:48,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:48,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:48:48,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:48,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:48:48,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:48:48,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:48,864 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2020-07-18 00:48:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:49,516 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2020-07-18 00:48:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:48:49,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 00:48:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 00:48:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2020-07-18 00:48:49,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2020-07-18 00:48:49,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:49,632 INFO L225 Difference]: With dead ends: 116 [2020-07-18 00:48:49,632 INFO L226 Difference]: Without dead ends: 114 [2020-07-18 00:48:49,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:48:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-18 00:48:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2020-07-18 00:48:49,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:49,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 97 states. [2020-07-18 00:48:49,855 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 97 states. [2020-07-18 00:48:49,855 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 97 states. [2020-07-18 00:48:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:49,860 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2020-07-18 00:48:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2020-07-18 00:48:49,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:49,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:49,861 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 114 states. [2020-07-18 00:48:49,861 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 114 states. [2020-07-18 00:48:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:49,866 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2020-07-18 00:48:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2020-07-18 00:48:49,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:49,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:49,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:49,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-18 00:48:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2020-07-18 00:48:49,870 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 38 [2020-07-18 00:48:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:49,871 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2020-07-18 00:48:49,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:48:49,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 110 transitions. [2020-07-18 00:48:50,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2020-07-18 00:48:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 00:48:50,029 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:50,029 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:50,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:48:50,030 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:50,030 INFO L82 PathProgramCache]: Analyzing trace with hash 88652198, now seen corresponding path program 1 times [2020-07-18 00:48:50,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:50,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1375408800] [2020-07-18 00:48:50,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:50,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:48:50,046 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:48:50,052 INFO L168 Benchmark]: Toolchain (without parser) took 6528.84 ms. Allocated memory was 145.8 MB in the beginning and 288.9 MB in the end (delta: 143.1 MB). Free memory was 102.5 MB in the beginning and 235.8 MB in the end (delta: -133.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:50,053 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:48:50,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.96 ms. Allocated memory is still 145.8 MB. Free memory was 102.1 MB in the beginning and 92.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:50,055 INFO L168 Benchmark]: Boogie Preprocessor took 171.06 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 92.0 MB in the beginning and 183.3 MB in the end (delta: -91.3 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:50,055 INFO L168 Benchmark]: RCFGBuilder took 526.54 ms. Allocated memory is still 205.0 MB. Free memory was 183.3 MB in the beginning and 157.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:50,056 INFO L168 Benchmark]: TraceAbstraction took 5564.49 ms. Allocated memory was 205.0 MB in the beginning and 288.9 MB in the end (delta: 83.9 MB). Free memory was 157.7 MB in the beginning and 235.8 MB in the end (delta: -78.1 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:50,060 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.23 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 259.96 ms. Allocated memory is still 145.8 MB. Free memory was 102.1 MB in the beginning and 92.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 171.06 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 92.0 MB in the beginning and 183.3 MB in the end (delta: -91.3 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.54 ms. Allocated memory is still 205.0 MB. Free memory was 183.3 MB in the beginning and 157.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5564.49 ms. Allocated memory was 205.0 MB in the beginning and 288.9 MB in the end (delta: 83.9 MB). Free memory was 157.7 MB in the beginning and 235.8 MB in the end (delta: -78.1 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...