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/nr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:52:49,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:52:49,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:52:49,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:52:49,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:52:49,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:52:49,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:52:49,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:52:49,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:52:49,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:52:49,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:52:49,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:52:49,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:52:49,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:52:49,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:52:49,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:52:49,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:52:49,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:52:49,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:52:49,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:52:49,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:52:49,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:52:49,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:52:49,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:52:49,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:52:49,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:52:49,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:52:49,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:52:49,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:52:49,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:52:49,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:52:49,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:52:49,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:52:49,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:52:49,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:52:49,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:52:49,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:52:49,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:52:49,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:52:49,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:52:49,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:52:49,368 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,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:52:49,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:52:49,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:52:49,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:52:49,405 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:52:49,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:52:49,406 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:52:49,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:52:49,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:52:49,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:52:49,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:52:49,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:52:49,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:52:49,409 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:52:49,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:52:49,410 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:52:49,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:52:49,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:52:49,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:52:49,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:52:49,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:52:49,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:52:49,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:52:49,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:52:49,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:52:49,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:52:49,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:52:49,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:52:49,413 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:49,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:52:49,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:52:49,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:52:49,757 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:52:49,757 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:52:49,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr2.c [2019-10-14 23:52:49,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44381d10/f422266f5c174722b9b036d7778e700b/FLAGb2f7c012a [2019-10-14 23:52:50,278 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:52:50,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr2.c [2019-10-14 23:52:50,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44381d10/f422266f5c174722b9b036d7778e700b/FLAGb2f7c012a [2019-10-14 23:52:50,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44381d10/f422266f5c174722b9b036d7778e700b [2019-10-14 23:52:50,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:52:50,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:52:50,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:50,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:52:50,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:52:50,700 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,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580da5e8 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,703 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,710 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:52:50,728 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:52:50,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:50,953 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:52:50,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:51,003 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:52:51,003 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,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:51,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:52:51,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:52:51,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:52:51,099 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,099 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,107 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,108 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,115 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,121 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,122 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,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:52:51,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:52:51,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:52:51,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:52:51,126 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,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:52:51,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:52:51,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:52:51,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:52:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:52:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:52:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:52:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 23:52:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:52:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:52:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:52:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:52:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:52:51,465 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:52:51,466 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:52:51,467 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,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:52:51,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:52:51,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:52:51,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:52:51,472 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,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c020d0 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,473 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,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c020d0 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,474 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,475 INFO L109 eAbstractionObserver]: Analyzing ICFG nr2.c [2019-10-14 23:52:51,486 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:52:51,497 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:52:51,513 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:52:51,558 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:52:51,559 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:52:51,559 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:52:51,559 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:52:51,559 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:52:51,559 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:52:51,559 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:52:51,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:52:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 23:52:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:52:51,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:51,599 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,601 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:51,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-10-14 23:52:51,618 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:51,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463416464] [2019-10-14 23:52:51,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:51,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:51,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:51,843 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:51,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463416464] [2019-10-14 23:52:51,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:51,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:52:51,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690739959] [2019-10-14 23:52:51,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:52:51,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:51,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:52:51,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:52:51,868 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2019-10-14 23:52:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:51,964 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-14 23:52:51,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:52:51,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 23:52:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:51,976 INFO L225 Difference]: With dead ends: 60 [2019-10-14 23:52:51,977 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 23:52:51,981 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,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 23:52:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 23:52:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 23:52:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-14 23:52:52,022 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-10-14 23:52:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,023 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-14 23:52:52,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:52:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-14 23:52:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:52:52,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,025 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,025 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-10-14 23:52:52,026 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299774541] [2019-10-14 23:52:52,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,111 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,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299774541] [2019-10-14 23:52:52,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:52,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:52:52,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959189347] [2019-10-14 23:52:52,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:52,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:52,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:52,116 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-10-14 23:52:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:52,192 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-14 23:52:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:52,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-14 23:52:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:52,197 INFO L225 Difference]: With dead ends: 52 [2019-10-14 23:52:52,198 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 23:52:52,199 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-14 23:52:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 23:52:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-14 23:52:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 23:52:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-14 23:52:52,219 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-10-14 23:52:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,220 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-14 23:52:52,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-14 23:52:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:52:52,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,223 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,223 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-10-14 23:52:52,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042311643] [2019-10-14 23:52:52,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,294 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,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042311643] [2019-10-14 23:52:52,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:52,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:52:52,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438830911] [2019-10-14 23:52:52,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:52:52,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:52,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:52:52,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:52,298 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2019-10-14 23:52:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:52,339 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-14 23:52:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:52,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:52:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:52,341 INFO L225 Difference]: With dead ends: 56 [2019-10-14 23:52:52,342 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 23:52:52,343 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,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 23:52:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-14 23:52:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 23:52:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-14 23:52:52,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-14 23:52:52,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,355 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-14 23:52:52,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:52:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-14 23:52:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:52:52,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,356 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,356 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-10-14 23:52:52,357 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145649816] [2019-10-14 23:52:52,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,411 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,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145649816] [2019-10-14 23:52:52,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:52,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:52:52,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509186424] [2019-10-14 23:52:52,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:52,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:52,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:52,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:52,416 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2019-10-14 23:52:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:52,475 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-10-14 23:52:52,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:52,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-14 23:52:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:52,477 INFO L225 Difference]: With dead ends: 57 [2019-10-14 23:52:52,477 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 23:52:52,478 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,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 23:52:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-14 23:52:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:52:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-14 23:52:52,486 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-10-14 23:52:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,486 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-14 23:52:52,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-14 23:52:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:52:52,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:52,488 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,488 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-10-14 23:52:52,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:52,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552422884] [2019-10-14 23:52:52,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:52,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,542 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,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552422884] [2019-10-14 23:52:52,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091837743] [2019-10-14 23:52:52,543 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,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:52,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:52:52,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:52,659 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,659 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:52,698 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,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1988649231] [2019-10-14 23:52:52,707 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-10-14 23:52:52,756 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:52:52,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:52:52,848 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:52:52,852 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 23 root evaluator evaluations with a maximum evaluation depth of 2. Performed 23 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Never found a fixpoint. Largest state had 26 variables. [2019-10-14 23:52:52,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:52,856 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:52:52,898 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 96.67% of their original sizes. [2019-10-14 23:52:52,898 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:52:52,905 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-10-14 23:52:52,905 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:52:52,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:52:52,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4] total 5 [2019-10-14 23:52:52,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185671747] [2019-10-14 23:52:52,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:52:52,907 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:52,908 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:52:52,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:52:52,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:52,908 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-10-14 23:52:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:52,912 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-10-14 23:52:52,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:52,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:52:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:52,913 INFO L225 Difference]: With dead ends: 33 [2019-10-14 23:52:52,913 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:52:52,913 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:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:52:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:52:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:52:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:52:52,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-14 23:52:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:52,918 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:52:52,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:52:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:52:52,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:52:53,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:53,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:52:53,178 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:53,179 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:53,179 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:53,179 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:53,179 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,179 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:53,179 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:53,180 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 34) no Hoare annotation was computed. [2019-10-14 23:52:53,180 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 44) no Hoare annotation was computed. [2019-10-14 23:52:53,180 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 23 36) no Hoare annotation was computed. [2019-10-14 23:52:53,180 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 36) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:53,180 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-14 23:52:53,180 INFO L443 ceAbstractionStarter]: For program point L23-4(lines 23 36) no Hoare annotation was computed. [2019-10-14 23:52:53,181 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 42) no Hoare annotation was computed. [2019-10-14 23:52:53,181 INFO L443 ceAbstractionStarter]: For program point L11-2(lines 11 42) no Hoare annotation was computed. [2019-10-14 23:52:53,181 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-14 23:52:53,181 INFO L439 ceAbstractionStarter]: At program point L40-2(line 40) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:53,181 INFO L443 ceAbstractionStarter]: For program point L40-3(line 40) no Hoare annotation was computed. [2019-10-14 23:52:53,181 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 35) no Hoare annotation was computed. [2019-10-14 23:52:53,182 INFO L439 ceAbstractionStarter]: At program point L25-3(lines 25 35) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:53,182 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 44) no Hoare annotation was computed. [2019-10-14 23:52:53,182 INFO L443 ceAbstractionStarter]: For program point L38-2(lines 38 41) no Hoare annotation was computed. [2019-10-14 23:52:53,182 INFO L439 ceAbstractionStarter]: At program point L38-3(lines 38 41) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:53,182 INFO L443 ceAbstractionStarter]: For program point L38-4(lines 38 41) no Hoare annotation was computed. [2019-10-14 23:52:53,182 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 8 44) 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,183 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,183 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:52:53,183 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,183 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,183 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,184 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:52:53,197 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,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:52:53,200 INFO L168 Benchmark]: Toolchain (without parser) took 2506.21 ms. Allocated memory was 139.5 MB in the beginning and 234.9 MB in the end (delta: 95.4 MB). Free memory was 103.2 MB in the beginning and 184.2 MB in the end (delta: -81.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,201 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.2 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,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.33 ms. Allocated memory is still 139.5 MB. Free memory was 103.0 MB in the beginning and 92.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,203 INFO L168 Benchmark]: Boogie Preprocessor took 120.35 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.7 MB in the beginning and 181.7 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,204 INFO L168 Benchmark]: RCFGBuilder took 342.72 ms. Allocated memory is still 203.9 MB. Free memory was 181.7 MB in the beginning and 165.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,205 INFO L168 Benchmark]: TraceAbstraction took 1729.54 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 165.2 MB in the beginning and 184.2 MB in the end (delta: -19.0 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:53,210 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 308.33 ms. Allocated memory is still 139.5 MB. Free memory was 103.0 MB in the beginning and 92.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 120.35 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.7 MB in the beginning and 181.7 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 342.72 ms. Allocated memory is still 203.9 MB. Free memory was 181.7 MB in the beginning and 165.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1729.54 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 165.2 MB in the beginning and 184.2 MB in the end (delta: -19.0 MB). Peak memory consumption was 11.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: 25]: Loop Invariant Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648) - InvariantResult [Line: 23]: 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.6s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 112 SDtfs, 63 SDslu, 168 SDs, 0 SdLazy, 57 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 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.3s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 3486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 90 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 149, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9444444444444445, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9523809523809523, 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...