java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/array-tiling/nr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:52:49,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:52:49,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:52:49,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:52:49,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:52:49,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:52:49,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:52:49,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:52:49,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:52:49,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:52:49,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:52:49,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:52:49,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:52:49,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:52:49,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:52:49,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:52:49,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:52:49,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:52:49,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:52:49,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:52:49,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:52:49,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:52:49,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:52:49,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:52:49,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:52:49,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:52:49,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:52:49,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:52:49,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:52:49,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:52:49,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:52:49,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:52:49,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:52:49,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:52:49,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:52:49,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:52:49,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:52:49,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:52:49,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:52:49,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:52:49,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:52:49,698 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:52:49,714 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:52:49,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:52:49,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:52:49,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:52:49,716 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:52:49,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:52:49,717 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:52:49,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:52:49,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:52:49,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:52:49,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:52:49,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:52:49,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:52:49,718 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:52:49,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:52:49,718 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:52:49,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:52:49,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:52:49,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:52:49,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:52:49,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:52:49,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:52:49,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:52:49,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:52:49,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:52:49,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:52:49,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:52:49,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:52:49,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-14 23:52:50,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:52:50,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:52:50,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:52:50,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:52:50,030 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:52:50,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr3.c [2019-10-14 23:52:50,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad65e865/a67860dcd06a4d7ca809c4d2b8281446/FLAG17a135976 [2019-10-14 23:52:50,528 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:52:50,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr3.c [2019-10-14 23:52:50,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad65e865/a67860dcd06a4d7ca809c4d2b8281446/FLAG17a135976 [2019-10-14 23:52:50,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad65e865/a67860dcd06a4d7ca809c4d2b8281446 [2019-10-14 23:52:50,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:52:50,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:52:50,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:50,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:52:50,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:52:50,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:50" (1/1) ... [2019-10-14 23:52:50,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fe3b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:50, skipping insertion in model container [2019-10-14 23:52:50,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:50" (1/1) ... [2019-10-14 23:52:50,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:52:50,964 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:52:51,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:51,148 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:52:51,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:51,192 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:52:51,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51 WrapperNode [2019-10-14 23:52:51,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:51,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:52:51,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:52:51,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:52:51,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (1/1) ... [2019-10-14 23:52:51,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:52:51,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:52:51,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:52:51,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:52:51,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (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 [2019-10-14 23:52:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:52:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:52:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:52:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:52:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:52:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:52:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:52:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:52:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:52:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 23:52:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:52:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:52:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:52:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:52:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:52:51,631 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:52:51,631 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:52:51,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:51 BoogieIcfgContainer [2019-10-14 23:52:51,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:52:51,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:52:51,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:52:51,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:52:51,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:52:50" (1/3) ... [2019-10-14 23:52:51,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736a299a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:51, skipping insertion in model container [2019-10-14 23:52:51,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:51" (2/3) ... [2019-10-14 23:52:51,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736a299a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:51, skipping insertion in model container [2019-10-14 23:52:51,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:51" (3/3) ... [2019-10-14 23:52:51,653 INFO L109 eAbstractionObserver]: Analyzing ICFG nr3.c [2019-10-14 23:52:51,675 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:52:51,687 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:52:51,706 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:52:51,746 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:52:51,746 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:52:51,746 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:52:51,747 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:52:51,747 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:52:51,747 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:52:51,747 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:52:51,747 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:52:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 23:52:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:52:51,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:51,780 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:51,782 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:51,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-10-14 23:52:51,794 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:51,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897014969] [2019-10-14 23:52:51,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:51,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:51,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:52,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897014969] [2019-10-14 23:52:52,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:52,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:52:52,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423685002] [2019-10-14 23:52:52,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:52:52,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:52,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:52:52,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:52:52,079 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2019-10-14 23:52:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:52,180 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-14 23:52:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:52:52,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 23:52:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:52,192 INFO L225 Difference]: With dead ends: 60 [2019-10-14 23:52:52,193 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 23:52:52,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:52:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 23:52:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 23:52:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 23:52:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-14 23:52:52,238 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-10-14 23:52:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,239 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-14 23:52:52,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:52:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-14 23:52:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:52:52,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,240 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:52,241 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-10-14 23:52:52,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701651967] [2019-10-14 23:52:52,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:52,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701651967] [2019-10-14 23:52:52,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:52,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:52:52,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833703526] [2019-10-14 23:52:52,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:52,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:52,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:52,473 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-10-14 23:52:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:52,553 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-14 23:52:52,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:52,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-14 23:52:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:52,558 INFO L225 Difference]: With dead ends: 52 [2019-10-14 23:52:52,558 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 23:52:52,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 23:52:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-14 23:52:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 23:52:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-14 23:52:52,576 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-10-14 23:52:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,577 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-14 23:52:52,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-14 23:52:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:52:52,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,580 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:52,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-10-14 23:52:52,582 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186326269] [2019-10-14 23:52:52,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:52,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186326269] [2019-10-14 23:52:52,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:52,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:52:52,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504419281] [2019-10-14 23:52:52,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:52:52,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:52,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:52:52,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:52,663 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2019-10-14 23:52:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:52,696 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-14 23:52:52,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:52,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:52:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:52,698 INFO L225 Difference]: With dead ends: 56 [2019-10-14 23:52:52,698 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 23:52:52,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 23:52:52,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-14 23:52:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 23:52:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-14 23:52:52,711 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-14 23:52:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,712 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-14 23:52:52,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:52:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-14 23:52:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:52:52,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,715 INFO L380 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] [2019-10-14 23:52:52,715 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-10-14 23:52:52,716 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873332187] [2019-10-14 23:52:52,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:52,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873332187] [2019-10-14 23:52:52,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:52,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:52:52,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556719975] [2019-10-14 23:52:52,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:52,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:52,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:52,792 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2019-10-14 23:52:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:52,843 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-10-14 23:52:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:52,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-14 23:52:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:52,845 INFO L225 Difference]: With dead ends: 57 [2019-10-14 23:52:52,845 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 23:52:52,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:52:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 23:52:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-14 23:52:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:52:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-14 23:52:52,854 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-10-14 23:52:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,855 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-14 23:52:52,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-14 23:52:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:52:52,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,856 INFO L380 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] [2019-10-14 23:52:52,857 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-10-14 23:52:52,858 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758430442] [2019-10-14 23:52:52,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:52,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758430442] [2019-10-14 23:52:52,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926073404] [2019-10-14 23:52:52,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:52:52,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:53,014 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:53,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1689882218] [2019-10-14 23:52:53,049 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-10-14 23:52:53,084 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:52:53,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:52:53,153 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:52:53,154 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 22 root evaluator evaluations with a maximum evaluation depth of 2. Performed 22 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Never found a fixpoint. Largest state had 25 variables. [2019-10-14 23:52:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:53,159 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:52:53,197 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 96.67% of their original sizes. [2019-10-14 23:52:53,197 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:52:53,206 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-10-14 23:52:53,206 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:52:53,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:52:53,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4] total 6 [2019-10-14 23:52:53,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180906321] [2019-10-14 23:52:53,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:52:53,208 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:53,208 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:52:53,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:52:53,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:53,209 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-10-14 23:52:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:53,213 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-10-14 23:52:53,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:53,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:52:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:53,214 INFO L225 Difference]: With dead ends: 33 [2019-10-14 23:52:53,214 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:52:53,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:52:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:52:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:52:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:52:53,215 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-14 23:52:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:53,215 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:52:53,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:52:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:52:53,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:52:53,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:53,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:52:53,485 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:53,485 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:53,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:53,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:53,486 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) [2019-10-14 23:52:53,486 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:53,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:53,486 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 43) no Hoare annotation was computed. [2019-10-14 23:52:53,487 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 41) no Hoare annotation was computed. [2019-10-14 23:52:53,487 INFO L443 ceAbstractionStarter]: For program point L11-2(lines 11 41) no Hoare annotation was computed. [2019-10-14 23:52:53,487 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 24 34) no Hoare annotation was computed. [2019-10-14 23:52:53,487 INFO L439 ceAbstractionStarter]: At program point L24-3(lines 24 34) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:53,487 INFO L443 ceAbstractionStarter]: For program point L37-2(lines 37 40) no Hoare annotation was computed. [2019-10-14 23:52:53,487 INFO L439 ceAbstractionStarter]: At program point L37-3(lines 37 40) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:53,488 INFO L443 ceAbstractionStarter]: For program point L37-4(lines 37 40) no Hoare annotation was computed. [2019-10-14 23:52:53,488 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 43) no Hoare annotation was computed. [2019-10-14 23:52:53,488 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 8 43) the Hoare annotation is: (or (and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:53,488 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 33) no Hoare annotation was computed. [2019-10-14 23:52:53,488 INFO L443 ceAbstractionStarter]: For program point L22-2(lines 22 35) no Hoare annotation was computed. [2019-10-14 23:52:53,489 INFO L439 ceAbstractionStarter]: At program point L22-3(lines 22 35) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:53,489 INFO L443 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-10-14 23:52:53,489 INFO L443 ceAbstractionStarter]: For program point L22-4(lines 22 35) no Hoare annotation was computed. [2019-10-14 23:52:53,489 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-14 23:52:53,489 INFO L439 ceAbstractionStarter]: At program point L39-2(line 39) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:53,489 INFO L443 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2019-10-14 23:52:53,489 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,490 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:52:53,490 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,490 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,490 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,490 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:52:53 BoogieIcfgContainer [2019-10-14 23:52:53,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:52:53,506 INFO L168 Benchmark]: Toolchain (without parser) took 2576.65 ms. Allocated memory was 145.8 MB in the beginning and 235.4 MB in the end (delta: 89.7 MB). Free memory was 102.2 MB in the beginning and 179.3 MB in the end (delta: -77.1 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,507 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.77 ms. Allocated memory is still 145.8 MB. Free memory was 102.0 MB in the beginning and 91.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,509 INFO L168 Benchmark]: Boogie Preprocessor took 124.88 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 91.7 MB in the beginning and 181.0 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,510 INFO L168 Benchmark]: RCFGBuilder took 314.37 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 165.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,511 INFO L168 Benchmark]: TraceAbstraction took 1869.07 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 164.3 MB in the beginning and 179.3 MB in the end (delta: -15.0 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,515 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 263.77 ms. Allocated memory is still 145.8 MB. Free memory was 102.0 MB in the beginning and 91.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.88 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 91.7 MB in the beginning and 181.0 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 314.37 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 165.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1869.07 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 164.3 MB in the beginning and 179.3 MB in the end (delta: -15.0 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 37]: Loop Invariant Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 112 SDtfs, 63 SDslu, 168 SDs, 0 SdLazy, 58 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 17 PreInvPairs, 17 NumberOfFragments, 76 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 3645 SizeOfPredicates, 1 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 110, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9523809523809523, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9047619047619048, AVG_WEAKENED_CONJUNCTS: 0.7619047619047619, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...