java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:09:35,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:09:35,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:09:35,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:09:35,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:09:35,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:09:35,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:09:35,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:09:35,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:09:35,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:09:35,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:09:35,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:09:35,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:09:35,228 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:09:35,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:09:35,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:09:35,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:09:35,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:09:35,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:09:35,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:09:35,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:09:35,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:09:35,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:09:35,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:09:35,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:09:35,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:09:35,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:09:35,244 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:09:35,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:09:35,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:09:35,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:09:35,245 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:09:35,254 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:09:35,254 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:09:35,255 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:09:35,255 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:09:35,255 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:09:35,255 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:09:35,255 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:09:35,256 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:09:35,256 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:09:35,256 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:09:35,256 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:09:35,257 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:09:35,257 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:09:35,257 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:09:35,257 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:09:35,257 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:09:35,257 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:09:35,257 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:09:35,257 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:09:35,258 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:09:35,258 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:09:35,258 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:09:35,258 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:09:35,258 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:09:35,258 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:09:35,259 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:09:35,259 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:09:35,259 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:09:35,259 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:09:35,259 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:09:35,259 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:09:35,260 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:09:35,260 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:09:35,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:09:35,260 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:09:35,260 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:09:35,261 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:09:35,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:09:35,303 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:09:35,307 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:09:35,308 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:09:35,308 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:09:35,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i [2018-01-20 22:09:35,477 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:09:35,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:09:35,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:09:35,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:09:35,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:09:35,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:09:35" (1/1) ... [2018-01-20 22:09:35,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4454cf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35, skipping insertion in model container [2018-01-20 22:09:35,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:09:35" (1/1) ... [2018-01-20 22:09:35,505 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:09:35,543 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:09:35,661 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:09:35,684 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:09:35,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35 WrapperNode [2018-01-20 22:09:35,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:09:35,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:09:35,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:09:35,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:09:35,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35" (1/1) ... [2018-01-20 22:09:35,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35" (1/1) ... [2018-01-20 22:09:35,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35" (1/1) ... [2018-01-20 22:09:35,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35" (1/1) ... [2018-01-20 22:09:35,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35" (1/1) ... [2018-01-20 22:09:35,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35" (1/1) ... [2018-01-20 22:09:35,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35" (1/1) ... [2018-01-20 22:09:35,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:09:35,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:09:35,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:09:35,731 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:09:35,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35" (1/1) ... No working directory specified, using /storage/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 [2018-01-20 22:09:35,777 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:09:35,777 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:09:35,778 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-20 22:09:35,778 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:09:35,778 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:09:35,778 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:09:35,778 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:09:35,778 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:09:35,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:09:35,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:09:35,779 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:09:35,779 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:09:35,779 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:09:35,779 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:09:35,780 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:09:35,780 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-20 22:09:35,780 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:09:35,780 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:09:35,780 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:09:35,985 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:09:35,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:09:35 BoogieIcfgContainer [2018-01-20 22:09:35,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:09:35,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:09:35,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:09:35,990 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:09:35,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:09:35" (1/3) ... [2018-01-20 22:09:35,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610602ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:09:35, skipping insertion in model container [2018-01-20 22:09:35,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:35" (2/3) ... [2018-01-20 22:09:35,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610602ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:09:35, skipping insertion in model container [2018-01-20 22:09:35,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:09:35" (3/3) ... [2018-01-20 22:09:35,993 INFO L105 eAbstractionObserver]: Analyzing ICFG simple-ext_1_true-valid-memsafety.i [2018-01-20 22:09:35,999 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:09:36,005 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 22:09:36,053 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:09:36,053 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:09:36,054 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:09:36,054 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:09:36,054 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:09:36,054 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:09:36,054 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:09:36,054 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-20 22:09:36,055 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:09:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-20 22:09:36,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:09:36,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 49 states. [2018-01-20 22:09:36,166 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 526) no Hoare annotation was computed. [2018-01-20 22:09:36,166 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 620 622) no Hoare annotation was computed. [2018-01-20 22:09:36,166 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 620 622) the Hoare annotation is: true [2018-01-20 22:09:36,166 INFO L401 ceAbstractionStarter]: For program point L621(line 621) no Hoare annotation was computed. [2018-01-20 22:09:36,167 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 620 622) no Hoare annotation was computed. [2018-01-20 22:09:36,167 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 659) no Hoare annotation was computed. [2018-01-20 22:09:36,167 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 659) no Hoare annotation was computed. [2018-01-20 22:09:36,167 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 659) the Hoare annotation is: true [2018-01-20 22:09:36,167 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 659) no Hoare annotation was computed. [2018-01-20 22:09:36,167 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 659) the Hoare annotation is: true [2018-01-20 22:09:36,168 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 659) no Hoare annotation was computed. [2018-01-20 22:09:36,168 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 659) the Hoare annotation is: true [2018-01-20 22:09:36,168 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 659) no Hoare annotation was computed. [2018-01-20 22:09:36,168 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 659) no Hoare annotation was computed. [2018-01-20 22:09:36,168 INFO L401 ceAbstractionStarter]: For program point L645'''(lines 645 651) no Hoare annotation was computed. [2018-01-20 22:09:36,168 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-20 22:09:36,169 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-20 22:09:36,169 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-20 22:09:36,169 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 627 659) no Hoare annotation was computed. [2018-01-20 22:09:36,169 INFO L401 ceAbstractionStarter]: For program point L655(line 655) no Hoare annotation was computed. [2018-01-20 22:09:36,169 INFO L401 ceAbstractionStarter]: For program point L654(line 654) no Hoare annotation was computed. [2018-01-20 22:09:36,169 INFO L404 ceAbstractionStarter]: At program point L653''(lines 653 657) the Hoare annotation is: true [2018-01-20 22:09:36,169 INFO L401 ceAbstractionStarter]: For program point L653(lines 653 657) no Hoare annotation was computed. [2018-01-20 22:09:36,170 INFO L401 ceAbstractionStarter]: For program point L629'''(line 629) no Hoare annotation was computed. [2018-01-20 22:09:36,170 INFO L401 ceAbstractionStarter]: For program point L646'''(lines 646 648) no Hoare annotation was computed. [2018-01-20 22:09:36,170 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 627 659) no Hoare annotation was computed. [2018-01-20 22:09:36,170 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 627 659) the Hoare annotation is: true [2018-01-20 22:09:36,170 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 640) the Hoare annotation is: true [2018-01-20 22:09:36,170 INFO L404 ceAbstractionStarter]: At program point L636'(line 636) the Hoare annotation is: true [2018-01-20 22:09:36,171 INFO L401 ceAbstractionStarter]: For program point L636'''(line 636) no Hoare annotation was computed. [2018-01-20 22:09:36,171 INFO L401 ceAbstractionStarter]: For program point L653'''(lines 653 657) no Hoare annotation was computed. [2018-01-20 22:09:36,171 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-20 22:09:36,171 INFO L401 ceAbstractionStarter]: For program point L645(lines 645 651) no Hoare annotation was computed. [2018-01-20 22:09:36,171 INFO L404 ceAbstractionStarter]: At program point L645''(lines 645 651) the Hoare annotation is: true [2018-01-20 22:09:36,171 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-20 22:09:36,171 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-20 22:09:36,172 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-20 22:09:36,172 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-20 22:09:36,172 INFO L401 ceAbstractionStarter]: For program point L633''''''(lines 633 640) no Hoare annotation was computed. [2018-01-20 22:09:36,172 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-20 22:09:36,172 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-20 22:09:36,172 INFO L404 ceAbstractionStarter]: At program point L629'(line 629) the Hoare annotation is: true [2018-01-20 22:09:36,172 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 627 659) no Hoare annotation was computed. [2018-01-20 22:09:36,173 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-20 22:09:36,173 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 640) no Hoare annotation was computed. [2018-01-20 22:09:36,173 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-20 22:09:36,173 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-20 22:09:36,173 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-20 22:09:36,173 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-20 22:09:36,173 INFO L401 ceAbstractionStarter]: For program point L646'(line 646) no Hoare annotation was computed. [2018-01-20 22:09:36,174 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-20 22:09:36,174 INFO L401 ceAbstractionStarter]: For program point L654'(line 654) no Hoare annotation was computed. [2018-01-20 22:09:36,178 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:09:36,178 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:09:36,178 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:09:36,178 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:09:36,178 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:09:36,178 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:09:36,179 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:09:36,179 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:09:36,179 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:09:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-20 22:09:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:09:36,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:36,183 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:09:36,183 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:09:36,186 INFO L82 PathProgramCache]: Analyzing trace with hash 135692, now seen corresponding path program 1 times [2018-01-20 22:09:36,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:36,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:36,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:36,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:09:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:09:36,252 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:09:36,256 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:09:36,301 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:09:36,302 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:09:36,302 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:09:36,302 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:09:36,302 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:09:36,302 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:09:36,302 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:09:36,303 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:09:36,303 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:09:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-20 22:09:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 22:09:36,307 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:36,307 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:36,307 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:09:36,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1622057019, now seen corresponding path program 1 times [2018-01-20 22:09:36,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:36,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:36,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,310 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:36,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:36,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:09:36,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:36,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:09:36,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:09:36,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:09:36,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:09:36,446 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-20 22:09:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:36,464 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-01-20 22:09:36,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:09:36,466 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 22:09:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:36,473 INFO L225 Difference]: With dead ends: 73 [2018-01-20 22:09:36,473 INFO L226 Difference]: Without dead ends: 41 [2018-01-20 22:09:36,475 INFO L525 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 [2018-01-20 22:09:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-20 22:09:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-20 22:09:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 22:09:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-20 22:09:36,504 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-01-20 22:09:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:36,504 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-20 22:09:36,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:09:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-20 22:09:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 22:09:36,506 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:36,506 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:36,506 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:09:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1506847670, now seen corresponding path program 1 times [2018-01-20 22:09:36,507 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:36,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:36,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:36,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:36,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:09:36,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:36,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:09:36,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:09:36,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:09:36,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:09:36,616 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2018-01-20 22:09:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:36,750 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-01-20 22:09:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:09:36,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-20 22:09:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:36,752 INFO L225 Difference]: With dead ends: 79 [2018-01-20 22:09:36,752 INFO L226 Difference]: Without dead ends: 67 [2018-01-20 22:09:36,753 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:09:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-20 22:09:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2018-01-20 22:09:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-20 22:09:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-01-20 22:09:36,761 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 25 [2018-01-20 22:09:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:36,762 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-01-20 22:09:36,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:09:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-01-20 22:09:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 22:09:36,763 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:36,763 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:36,763 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:09:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1533825156, now seen corresponding path program 1 times [2018-01-20 22:09:36,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:36,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:36,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:36,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:09:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:09:36,825 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:09:36,832 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:09:36,836 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:09:36,837 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:09:36,847 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:09:36,847 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:09:36,848 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:09:36,848 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:09:36,848 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:09:36,848 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:09:36,848 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:09:36,848 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:09:36,848 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:09:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-20 22:09:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 22:09:36,850 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:36,850 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:36,850 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:36,850 INFO L82 PathProgramCache]: Analyzing trace with hash 220682052, now seen corresponding path program 1 times [2018-01-20 22:09:36,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:36,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:36,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:36,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:36,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:09:36,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:36,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:09:36,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:09:36,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:09:36,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:09:36,870 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-20 22:09:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:36,873 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-01-20 22:09:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:09:36,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 22:09:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:36,874 INFO L225 Difference]: With dead ends: 73 [2018-01-20 22:09:36,874 INFO L226 Difference]: Without dead ends: 39 [2018-01-20 22:09:36,874 INFO L525 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 [2018-01-20 22:09:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-20 22:09:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-20 22:09:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-20 22:09:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-20 22:09:36,878 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-01-20 22:09:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:36,878 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-20 22:09:36,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:09:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-20 22:09:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 22:09:36,879 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:36,879 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:36,879 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1544798995, now seen corresponding path program 1 times [2018-01-20 22:09:36,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:36,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:36,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:36,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:36,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:09:36,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:36,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:09:36,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:09:36,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:09:36,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:09:36,933 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-20 22:09:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:37,042 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-01-20 22:09:37,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:09:37,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-20 22:09:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:37,044 INFO L225 Difference]: With dead ends: 75 [2018-01-20 22:09:37,044 INFO L226 Difference]: Without dead ends: 65 [2018-01-20 22:09:37,044 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:09:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-20 22:09:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2018-01-20 22:09:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 22:09:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-20 22:09:37,051 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 23 [2018-01-20 22:09:37,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:37,051 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-20 22:09:37,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:09:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-20 22:09:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-20 22:09:37,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:37,052 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:37,052 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:37,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1056343501, now seen corresponding path program 1 times [2018-01-20 22:09:37,053 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:37,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:37,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:37,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:37,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:37,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:09:37,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:09:37,230 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:09:37,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:37,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:09:37,409 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~7.base Int)) (and (= (select |c_old(#valid)| main_~p~7.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~p~7.base 0)) (not (= 0 main_~p~7.base)))) is different from true [2018-01-20 22:09:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-20 22:09:37,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:09:37,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-20 22:09:37,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 22:09:37,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 22:09:37,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2018-01-20 22:09:37,462 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 11 states. [2018-01-20 22:09:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:37,871 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-20 22:09:37,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 22:09:37,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-01-20 22:09:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:37,872 INFO L225 Difference]: With dead ends: 79 [2018-01-20 22:09:37,873 INFO L226 Difference]: Without dead ends: 76 [2018-01-20 22:09:37,873 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2018-01-20 22:09:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-20 22:09:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-01-20 22:09:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-20 22:09:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-20 22:09:37,882 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 35 [2018-01-20 22:09:37,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:37,882 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-20 22:09:37,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 22:09:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-20 22:09:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-20 22:09:37,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:37,884 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:37,885 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:37,886 INFO L82 PathProgramCache]: Analyzing trace with hash -466630891, now seen corresponding path program 2 times [2018-01-20 22:09:37,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:37,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:37,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:37,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:37,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:37,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:09:38,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:09:38,152 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:09:38,173 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:09:38,189 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:09:38,207 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:09:38,220 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:09:38,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:09:38,311 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:09:38,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-20 22:09:38,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:38,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:38,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:38,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-20 22:09:38,341 INFO L477 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 17 treesize of output 13 [2018-01-20 22:09:38,344 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:09:38,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-20 22:09:38,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:38,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:38,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:38,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-01-20 22:09:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:09:38,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:09:38,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-01-20 22:09:38,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-20 22:09:38,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-20 22:09:38,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-01-20 22:09:38,403 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 15 states. [2018-01-20 22:09:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:38,817 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-01-20 22:09:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 22:09:38,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-20 22:09:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:38,818 INFO L225 Difference]: With dead ends: 98 [2018-01-20 22:09:38,818 INFO L226 Difference]: Without dead ends: 62 [2018-01-20 22:09:38,819 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2018-01-20 22:09:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-20 22:09:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2018-01-20 22:09:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-20 22:09:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-20 22:09:38,825 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2018-01-20 22:09:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:38,826 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-20 22:09:38,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-20 22:09:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-20 22:09:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 22:09:38,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:38,827 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:38,827 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:38,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1523339684, now seen corresponding path program 1 times [2018-01-20 22:09:38,828 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:38,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:38,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:38,829 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:09:38,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:38,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:09:39,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:09:39,221 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:09:39,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:39,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:09:39,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-20 22:09:39,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:09:39,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:39,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:39,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:09:39,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-20 22:09:39,370 INFO L477 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:09:39,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:09:39,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-20 22:09:39,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:39,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-01-20 22:09:39,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:09:39,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-01-20 22:09:39,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-20 22:09:39,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-01-20 22:09:39,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:09:39,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-01-20 22:09:39,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-01-20 22:09:39,548 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-20 22:09:39,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:39,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-01-20 22:09:39,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:09:39,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:09:39,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:09:39,564 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2018-01-20 22:09:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:09:39,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:09:39,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2018-01-20 22:09:39,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-20 22:09:39,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-20 22:09:39,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-01-20 22:09:39,649 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 27 states. [2018-01-20 22:09:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:40,726 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-01-20 22:09:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-20 22:09:40,726 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 46 [2018-01-20 22:09:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:40,728 INFO L225 Difference]: With dead ends: 134 [2018-01-20 22:09:40,728 INFO L226 Difference]: Without dead ends: 122 [2018-01-20 22:09:40,729 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=373, Invalid=1883, Unknown=0, NotChecked=0, Total=2256 [2018-01-20 22:09:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-20 22:09:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2018-01-20 22:09:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-20 22:09:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-20 22:09:40,737 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 46 [2018-01-20 22:09:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:40,737 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-20 22:09:40,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-20 22:09:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-20 22:09:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-20 22:09:40,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:40,738 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:40,739 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1277921645, now seen corresponding path program 2 times [2018-01-20 22:09:40,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:40,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:40,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:40,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:40,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:40,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:09:41,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:09:41,171 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:09:41,176 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:09:41,188 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:09:41,200 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:09:41,203 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:09:41,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:09:41,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-20 22:09:41,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:09:41,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:41,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:41,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:09:41,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-20 22:09:41,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:09:41,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:09:41,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:46 [2018-01-20 22:09:41,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:41,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-01-20 22:09:41,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:09:41,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-01-20 22:09:41,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:41,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:41,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:41,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:09:41,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2018-01-20 22:09:41,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:41,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-01-20 22:09:41,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:09:41,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:51 [2018-01-20 22:09:41,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:41,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:41,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-01-20 22:09:41,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:09:41,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:09:41,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:65 [2018-01-20 22:09:41,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 67 [2018-01-20 22:09:41,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2018-01-20 22:09:41,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:09:41,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:71 [2018-01-20 22:09:41,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2018-01-20 22:09:41,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-01-20 22:09:41,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-20 22:09:41,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,884 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-20 22:09:41,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:41,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:4 [2018-01-20 22:09:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:09:41,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:09:41,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 33 [2018-01-20 22:09:41,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-20 22:09:41,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-20 22:09:41,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2018-01-20 22:09:41,950 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 33 states. [2018-01-20 22:09:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:43,689 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2018-01-20 22:09:43,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-20 22:09:43,689 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 57 [2018-01-20 22:09:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:43,690 INFO L225 Difference]: With dead ends: 169 [2018-01-20 22:09:43,690 INFO L226 Difference]: Without dead ends: 157 [2018-01-20 22:09:43,691 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=644, Invalid=3646, Unknown=0, NotChecked=0, Total=4290 [2018-01-20 22:09:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-20 22:09:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 88. [2018-01-20 22:09:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-20 22:09:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-20 22:09:43,705 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 57 [2018-01-20 22:09:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:43,706 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-20 22:09:43,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-20 22:09:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-20 22:09:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 22:09:43,708 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:43,708 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:43,708 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:43,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1740585822, now seen corresponding path program 3 times [2018-01-20 22:09:43,709 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:43,709 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:43,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:43,710 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:09:43,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:43,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:09:44,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:09:44,602 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:09:44,607 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:09:44,619 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:09:44,627 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:09:44,636 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:09:44,639 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:09:44,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:09:44,770 INFO L477 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:09:44,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-01-20 22:09:44,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:44,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:44,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:44,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-01-20 22:09:44,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:44,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-01-20 22:09:44,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:09:44,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:44,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:44,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:44,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:47 [2018-01-20 22:09:44,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:44,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2018-01-20 22:09:44,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 15 [2018-01-20 22:09:44,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:44,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:44,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:09:44,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:53 [2018-01-20 22:09:45,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:45,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-20 22:09:45,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2018-01-20 22:09:45,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:45,097 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-20 22:09:45,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:45,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:45,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:45,107 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:30 [2018-01-20 22:09:45,177 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~7.base 1))) (and (= (select |c_old(#valid)| main_~p~7.base) 0) (= 0 (select .cse0 c_main_~t~7.base)) (= |c_#valid| (store (store .cse0 c_main_~t~7.base 1) main_~p~7.base 0)) (not (= 0 main_~p~7.base))))) is different from true [2018-01-20 22:09:45,180 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_2 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_2 1))) (and (not (= 0 v_subst_2)) (= (store (store .cse0 c_main_~p~7.base 1) v_subst_2 0) |c_#valid|) (= 0 (select .cse0 c_main_~p~7.base)) (= (select |c_old(#valid)| v_subst_2) 0)))) is different from true [2018-01-20 22:09:45,184 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_subst_2 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_2 1))) (and (not (= 0 v_subst_2)) (= (store (store .cse1 c_main_~p~7.base 1) v_subst_2 0) |c_#valid|) (= 0 (select .cse1 c_main_~p~7.base)) (= (select |c_old(#valid)| v_subst_2) 0)))))) (or (and (not (= c_main_~p~7.offset 0)) .cse0) (and (not (= 0 c_main_~p~7.base)) .cse0))) is different from true [2018-01-20 22:09:45,289 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 Int) (main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_5 1))) (and (= 0 (select .cse0 main_~p~7.base)) (not (= 0 v_prenex_5)) (= (select |c_old(#valid)| v_prenex_5) 0) (= |c_#valid| (store (store (store .cse0 main_~p~7.base 1) v_prenex_5 0) main_~p~7.base 0)) (not (= 0 main_~p~7.base))))) is different from true [2018-01-20 22:09:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 8 not checked. [2018-01-20 22:09:45,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:09:45,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-20 22:09:45,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-20 22:09:45,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-20 22:09:45,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1019, Unknown=22, NotChecked=268, Total=1406 [2018-01-20 22:09:45,331 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 38 states. [2018-01-20 22:09:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:47,148 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-20 22:09:47,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-20 22:09:47,149 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 58 [2018-01-20 22:09:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:47,150 INFO L225 Difference]: With dead ends: 104 [2018-01-20 22:09:47,150 INFO L226 Difference]: Without dead ends: 101 [2018-01-20 22:09:47,151 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=291, Invalid=2670, Unknown=25, NotChecked=436, Total=3422 [2018-01-20 22:09:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-20 22:09:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-01-20 22:09:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-20 22:09:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-01-20 22:09:47,161 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 58 [2018-01-20 22:09:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:47,161 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-01-20 22:09:47,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-20 22:09:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-01-20 22:09:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-20 22:09:47,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:47,163 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:47,163 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1556062687, now seen corresponding path program 4 times [2018-01-20 22:09:47,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:47,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:47,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:47,164 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:09:47,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:47,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:09:47,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:09:47,867 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:09:47,873 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:09:47,894 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:09:47,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:09:48,035 INFO L477 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 27 treesize of output 25 [2018-01-20 22:09:48,038 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-20 22:09:48,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:48,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:48,056 INFO L477 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 18 treesize of output 14 [2018-01-20 22:09:48,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2018-01-20 22:09:48,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:09:48,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:09:48,075 INFO L477 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 27 treesize of output 23 [2018-01-20 22:09:48,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2018-01-20 22:09:48,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:09:48,085 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:09:48,093 INFO L477 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 14 treesize of output 12 [2018-01-20 22:09:48,095 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-20 22:09:48,095 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:48,096 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:48,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:09:48,099 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:55, output treesize:15 [2018-01-20 22:09:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-20 22:09:48,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:09:48,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 33 [2018-01-20 22:09:48,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-20 22:09:48,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-20 22:09:48,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-20 22:09:48,223 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 33 states. [2018-01-20 22:09:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:50,906 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2018-01-20 22:09:50,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-20 22:09:50,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2018-01-20 22:09:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:50,907 INFO L225 Difference]: With dead ends: 195 [2018-01-20 22:09:50,907 INFO L226 Difference]: Without dead ends: 183 [2018-01-20 22:09:50,909 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1076, Invalid=5244, Unknown=0, NotChecked=0, Total=6320 [2018-01-20 22:09:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-20 22:09:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 114. [2018-01-20 22:09:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-20 22:09:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-01-20 22:09:50,925 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 63 [2018-01-20 22:09:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:50,925 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-01-20 22:09:50,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-20 22:09:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-01-20 22:09:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-20 22:09:50,926 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:50,926 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:50,926 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash 356797414, now seen corresponding path program 5 times [2018-01-20 22:09:50,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:50,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:50,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:50,927 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:09:50,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:50,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:09:51,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:09:51,645 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:09:51,651 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 22:09:51,661 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:09:51,664 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:09:51,670 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:09:51,680 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:09:51,682 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:09:51,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:09:51,849 INFO L477 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 31 treesize of output 27 [2018-01-20 22:09:51,850 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-01-20 22:09:51,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:51,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:51,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:09:51,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:25 [2018-01-20 22:09:52,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-01-20 22:09:52,005 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-01-20 22:09:52,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:52,012 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-20 22:09:52,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:52,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:52,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:52,017 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:27, output treesize:3 [2018-01-20 22:09:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:09:52,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:09:52,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17] total 40 [2018-01-20 22:09:52,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-20 22:09:52,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-20 22:09:52,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2018-01-20 22:09:52,127 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 40 states. [2018-01-20 22:09:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:54,552 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2018-01-20 22:09:54,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-20 22:09:54,553 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 64 [2018-01-20 22:09:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:54,554 INFO L225 Difference]: With dead ends: 208 [2018-01-20 22:09:54,554 INFO L226 Difference]: Without dead ends: 178 [2018-01-20 22:09:54,556 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=673, Invalid=6637, Unknown=0, NotChecked=0, Total=7310 [2018-01-20 22:09:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-20 22:09:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 149. [2018-01-20 22:09:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-20 22:09:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2018-01-20 22:09:54,575 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 64 [2018-01-20 22:09:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:54,575 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2018-01-20 22:09:54,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-20 22:09:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2018-01-20 22:09:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-20 22:09:54,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:54,576 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:54,576 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1770948968, now seen corresponding path program 6 times [2018-01-20 22:09:54,576 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:54,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:54,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:54,577 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:09:54,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:54,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 22:09:55,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:09:55,055 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:09:55,065 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 22:09:55,079 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:09:55,084 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:09:55,092 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:09:55,102 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:09:55,105 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:09:55,110 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:09:55,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-20 22:09:55,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:09:55,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:55,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:55,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:09:55,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-20 22:09:55,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:09:55,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:09:55,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:09:55,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-01-20 22:09:55,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,193 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-01-20 22:09:55,211 INFO L477 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 15 treesize of output 11 [2018-01-20 22:09:55,214 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-20 22:09:55,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-01-20 22:09:55,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:55,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-01-20 22:09:55,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:09:55,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-01-20 22:09:55,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-20 22:09:55,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-01-20 22:09:55,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2018-01-20 22:09:55,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-01-20 22:09:55,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-01-20 22:09:55,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:55,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:09:55,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:09:55,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:09:55,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:09:55,471 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-01-20 22:09:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-20 22:09:55,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:09:55,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 29 [2018-01-20 22:09:55,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-20 22:09:55,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-20 22:09:55,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-01-20 22:09:55,607 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand 29 states. [2018-01-20 22:09:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:56,455 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-01-20 22:09:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-20 22:09:56,455 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70 [2018-01-20 22:09:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:56,456 INFO L225 Difference]: With dead ends: 166 [2018-01-20 22:09:56,456 INFO L226 Difference]: Without dead ends: 119 [2018-01-20 22:09:56,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2018-01-20 22:09:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-20 22:09:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-20 22:09:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-20 22:09:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-20 22:09:56,473 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 70 [2018-01-20 22:09:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:56,473 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-20 22:09:56,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-20 22:09:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-20 22:09:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-20 22:09:56,474 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:56,474 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:56,474 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:56,474 INFO L82 PathProgramCache]: Analyzing trace with hash -9630951, now seen corresponding path program 7 times [2018-01-20 22:09:56,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:56,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:56,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:56,475 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:09:56,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:56,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-20 22:09:57,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:09:57,311 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:09:57,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:57,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:09:57,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2018-01-20 22:09:57,821 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:09:57,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 46 [2018-01-20 22:09:57,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:09:57,847 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:09:57,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-01-20 22:09:57,848 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:57,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-01-20 22:09:57,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:09:57,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:09:57,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2018-01-20 22:09:57,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:57,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-01-20 22:09:57,912 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:57,921 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:57,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-01-20 22:09:57,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2018-01-20 22:09:57,936 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-20 22:09:57,951 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-01-20 22:09:57,952 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:57,962 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-20 22:09:57,962 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:57,969 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:09:57,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-01-20 22:09:57,973 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-20 22:09:57,973 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:57,977 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-20 22:09:57,977 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:57,979 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:58,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2018-01-20 22:09:58,004 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-01-20 22:09:58,004 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:58,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:09:58,019 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:09:58,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-01-20 22:09:58,022 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:58,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-01-20 22:09:58,033 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:58,042 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:09:58,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-01-20 22:09:58,066 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-20 22:09:58,066 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:58,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-01-20 22:09:58,069 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:58,070 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:58,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2018-01-20 22:09:58,077 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-01-20 22:09:58,077 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-20 22:09:58,086 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:09:58,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:09:58,094 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:105, output treesize:9 [2018-01-20 22:09:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-20 22:09:58,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:09:58,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18] total 44 [2018-01-20 22:09:58,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-20 22:09:58,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-20 22:09:58,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1759, Unknown=2, NotChecked=0, Total=1892 [2018-01-20 22:09:58,223 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 44 states. [2018-01-20 22:10:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:02,994 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2018-01-20 22:10:02,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-20 22:10:02,994 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 75 [2018-01-20 22:10:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:02,995 INFO L225 Difference]: With dead ends: 187 [2018-01-20 22:10:02,995 INFO L226 Difference]: Without dead ends: 184 [2018-01-20 22:10:02,998 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1467, Invalid=10735, Unknown=8, NotChecked=0, Total=12210 [2018-01-20 22:10:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-20 22:10:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 125. [2018-01-20 22:10:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-20 22:10:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-01-20 22:10:03,012 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 75 [2018-01-20 22:10:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:03,012 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-01-20 22:10:03,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-20 22:10:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-01-20 22:10:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-20 22:10:03,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:03,013 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:03,013 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash -728751170, now seen corresponding path program 8 times [2018-01-20 22:10:03,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:03,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:03,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:03,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:03,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:03,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-20 22:10:04,439 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:04,439 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:10:04,444 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:10:04,457 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:04,472 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:04,480 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:10:04,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:04,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-20 22:10:04,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:10:04,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:04,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:04,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:10:04,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-20 22:10:04,629 INFO L477 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:10:04,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-01-20 22:10:04,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,644 INFO L477 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:10:04,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:10:04,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-01-20 22:10:04,699 INFO L477 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 19 treesize of output 15 [2018-01-20 22:10:04,701 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-20 22:10:04,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-01-20 22:10:04,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:04,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-01-20 22:10:04,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:10:04,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-01-20 22:10:04,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:04,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:04,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:04,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-01-20 22:10:04,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:64 [2018-01-20 22:10:04,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:04,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:04,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 66 [2018-01-20 22:10:04,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-20 22:10:04,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:04,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:79 [2018-01-20 22:10:05,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 111 [2018-01-20 22:10:05,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:10:05,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:96 [2018-01-20 22:10:05,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-01-20 22:10:05,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:93 [2018-01-20 22:10:05,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 107 [2018-01-20 22:10:05,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:10:05,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:111 [2018-01-20 22:10:05,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 148 [2018-01-20 22:10:05,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:10:05,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:10:05,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:162, output treesize:131 [2018-01-20 22:10:05,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 124 [2018-01-20 22:10:05,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 25 [2018-01-20 22:10:05,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:10:05,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:173, output treesize:153 [2018-01-20 22:10:06,192 INFO L477 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 7 treesize of output 5 [2018-01-20 22:10:06,194 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:10:06,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:10:06,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:144, output treesize:137 [2018-01-20 22:10:06,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:06,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:06,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 90 [2018-01-20 22:10:06,462 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 57 [2018-01-20 22:10:06,466 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-01-20 22:10:06,492 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-20 22:10:06,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-20 22:10:06,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-20 22:10:06,524 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-01-20 22:10:06,544 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-20 22:10:06,545 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:06,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:06,554 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:143, output treesize:11 [2018-01-20 22:10:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:10:06,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:10:06,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32] total 56 [2018-01-20 22:10:06,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-20 22:10:06,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-20 22:10:06,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2908, Unknown=0, NotChecked=0, Total=3080 [2018-01-20 22:10:06,762 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 56 states. [2018-01-20 22:10:08,105 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 126 DAG size of output 78 [2018-01-20 22:10:09,095 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 107 DAG size of output 85 [2018-01-20 22:10:09,293 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 126 DAG size of output 99 [2018-01-20 22:10:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:13,817 INFO L93 Difference]: Finished difference Result 278 states and 293 transitions. [2018-01-20 22:10:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-20 22:10:13,818 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 80 [2018-01-20 22:10:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:13,819 INFO L225 Difference]: With dead ends: 278 [2018-01-20 22:10:13,819 INFO L226 Difference]: Without dead ends: 260 [2018-01-20 22:10:13,823 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3854 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1314, Invalid=13206, Unknown=0, NotChecked=0, Total=14520 [2018-01-20 22:10:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-01-20 22:10:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 147. [2018-01-20 22:10:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-20 22:10:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2018-01-20 22:10:13,841 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 80 [2018-01-20 22:10:13,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:13,842 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2018-01-20 22:10:13,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-20 22:10:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2018-01-20 22:10:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-20 22:10:13,842 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:13,842 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:13,843 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1162355553, now seen corresponding path program 9 times [2018-01-20 22:10:13,843 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:13,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:13,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:13,843 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:10:13,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:13,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:10:16,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:16,343 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:10:16,348 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:10:16,360 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:10:16,366 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:10:16,378 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:10:16,395 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:10:16,398 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:10:16,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:16,576 INFO L477 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:10:16,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-01-20 22:10:16,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,593 INFO L477 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:10:16,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-01-20 22:10:16,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:53 [2018-01-20 22:10:16,666 INFO L477 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 19 treesize of output 15 [2018-01-20 22:10:16,668 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-20 22:10:16,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:50 [2018-01-20 22:10:16,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:16,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-01-20 22:10:16,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:10:16,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:50 [2018-01-20 22:10:16,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:16,932 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:16,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 84 [2018-01-20 22:10:16,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 18 [2018-01-20 22:10:16,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,969 INFO L477 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 0 case distinctions, treesize of input 13 treesize of output 16 [2018-01-20 22:10:16,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 15 [2018-01-20 22:10:16,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:16,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:97 [2018-01-20 22:10:17,066 INFO L477 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 27 treesize of output 11 [2018-01-20 22:10:17,067 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-20 22:10:17,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:17,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:17,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:17,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:117, output treesize:94 [2018-01-20 22:10:17,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:17,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:17,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:17,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:17,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 118 [2018-01-20 22:10:17,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-01-20 22:10:17,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:17,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:17,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:17,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:109, output treesize:94 [2018-01-20 22:10:17,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:17,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:17,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:17,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:17,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 122 [2018-01-20 22:10:17,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2018-01-20 22:10:17,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:17,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:17,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:17,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:109, output treesize:95 [2018-01-20 22:10:18,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 114 [2018-01-20 22:10:18,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,062 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 75 [2018-01-20 22:10:18,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-01-20 22:10:18,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2018-01-20 22:10:18,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:18,139 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2018-01-20 22:10:18,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:18,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2018-01-20 22:10:18,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:18,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2018-01-20 22:10:18,151 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:18,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-20 22:10:18,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:18,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 104 [2018-01-20 22:10:18,315 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-01-20 22:10:18,316 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:18,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2018-01-20 22:10:18,338 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:18,357 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2018-01-20 22:10:18,357 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:18,358 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2018-01-20 22:10:18,358 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:18,376 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:18,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-01-20 22:10:18,475 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:215, output treesize:303 [2018-01-20 22:10:18,716 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= 0 c_main_~p~7.base)) (exists ((v_prenex_27 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse1 (store .cse0 c_main_~p~7.base 1))) (and (= (select .cse0 c_main_~p~7.base) 0) (= (store (store .cse1 c_main_~t~7.base 1) v_prenex_27 0) |c_#valid|) (= 0 (select .cse1 c_main_~t~7.base)) (= (select |c_old(#valid)| v_prenex_27) 0) (not (= 0 v_prenex_27))))))) (and (exists ((v_prenex_35 Int) (v_arrayElimCell_89 Int)) (let ((.cse3 (store |c_old(#valid)| v_prenex_35 1))) (let ((.cse2 (store .cse3 c_main_~p~7.base 1))) (and (not (= 0 v_prenex_35)) (= (select |c_old(#valid)| v_prenex_35) 0) (= (store (store .cse2 v_arrayElimCell_89 1) v_prenex_35 0) |c_#valid|) (= 0 (select .cse3 c_main_~p~7.base)) (= (select .cse2 v_arrayElimCell_89) 0))))) (not (= c_main_~p~7.offset 0)))) is different from true [2018-01-20 22:10:18,719 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_27 Int) (main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse1 (store .cse0 main_~p~7.base 1))) (and (= (select .cse0 main_~p~7.base) 0) (= 0 (select .cse1 c_main_~t~7.base)) (= (select |c_old(#valid)| v_prenex_27) 0) (= |c_#valid| (store (store (store .cse1 c_main_~t~7.base 1) v_prenex_27 0) main_~p~7.base 0)) (not (= 0 main_~p~7.base)) (not (= 0 v_prenex_27)))))) is different from true [2018-01-20 22:10:18,722 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_27 Int) (v_subst_9 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse1 (store .cse0 v_subst_9 1))) (and (not (= 0 v_subst_9)) (= (select |c_old(#valid)| v_prenex_27) 0) (= (select .cse0 v_subst_9) 0) (= (select .cse1 c_main_~p~7.base) 0) (not (= 0 v_prenex_27)) (= |c_#valid| (store (store (store .cse1 c_main_~p~7.base 1) v_prenex_27 0) v_subst_9 0)))))) is different from true [2018-01-20 22:10:18,742 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_prenex_27 Int) (v_subst_9 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse2 (store .cse1 v_subst_9 1))) (and (not (= 0 v_subst_9)) (= (select |c_old(#valid)| v_prenex_27) 0) (= (select .cse1 v_subst_9) 0) (= (select .cse2 c_main_~p~7.base) 0) (not (= 0 v_prenex_27)) (= |c_#valid| (store (store (store .cse2 c_main_~p~7.base 1) v_prenex_27 0) v_subst_9 0)))))))) (or (and (not (= c_main_~p~7.offset 0)) .cse0) (and .cse0 (not (= 0 c_main_~p~7.base))))) is different from true [2018-01-20 22:10:18,755 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= 0 c_main_~p~7.base)) (exists ((v_prenex_37 Int) (v_prenex_36 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_36 1))) (let ((.cse0 (store .cse1 v_prenex_37 1))) (and (not (= 0 v_prenex_37)) (= (select .cse0 c_main_~p~7.base) 0) (= (select .cse1 v_prenex_37) 0) (= |c_#valid| (store (store (store .cse0 c_main_~p~7.base 1) v_prenex_36 0) v_prenex_37 0)) (not (= 0 v_prenex_36)) (= (select |c_old(#valid)| v_prenex_36) 0)))))) (and (not (= c_main_~p~7.offset 0)) (exists ((v_prenex_27 Int) (v_subst_9 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse3 (store .cse2 v_subst_9 1))) (and (not (= 0 v_subst_9)) (= (select |c_old(#valid)| v_prenex_27) 0) (= (select .cse2 v_subst_9) 0) (= (select .cse3 c_main_~p~7.base) 0) (not (= 0 v_prenex_27)) (= |c_#valid| (store (store (store .cse3 c_main_~p~7.base 1) v_prenex_27 0) v_subst_9 0)))))))) is different from true [2018-01-20 22:10:18,761 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_37 Int) (v_prenex_36 Int) (main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_36 1))) (let ((.cse0 (store .cse1 v_prenex_37 1))) (and (not (= 0 v_prenex_37)) (= (store (store (store (store .cse0 main_~p~7.base 1) v_prenex_36 0) v_prenex_37 0) main_~p~7.base 0) |c_#valid|) (= (select .cse0 main_~p~7.base) 0) (= (select .cse1 v_prenex_37) 0) (not (= 0 v_prenex_36)) (not (= 0 main_~p~7.base)) (= (select |c_old(#valid)| v_prenex_36) 0))))) is different from true [2018-01-20 22:10:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 20 not checked. [2018-01-20 22:10:18,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:10:18,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 59 [2018-01-20 22:10:18,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-20 22:10:18,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-20 22:10:18,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2708, Unknown=14, NotChecked=654, Total=3540 [2018-01-20 22:10:18,824 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 60 states. [2018-01-20 22:10:21,812 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 118 DAG size of output 95 [2018-01-20 22:10:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:23,189 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2018-01-20 22:10:23,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-20 22:10:23,190 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 81 [2018-01-20 22:10:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:23,190 INFO L225 Difference]: With dead ends: 197 [2018-01-20 22:10:23,190 INFO L226 Difference]: Without dead ends: 194 [2018-01-20 22:10:23,192 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=425, Invalid=6389, Unknown=16, NotChecked=1002, Total=7832 [2018-01-20 22:10:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-20 22:10:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2018-01-20 22:10:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-20 22:10:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2018-01-20 22:10:23,215 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 81 [2018-01-20 22:10:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:23,215 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2018-01-20 22:10:23,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-20 22:10:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2018-01-20 22:10:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-20 22:10:23,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:23,216 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:23,216 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:23,216 INFO L82 PathProgramCache]: Analyzing trace with hash -248388183, now seen corresponding path program 10 times [2018-01-20 22:10:23,216 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:23,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:23,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:23,217 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:10:23,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:23,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:24,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:24,508 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:10:24,513 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:10:24,539 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:10:24,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:25,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2018-01-20 22:10:25,159 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-20 22:10:25,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,171 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:25,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 30 [2018-01-20 22:10:25,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,192 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-01-20 22:10:25,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:25,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-20 22:10:25,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:117 [2018-01-20 22:10:25,647 WARN L143 SmtUtils]: Spent 349ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-20 22:10:25,863 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-20 22:10:26,054 INFO L477 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2018-01-20 22:10:26,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-20 22:10:26,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-20 22:10:26,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-01-20 22:10:26,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,135 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:26,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-20 22:10:26,136 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,150 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-01-20 22:10:26,150 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 9 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 47 [2018-01-20 22:10:26,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-20 22:10:26,183 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 18 [2018-01-20 22:10:26,207 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:26,221 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-01-20 22:10:26,221 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-20 22:10:26,232 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-01-20 22:10:26,255 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,258 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,261 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:82, output treesize:3 [2018-01-20 22:10:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 57 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-20 22:10:26,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:10:26,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 25] total 61 [2018-01-20 22:10:26,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-01-20 22:10:26,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-01-20 22:10:26,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3454, Unknown=0, NotChecked=0, Total=3660 [2018-01-20 22:10:26,399 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand 61 states. Received shutdown request... [2018-01-20 22:10:29,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-20 22:10:29,322 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:10:29,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:10:29 BoogieIcfgContainer [2018-01-20 22:10:29,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:10:29,324 INFO L168 Benchmark]: Toolchain (without parser) took 53846.44 ms. Allocated memory was 293.6 MB in the beginning and 792.7 MB in the end (delta: 499.1 MB). Free memory was 252.5 MB in the beginning and 415.4 MB in the end (delta: -162.8 MB). Peak memory consumption was 336.3 MB. Max. memory is 5.3 GB. [2018-01-20 22:10:29,325 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 293.6 MB. Free memory is still 258.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:10:29,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.21 ms. Allocated memory is still 293.6 MB. Free memory was 252.5 MB in the beginning and 240.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:10:29,325 INFO L168 Benchmark]: Boogie Preprocessor took 38.08 ms. Allocated memory is still 293.6 MB. Free memory is still 240.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:10:29,325 INFO L168 Benchmark]: RCFGBuilder took 256.32 ms. Allocated memory is still 293.6 MB. Free memory was 240.6 MB in the beginning and 219.6 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-20 22:10:29,326 INFO L168 Benchmark]: TraceAbstraction took 53336.08 ms. Allocated memory was 293.6 MB in the beginning and 792.7 MB in the end (delta: 499.1 MB). Free memory was 219.6 MB in the beginning and 415.4 MB in the end (delta: -195.7 MB). Peak memory consumption was 303.4 MB. Max. memory is 5.3 GB. [2018-01-20 22:10:29,327 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 293.6 MB. Free memory is still 258.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.21 ms. Allocated memory is still 293.6 MB. Free memory was 252.5 MB in the beginning and 240.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.08 ms. Allocated memory is still 293.6 MB. Free memory is still 240.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 256.32 ms. Allocated memory is still 293.6 MB. Free memory was 240.6 MB in the beginning and 219.6 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53336.08 ms. Allocated memory was 293.6 MB in the beginning and 792.7 MB in the end (delta: 499.1 MB). Free memory was 219.6 MB in the beginning and 415.4 MB in the end (delta: -195.7 MB). Peak memory consumption was 303.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 526]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: exitErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 10 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L628] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={13:0}] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={13:0}, malloc(sizeof(struct node))={13:0}] [L629] COND FALSE !(a == 0) VAL [a={13:0}, malloc(sizeof(struct node))={13:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L633] i < 30 && __VERIFIER_nondet_int() [L633] i < 30 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={13:0}, i=0, i < 30 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] FCALL p->h = i VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L642] FCALL p->n = 0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L643] p = a [L644] i = 0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L645] COND TRUE p!=0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L646] EXPR, FCALL p->h VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=0] [L646] COND FALSE !(p->h != i) [L649] EXPR, FCALL p->n VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}] [L649] p = p->n [L650] i++ VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}] [L645] COND FALSE !(p!=0) VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}] [L652] p = a VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}] [L653] COND TRUE p != 0 VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}] [L654] EXPR, FCALL p->n VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}] [L654] t = p->n [L655] FCALL free(p) VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}, t={0:0}] [L656] p = t VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}, t={0:0}] [L653] COND FALSE !(p != 0) VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}, t={0:0}] [L658] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 134 SDslu, 38 SDs, 0 SdLazy, 34 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 22 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (177states) and interpolant automaton (currently 29 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 136. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. TIMEOUT Result, 52.4s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 30.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 506 SDtfs, 4517 SDslu, 8837 SDs, 0 SdLazy, 13903 SolverSat, 1434 SolverUnsat, 51 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1465 GetRequests, 596 SyntacticMatches, 53 SemanticMatches, 815 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 15469 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 451 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 1555 NumberOfCodeBlocks, 1543 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1529 ConstructedInterpolants, 140 QuantifiedInterpolants, 2722474 SizeOfPredicates, 244 NumberOfNonLiveVariables, 2444 ConjunctsInSsa, 636 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 270/928 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-10-29-334.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-10-29-334.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-10-29-334.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-10-29-334.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-10-29-334.csv Completed graceful shutdown