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/rewnifrev.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:53:59,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:53:59,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:53:59,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:53:59,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:53:59,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:53:59,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:53:59,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:53:59,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:53:59,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:53:59,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:53:59,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:53:59,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:53:59,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:53:59,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:53:59,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:53:59,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:53:59,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:53:59,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:53:59,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:53:59,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:53:59,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:53:59,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:53:59,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:53:59,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:53:59,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:53:59,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:53:59,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:53:59,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:53:59,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:53:59,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:53:59,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:53:59,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:53:59,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:53:59,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:53:59,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:53:59,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:53:59,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:53:59,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:53:59,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:53:59,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:53:59,299 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-13 19:53:59,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:53:59,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:53:59,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:53:59,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:53:59,333 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:53:59,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:53:59,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:53:59,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:53:59,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:53:59,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:53:59,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:53:59,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:53:59,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:53:59,338 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:53:59,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:53:59,339 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:53:59,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:53:59,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:53:59,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:53:59,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:53:59,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:53:59,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:53:59,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:53:59,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:53:59,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:53:59,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:53:59,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:53:59,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:53:59,341 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-13 19:53:59,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:53:59,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:53:59,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:53:59,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:53:59,666 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:53:59,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnifrev.c [2019-10-13 19:53:59,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e56c1220/94c92311ece143b282e40bab95c3f629/FLAG9794b755c [2019-10-13 19:54:00,200 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:54:00,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnifrev.c [2019-10-13 19:54:00,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e56c1220/94c92311ece143b282e40bab95c3f629/FLAG9794b755c [2019-10-13 19:54:00,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e56c1220/94c92311ece143b282e40bab95c3f629 [2019-10-13 19:54:00,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:54:00,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:54:00,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:54:00,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:54:00,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:54:00,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:54:00" (1/1) ... [2019-10-13 19:54:00,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e550fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00, skipping insertion in model container [2019-10-13 19:54:00,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:54:00" (1/1) ... [2019-10-13 19:54:00,594 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:54:00,614 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:54:00,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:54:00,807 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:54:00,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:54:00,843 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:54:00,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00 WrapperNode [2019-10-13 19:54:00,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:54:00,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:54:00,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:54:00,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:54:00,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00" (1/1) ... [2019-10-13 19:54:00,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00" (1/1) ... [2019-10-13 19:54:00,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00" (1/1) ... [2019-10-13 19:54:00,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00" (1/1) ... [2019-10-13 19:54:00,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00" (1/1) ... [2019-10-13 19:54:00,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00" (1/1) ... [2019-10-13 19:54:00,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00" (1/1) ... [2019-10-13 19:54:00,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:54:00,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:54:00,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:54:00,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:54:00,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00" (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-13 19:54:01,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:54:01,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:54:01,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 19:54:01,029 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:54:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:54:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:54:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 19:54:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:54:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 19:54:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:54:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 19:54:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 19:54:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 19:54:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:54:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:54:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:54:01,271 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:54:01,271 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 19:54:01,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:54:01 BoogieIcfgContainer [2019-10-13 19:54:01,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:54:01,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:54:01,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:54:01,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:54:01,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:54:00" (1/3) ... [2019-10-13 19:54:01,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229bd9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:54:01, skipping insertion in model container [2019-10-13 19:54:01,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:54:00" (2/3) ... [2019-10-13 19:54:01,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229bd9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:54:01, skipping insertion in model container [2019-10-13 19:54:01,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:54:01" (3/3) ... [2019-10-13 19:54:01,282 INFO L109 eAbstractionObserver]: Analyzing ICFG rewnifrev.c [2019-10-13 19:54:01,294 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:54:01,303 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:54:01,321 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:54:01,353 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:54:01,353 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:54:01,353 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:54:01,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:54:01,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:54:01,354 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:54:01,354 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:54:01,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:54:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-13 19:54:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 19:54:01,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:54:01,386 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:54:01,388 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:54:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:54:01,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-10-13 19:54:01,405 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 19:54:01,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035592263] [2019-10-13 19:54:01,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:01,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:01,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:54:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:54:01,553 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-13 19:54:01,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035592263] [2019-10-13 19:54:01,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:54:01,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 19:54:01,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473210711] [2019-10-13 19:54:01,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 19:54:01,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 19:54:01,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 19:54:01,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 19:54:01,577 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-13 19:54:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:54:01,598 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-13 19:54:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 19:54:01,599 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-13 19:54:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:54:01,605 INFO L225 Difference]: With dead ends: 43 [2019-10-13 19:54:01,606 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 19:54:01,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 19:54:01,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 19:54:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 19:54:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 19:54:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-13 19:54:01,644 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-13 19:54:01,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:54:01,645 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-13 19:54:01,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 19:54:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-13 19:54:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 19:54:01,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:54:01,646 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:54:01,647 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:54:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:54:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-10-13 19:54:01,648 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 19:54:01,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304060948] [2019-10-13 19:54:01,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:01,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:01,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:54:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:54:01,714 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-13 19:54:01,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304060948] [2019-10-13 19:54:01,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:54:01,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:54:01,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644309220] [2019-10-13 19:54:01,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:54:01,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 19:54:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:54:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:54:01,719 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-10-13 19:54:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:54:01,767 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-13 19:54:01,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:54:01,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 19:54:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:54:01,768 INFO L225 Difference]: With dead ends: 41 [2019-10-13 19:54:01,769 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 19:54:01,770 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-13 19:54:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 19:54:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-13 19:54:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 19:54:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 19:54:01,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-13 19:54:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:54:01,777 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 19:54:01,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:54:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 19:54:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:54:01,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:54:01,778 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:54:01,779 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:54:01,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:54:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-10-13 19:54:01,780 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 19:54:01,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996930017] [2019-10-13 19:54:01,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:01,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:01,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:54:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:54:01,862 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-13 19:54:01,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996930017] [2019-10-13 19:54:01,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:54:01,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:54:01,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231678116] [2019-10-13 19:54:01,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:54:01,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 19:54:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:54:01,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:54:01,868 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-10-13 19:54:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:54:01,927 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-13 19:54:01,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:54:01,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-13 19:54:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:54:01,931 INFO L225 Difference]: With dead ends: 42 [2019-10-13 19:54:01,931 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 19:54:01,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:54:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 19:54:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-10-13 19:54:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 19:54:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-13 19:54:01,943 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-13 19:54:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:54:01,944 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-13 19:54:01,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:54:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-13 19:54:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:54:01,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:54:01,945 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:54:01,946 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:54:01,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:54:01,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-10-13 19:54:01,947 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 19:54:01,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530796139] [2019-10-13 19:54:01,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:01,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:01,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:54:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:54:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:54:02,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530796139] [2019-10-13 19:54:02,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:54:02,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:54:02,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914046817] [2019-10-13 19:54:02,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:54:02,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 19:54:02,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:54:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:54:02,290 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 10 states. [2019-10-13 19:54:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:54:02,497 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-13 19:54:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:54:02,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-10-13 19:54:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:54:02,499 INFO L225 Difference]: With dead ends: 39 [2019-10-13 19:54:02,499 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 19:54:02,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:54:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 19:54:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-10-13 19:54:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 19:54:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-13 19:54:02,508 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-10-13 19:54:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:54:02,508 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-13 19:54:02,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:54:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-13 19:54:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:54:02,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:54:02,510 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:54:02,510 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:54:02,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:54:02,511 INFO L82 PathProgramCache]: Analyzing trace with hash -730987952, now seen corresponding path program 1 times [2019-10-13 19:54:02,511 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 19:54:02,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322294712] [2019-10-13 19:54:02,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:02,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:54:02,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:54:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:54:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:54:02,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322294712] [2019-10-13 19:54:02,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450626226] [2019-10-13 19:54:02,793 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-13 19:54:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:54:02,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-13 19:54:02,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:54:02,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-10-13 19:54:02,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:54:02,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-10-13 19:54:02,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:54:03,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:54:03,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:54:03,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2019-10-13 19:54:03,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:54:03,167 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-13 19:54:03,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-10-13 19:54:03,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:54:03,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:54:03,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:54:03,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-10-13 19:54:03,458 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-10-13 19:54:03,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2019-10-13 19:54:03,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:54:03,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:54:03,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 19:54:03,486 INFO L567 ElimStorePlain]: treesize reduction 31, result has 18.4 percent of original size [2019-10-13 19:54:03,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:54:03,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-10-13 19:54:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:54:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:54:03,583 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 19:54:03,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:54:03,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-10-13 19:54:03,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2019-10-13 19:54:03,891 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:54:03,910 INFO L567 ElimStorePlain]: treesize reduction 43, result has 30.6 percent of original size [2019-10-13 19:54:03,910 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:54:03,923 INFO L567 ElimStorePlain]: treesize reduction 9, result has 66.7 percent of original size [2019-10-13 19:54:03,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:54:03,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2019-10-13 19:54:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:54:03,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1178737155] [2019-10-13 19:54:03,942 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-10-13 19:54:03,982 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 19:54:03,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 19:54:04,056 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 19:54:04,058 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 25 variables. [2019-10-13 19:54:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:54:04,062 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 19:54:04,110 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-13 19:54:04,110 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 19:54:04,127 INFO L553 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2019-10-13 19:54:04,128 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 19:54:04,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 19:54:04,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12, 15, 12] total 32 [2019-10-13 19:54:04,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754601773] [2019-10-13 19:54:04,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:54:04,134 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 19:54:04,134 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 19:54:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:54:04,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:54:04,136 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 4 states. [2019-10-13 19:54:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:54:04,146 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-13 19:54:04,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:54:04,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-13 19:54:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:54:04,147 INFO L225 Difference]: With dead ends: 33 [2019-10-13 19:54:04,147 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:54:04,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:54:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:54:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:54:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:54:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:54:04,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-10-13 19:54:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:54:04,152 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:54:04,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:54:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:54:04,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:54:04,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:54:04,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:54:04,454 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:54:04,454 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:54:04,454 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:54:04,454 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:54:04,455 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) [2019-10-13 19:54:04,455 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:54:04,455 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:54:04,455 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 34) no Hoare annotation was computed. [2019-10-13 19:54:04,455 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 24) no Hoare annotation was computed. [2019-10-13 19:54:04,455 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 21 24) no Hoare annotation was computed. [2019-10-13 19:54:04,456 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2019-10-13 19:54:04,456 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 26) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-13 19:54:04,456 INFO L443 ceAbstractionStarter]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2019-10-13 19:54:04,456 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 34) no Hoare annotation was computed. [2019-10-13 19:54:04,456 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-13 19:54:04,456 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 11 34) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648))) (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647))) [2019-10-13 19:54:04,457 INFO L443 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-10-13 19:54:04,457 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 28 31) no Hoare annotation was computed. [2019-10-13 19:54:04,457 INFO L439 ceAbstractionStarter]: At program point L28-3(lines 28 31) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-13 19:54:04,457 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 32) no Hoare annotation was computed. [2019-10-13 19:54:04,457 INFO L443 ceAbstractionStarter]: For program point L14-1(lines 14 32) no Hoare annotation was computed. [2019-10-13 19:54:04,457 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-13 19:54:04,457 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-13 19:54:04,458 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-13 19:54:04,458 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-13 19:54:04,458 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-13 19:54:04,458 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-13 19:54:04,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:54:04 BoogieIcfgContainer [2019-10-13 19:54:04,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:54:04,473 INFO L168 Benchmark]: Toolchain (without parser) took 3895.93 ms. Allocated memory was 145.2 MB in the beginning and 247.5 MB in the end (delta: 102.2 MB). Free memory was 103.2 MB in the beginning and 175.2 MB in the end (delta: -72.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-10-13 19:54:04,474 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:54:04,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.03 ms. Allocated memory is still 145.2 MB. Free memory was 103.0 MB in the beginning and 93.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:54:04,476 INFO L168 Benchmark]: Boogie Preprocessor took 120.04 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 93.1 MB in the beginning and 181.2 MB in the end (delta: -88.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-10-13 19:54:04,476 INFO L168 Benchmark]: RCFGBuilder took 308.27 ms. Allocated memory is still 202.9 MB. Free memory was 181.2 MB in the beginning and 166.2 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:54:04,478 INFO L168 Benchmark]: TraceAbstraction took 3196.82 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 166.2 MB in the beginning and 175.2 MB in the end (delta: -9.0 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2019-10-13 19:54:04,482 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.25 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.03 ms. Allocated memory is still 145.2 MB. Free memory was 103.0 MB in the beginning and 93.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.04 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 93.1 MB in the beginning and 181.2 MB in the end (delta: -88.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 308.27 ms. Allocated memory is still 202.9 MB. Free memory was 181.2 MB in the beginning and 166.2 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3196.82 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 166.2 MB in the beginning and 175.2 MB in the end (delta: -9.0 MB). Peak memory consumption was 35.6 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: 28]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 92 SDtfs, 47 SDslu, 93 SDs, 0 SdLazy, 118 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s 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, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 12 PreInvPairs, 12 NumberOfFragments, 84 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 151 ConstructedInterpolants, 7 QuantifiedInterpolants, 26311 SizeOfPredicates, 13 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 23/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 121, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9741379310344828, AVG_VARS_REMOVED_DURING_WEAKENING: 0.7241379310344828, AVG_WEAKENED_CONJUNCTS: 0.7586206896551724, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...