/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/nest-if3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:31:22,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:31:22,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:31:22,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:31:22,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:31:22,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:31:22,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:31:22,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:31:22,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:31:22,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:31:22,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:31:22,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:31:22,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:31:22,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:31:22,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:31:22,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:31:22,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:31:22,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:31:22,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:31:22,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:31:22,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:31:22,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:31:22,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:31:22,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:31:22,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:31:22,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:31:22,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:31:22,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:31:22,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:31:22,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:31:22,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:31:22,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:31:22,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:31:22,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:31:22,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:31:22,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:31:22,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:31:22,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:31:22,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:31:22,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:31:22,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:31:22,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:31:22,578 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:31:22,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:31:22,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:31:22,582 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:31:22,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:31:22,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:31:22,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:31:22,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:31:22,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:31:22,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:31:22,584 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:31:22,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:31:22,584 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:31:22,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:31:22,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:31:22,585 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:31:22,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:31:22,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:31:22,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:31:22,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:31:22,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:31:22,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:31:22,589 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:31:22,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:31:22,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:31:22,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:31:22,906 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:31:22,907 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:31:22,907 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nest-if3.i [2020-07-11 02:31:22,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc6e5313/303d4cc05e0b465eb71c57e64c8ab3b5/FLAG0b012d78a [2020-07-11 02:31:23,345 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:31:23,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nest-if3.i [2020-07-11 02:31:23,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc6e5313/303d4cc05e0b465eb71c57e64c8ab3b5/FLAG0b012d78a [2020-07-11 02:31:23,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc6e5313/303d4cc05e0b465eb71c57e64c8ab3b5 [2020-07-11 02:31:23,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:31:23,788 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:31:23,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:23,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:31:23,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:31:23,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:23" (1/1) ... [2020-07-11 02:31:23,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f198c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:23, skipping insertion in model container [2020-07-11 02:31:23,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:23" (1/1) ... [2020-07-11 02:31:23,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:31:23,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:31:24,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:24,034 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:31:24,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:24,071 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:31:24,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24 WrapperNode [2020-07-11 02:31:24,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:24,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:31:24,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:31:24,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:31:24,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24" (1/1) ... [2020-07-11 02:31:24,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24" (1/1) ... [2020-07-11 02:31:24,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24" (1/1) ... [2020-07-11 02:31:24,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24" (1/1) ... [2020-07-11 02:31:24,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24" (1/1) ... [2020-07-11 02:31:24,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24" (1/1) ... [2020-07-11 02:31:24,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24" (1/1) ... [2020-07-11 02:31:24,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:31:24,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:31:24,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:31:24,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:31:24,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24" (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-11 02:31:24,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:31:24,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:31:24,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:31:24,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:31:24,281 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:31:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:31:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:31:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:31:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:31:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:31:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:31:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:31:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:31:24,584 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:31:24,585 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-11 02:31:24,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:24 BoogieIcfgContainer [2020-07-11 02:31:24,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:31:24,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:31:24,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:31:24,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:31:24,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:31:23" (1/3) ... [2020-07-11 02:31:24,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bf8b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:24, skipping insertion in model container [2020-07-11 02:31:24,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:24" (2/3) ... [2020-07-11 02:31:24,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bf8b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:24, skipping insertion in model container [2020-07-11 02:31:24,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:24" (3/3) ... [2020-07-11 02:31:24,602 INFO L109 eAbstractionObserver]: Analyzing ICFG nest-if3.i [2020-07-11 02:31:24,614 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:31:24,621 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:31:24,637 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:31:24,670 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:31:24,671 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:31:24,671 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:31:24,671 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:31:24,674 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:31:24,674 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:31:24,675 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:31:24,675 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:31:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-07-11 02:31:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-11 02:31:24,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:24,729 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] [2020-07-11 02:31:24,729 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:24,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash 781844856, now seen corresponding path program 1 times [2020-07-11 02:31:24,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:24,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [184374143] [2020-07-11 02:31:24,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:25,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#true} assume true; {49#true} is VALID [2020-07-11 02:31:25,033 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {49#true} {49#true} #93#return; {49#true} is VALID [2020-07-11 02:31:25,035 INFO L263 TraceCheckUtils]: 0: Hoare triple {49#true} call ULTIMATE.init(); {49#true} is VALID [2020-07-11 02:31:25,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#true} assume true; {49#true} is VALID [2020-07-11 02:31:25,035 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {49#true} {49#true} #93#return; {49#true} is VALID [2020-07-11 02:31:25,036 INFO L263 TraceCheckUtils]: 3: Hoare triple {49#true} call #t~ret5 := main(); {49#true} is VALID [2020-07-11 02:31:25,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {49#true} havoc ~i~0; {49#true} is VALID [2020-07-11 02:31:25,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {49#true} havoc ~k~0; {49#true} is VALID [2020-07-11 02:31:25,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {49#true} havoc ~n~0; {49#true} is VALID [2020-07-11 02:31:25,037 INFO L280 TraceCheckUtils]: 7: Hoare triple {49#true} havoc ~l~0; {49#true} is VALID [2020-07-11 02:31:25,037 INFO L280 TraceCheckUtils]: 8: Hoare triple {49#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {49#true} is VALID [2020-07-11 02:31:25,038 INFO L280 TraceCheckUtils]: 9: Hoare triple {49#true} ~n~0 := #t~nondet0; {49#true} is VALID [2020-07-11 02:31:25,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {49#true} havoc #t~nondet0; {49#true} is VALID [2020-07-11 02:31:25,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {49#true} is VALID [2020-07-11 02:31:25,039 INFO L280 TraceCheckUtils]: 12: Hoare triple {49#true} ~l~0 := #t~nondet1; {49#true} is VALID [2020-07-11 02:31:25,039 INFO L280 TraceCheckUtils]: 13: Hoare triple {49#true} havoc #t~nondet1; {49#true} is VALID [2020-07-11 02:31:25,041 INFO L280 TraceCheckUtils]: 14: Hoare triple {49#true} assume !!(~l~0 > 0); {53#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:25,042 INFO L280 TraceCheckUtils]: 15: Hoare triple {53#(<= 1 main_~l~0)} assume !!(~l~0 < 1000000); {53#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:25,043 INFO L280 TraceCheckUtils]: 16: Hoare triple {53#(<= 1 main_~l~0)} assume !!(~n~0 < 1000000); {53#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:25,044 INFO L280 TraceCheckUtils]: 17: Hoare triple {53#(<= 1 main_~l~0)} ~k~0 := 1; {53#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:25,046 INFO L280 TraceCheckUtils]: 18: Hoare triple {53#(<= 1 main_~l~0)} assume !!(~k~0 < ~n~0); {53#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:25,047 INFO L280 TraceCheckUtils]: 19: Hoare triple {53#(<= 1 main_~l~0)} ~i~0 := ~l~0; {54#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:25,049 INFO L280 TraceCheckUtils]: 20: Hoare triple {54#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0); {54#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:25,052 INFO L263 TraceCheckUtils]: 21: Hoare triple {54#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:25,053 INFO L280 TraceCheckUtils]: 22: Hoare triple {55#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {56#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:25,054 INFO L280 TraceCheckUtils]: 23: Hoare triple {56#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {50#false} is VALID [2020-07-11 02:31:25,054 INFO L280 TraceCheckUtils]: 24: Hoare triple {50#false} assume !false; {50#false} is VALID [2020-07-11 02:31:25,058 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-11 02:31:25,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [184374143] [2020-07-11 02:31:25,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:25,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:31:25,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879673588] [2020-07-11 02:31:25,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 02:31:25,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:25,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:31:25,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:25,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:31:25,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:31:25,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:31:25,129 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2020-07-11 02:31:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:25,623 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2020-07-11 02:31:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:31:25,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 02:31:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-11 02:31:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-11 02:31:25,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2020-07-11 02:31:25,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:25,799 INFO L225 Difference]: With dead ends: 93 [2020-07-11 02:31:25,799 INFO L226 Difference]: Without dead ends: 57 [2020-07-11 02:31:25,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:31:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-11 02:31:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2020-07-11 02:31:25,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:25,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 45 states. [2020-07-11 02:31:25,891 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 45 states. [2020-07-11 02:31:25,892 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 45 states. [2020-07-11 02:31:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:25,898 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-07-11 02:31:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-11 02:31:25,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:25,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:25,900 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 57 states. [2020-07-11 02:31:25,900 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 57 states. [2020-07-11 02:31:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:25,905 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-07-11 02:31:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-11 02:31:25,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:25,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:25,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:25,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-11 02:31:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-11 02:31:25,913 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 25 [2020-07-11 02:31:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:25,914 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-11 02:31:25,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:31:25,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2020-07-11 02:31:25,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-11 02:31:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 02:31:25,979 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:25,979 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] [2020-07-11 02:31:25,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:31:25,981 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1778608888, now seen corresponding path program 1 times [2020-07-11 02:31:25,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:25,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1158849749] [2020-07-11 02:31:25,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:26,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {453#true} assume true; {453#true} is VALID [2020-07-11 02:31:26,136 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {453#true} {453#true} #93#return; {453#true} is VALID [2020-07-11 02:31:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:26,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {453#true} ~cond := #in~cond; {453#true} is VALID [2020-07-11 02:31:26,146 INFO L280 TraceCheckUtils]: 1: Hoare triple {453#true} assume !(0 == ~cond); {453#true} is VALID [2020-07-11 02:31:26,147 INFO L280 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2020-07-11 02:31:26,148 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {453#true} {458#(<= 1 main_~i~0)} #97#return; {458#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:26,148 INFO L263 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2020-07-11 02:31:26,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {453#true} assume true; {453#true} is VALID [2020-07-11 02:31:26,149 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {453#true} {453#true} #93#return; {453#true} is VALID [2020-07-11 02:31:26,149 INFO L263 TraceCheckUtils]: 3: Hoare triple {453#true} call #t~ret5 := main(); {453#true} is VALID [2020-07-11 02:31:26,149 INFO L280 TraceCheckUtils]: 4: Hoare triple {453#true} havoc ~i~0; {453#true} is VALID [2020-07-11 02:31:26,150 INFO L280 TraceCheckUtils]: 5: Hoare triple {453#true} havoc ~k~0; {453#true} is VALID [2020-07-11 02:31:26,150 INFO L280 TraceCheckUtils]: 6: Hoare triple {453#true} havoc ~n~0; {453#true} is VALID [2020-07-11 02:31:26,150 INFO L280 TraceCheckUtils]: 7: Hoare triple {453#true} havoc ~l~0; {453#true} is VALID [2020-07-11 02:31:26,151 INFO L280 TraceCheckUtils]: 8: Hoare triple {453#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {453#true} is VALID [2020-07-11 02:31:26,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {453#true} ~n~0 := #t~nondet0; {453#true} is VALID [2020-07-11 02:31:26,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {453#true} havoc #t~nondet0; {453#true} is VALID [2020-07-11 02:31:26,152 INFO L280 TraceCheckUtils]: 11: Hoare triple {453#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {453#true} is VALID [2020-07-11 02:31:26,152 INFO L280 TraceCheckUtils]: 12: Hoare triple {453#true} ~l~0 := #t~nondet1; {453#true} is VALID [2020-07-11 02:31:26,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {453#true} havoc #t~nondet1; {453#true} is VALID [2020-07-11 02:31:26,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {453#true} assume !!(~l~0 > 0); {457#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:26,154 INFO L280 TraceCheckUtils]: 15: Hoare triple {457#(<= 1 main_~l~0)} assume !!(~l~0 < 1000000); {457#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:26,155 INFO L280 TraceCheckUtils]: 16: Hoare triple {457#(<= 1 main_~l~0)} assume !!(~n~0 < 1000000); {457#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:26,156 INFO L280 TraceCheckUtils]: 17: Hoare triple {457#(<= 1 main_~l~0)} ~k~0 := 1; {457#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:26,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {457#(<= 1 main_~l~0)} assume !!(~k~0 < ~n~0); {457#(<= 1 main_~l~0)} is VALID [2020-07-11 02:31:26,158 INFO L280 TraceCheckUtils]: 19: Hoare triple {457#(<= 1 main_~l~0)} ~i~0 := ~l~0; {458#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:26,159 INFO L280 TraceCheckUtils]: 20: Hoare triple {458#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0); {458#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:26,159 INFO L263 TraceCheckUtils]: 21: Hoare triple {458#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {453#true} is VALID [2020-07-11 02:31:26,159 INFO L280 TraceCheckUtils]: 22: Hoare triple {453#true} ~cond := #in~cond; {453#true} is VALID [2020-07-11 02:31:26,160 INFO L280 TraceCheckUtils]: 23: Hoare triple {453#true} assume !(0 == ~cond); {453#true} is VALID [2020-07-11 02:31:26,160 INFO L280 TraceCheckUtils]: 24: Hoare triple {453#true} assume true; {453#true} is VALID [2020-07-11 02:31:26,161 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {453#true} {458#(<= 1 main_~i~0)} #97#return; {458#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:26,162 INFO L280 TraceCheckUtils]: 26: Hoare triple {458#(<= 1 main_~i~0)} #t~post3 := ~i~0; {463#(<= 1 |main_#t~post3|)} is VALID [2020-07-11 02:31:26,163 INFO L280 TraceCheckUtils]: 27: Hoare triple {463#(<= 1 |main_#t~post3|)} ~i~0 := 1 + #t~post3; {464#(<= 2 main_~i~0)} is VALID [2020-07-11 02:31:26,164 INFO L280 TraceCheckUtils]: 28: Hoare triple {464#(<= 2 main_~i~0)} havoc #t~post3; {464#(<= 2 main_~i~0)} is VALID [2020-07-11 02:31:26,165 INFO L280 TraceCheckUtils]: 29: Hoare triple {464#(<= 2 main_~i~0)} assume !!(~i~0 < ~n~0); {464#(<= 2 main_~i~0)} is VALID [2020-07-11 02:31:26,166 INFO L263 TraceCheckUtils]: 30: Hoare triple {464#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {465#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:26,167 INFO L280 TraceCheckUtils]: 31: Hoare triple {465#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {466#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:26,168 INFO L280 TraceCheckUtils]: 32: Hoare triple {466#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {454#false} is VALID [2020-07-11 02:31:26,168 INFO L280 TraceCheckUtils]: 33: Hoare triple {454#false} assume !false; {454#false} is VALID [2020-07-11 02:31:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:31:26,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1158849749] [2020-07-11 02:31:26,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:26,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 02:31:26,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603515978] [2020-07-11 02:31:26,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-11 02:31:26,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:26,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:31:26,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:26,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:31:26,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:26,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:31:26,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:31:26,219 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 8 states. [2020-07-11 02:31:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:26,714 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-07-11 02:31:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:31:26,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-11 02:31:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2020-07-11 02:31:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2020-07-11 02:31:26,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 60 transitions. [2020-07-11 02:31:26,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:26,792 INFO L225 Difference]: With dead ends: 59 [2020-07-11 02:31:26,793 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:31:26,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:31:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:31:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:31:26,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:26,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:26,795 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:26,795 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:26,796 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:26,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:26,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:26,797 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:26,797 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:26,797 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:26,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:26,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:26,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:26,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:31:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:31:26,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-11 02:31:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:26,799 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:31:26,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:31:26,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:31:26,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:26,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:26,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:31:26,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:31:27,274 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:31:27,274 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:31:27,274 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:31:27,274 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:31:27,274 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:31:27,275 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:31:27,275 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:31:27,275 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:31:27,275 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:31:27,275 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:31:27,275 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:31:27,275 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 27) the Hoare annotation is: true [2020-07-11 02:31:27,275 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (<= 1 main_~l~0) [2020-07-11 02:31:27,276 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (<= 1 main_~l~0) [2020-07-11 02:31:27,276 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 02:31:27,276 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-11 02:31:27,276 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-11 02:31:27,276 INFO L264 CegarLoopResult]: At program point L24(lines 24 25) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,276 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,276 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,277 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (<= 1 main_~l~0) [2020-07-11 02:31:27,277 INFO L264 CegarLoopResult]: At program point L20-3(lines 20 26) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,277 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 02:31:27,277 INFO L264 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,277 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-11 02:31:27,277 INFO L264 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,278 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-11 02:31:27,278 INFO L264 CegarLoopResult]: At program point L20-6(lines 20 26) the Hoare annotation is: (<= 1 main_~l~0) [2020-07-11 02:31:27,278 INFO L271 CegarLoopResult]: At program point L20-7(lines 13 27) the Hoare annotation is: true [2020-07-11 02:31:27,278 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,278 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (<= 1 main_~l~0) [2020-07-11 02:31:27,279 INFO L264 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 |main_#t~post3|) (<= 1 main_~i~0)) [2020-07-11 02:31:27,279 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-11 02:31:27,279 INFO L264 CegarLoopResult]: At program point L21-4(line 21) the Hoare annotation is: (and (<= 2 main_~i~0) (<= 1 main_~l~0) (<= 1 |main_#t~post3|)) [2020-07-11 02:31:27,279 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-11 02:31:27,279 INFO L264 CegarLoopResult]: At program point L21-5(lines 21 23) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,280 INFO L264 CegarLoopResult]: At program point L21-6(lines 21 23) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,280 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 27) the Hoare annotation is: true [2020-07-11 02:31:27,280 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,280 INFO L264 CegarLoopResult]: At program point L22-1(lines 21 23) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0)) [2020-07-11 02:31:27,280 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (<= 1 main_~l~0) [2020-07-11 02:31:27,280 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (<= 1 main_~l~0) [2020-07-11 02:31:27,281 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-11 02:31:27,281 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-11 02:31:27,281 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-11 02:31:27,281 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:31:27,281 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:31:27,281 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:31:27,282 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:31:27,282 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:31:27,282 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:31:27,286 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:31:27,287 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:31:27,288 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:31:27,289 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:31:27,289 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:31:27,306 INFO L163 areAnnotationChecker]: CFG has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:31:27,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:31:27 BoogieIcfgContainer [2020-07-11 02:31:27,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:31:27,323 INFO L168 Benchmark]: Toolchain (without parser) took 3534.75 ms. Allocated memory was 139.5 MB in the beginning and 242.7 MB in the end (delta: 103.3 MB). Free memory was 104.6 MB in the beginning and 190.5 MB in the end (delta: -85.9 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:27,324 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:31:27,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.44 ms. Allocated memory is still 139.5 MB. Free memory was 104.4 MB in the beginning and 94.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:27,326 INFO L168 Benchmark]: Boogie Preprocessor took 141.32 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 94.6 MB in the beginning and 183.4 MB in the end (delta: -88.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:27,327 INFO L168 Benchmark]: RCFGBuilder took 371.37 ms. Allocated memory is still 204.5 MB. Free memory was 183.4 MB in the beginning and 160.4 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:27,328 INFO L168 Benchmark]: TraceAbstraction took 2726.38 ms. Allocated memory was 204.5 MB in the beginning and 242.7 MB in the end (delta: 38.3 MB). Free memory was 160.4 MB in the beginning and 190.5 MB in the end (delta: -30.0 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:27,333 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.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.44 ms. Allocated memory is still 139.5 MB. Free memory was 104.4 MB in the beginning and 94.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.32 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 94.6 MB in the beginning and 183.4 MB in the end (delta: -88.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 371.37 ms. Allocated memory is still 204.5 MB. Free memory was 183.4 MB in the beginning and 160.4 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2726.38 ms. Allocated memory was 204.5 MB in the beginning and 242.7 MB in the end (delta: 38.3 MB). Free memory was 160.4 MB in the beginning and 190.5 MB in the end (delta: -30.0 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 <= l - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 <= l && 1 <= i - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.1s, OverallIterations: 2, TraceHistogramMax: 2, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 88 SDtfs, 92 SDslu, 338 SDs, 0 SdLazy, 133 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 58 PreInvPairs, 101 NumberOfFragments, 169 HoareAnnotationTreeSize, 58 FomulaSimplifications, 318 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 46 FomulaSimplificationsInter, 114 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 3135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...