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/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:27:26,987 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:27:26,989 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:27:27,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:27:27,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:27:27,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:27:27,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:27:27,008 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:27:27,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:27:27,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:27:27,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:27:27,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:27:27,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:27:27,016 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:27:27,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:27:27,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:27:27,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:27:27,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:27:27,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:27:27,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:27:27,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:27:27,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:27:27,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:27:27,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:27:27,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:27:27,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:27:27,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:27:27,034 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:27:27,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:27:27,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:27:27,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:27:27,036 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-23 14:27:27,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:27:27,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:27:27,046 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:27:27,046 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:27:27,046 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:27:27,046 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:27:27,046 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:27:27,047 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:27:27,047 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:27:27,047 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:27:27,047 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:27:27,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:27:27,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:27:27,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:27:27,048 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:27:27,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:27:27,048 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:27:27,048 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:27:27,048 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:27:27,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:27:27,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:27:27,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:27:27,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:27:27,049 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:27:27,050 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:27:27,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:27:27,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:27:27,050 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:27:27,050 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:27:27,050 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:27:27,051 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:27:27,051 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:27:27,051 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:27:27,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:27:27,051 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:27:27,052 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:27:27,052 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:27:27,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:27:27,098 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:27:27,102 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:27:27,103 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:27:27,104 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:27:27,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-01-23 14:27:27,282 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:27:27,287 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:27:27,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:27:27,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:27:27,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:27:27,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:27:27" (1/1) ... [2018-01-23 14:27:27,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a484b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27, skipping insertion in model container [2018-01-23 14:27:27,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:27:27" (1/1) ... [2018-01-23 14:27:27,310 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:27:27,347 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:27:27,467 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:27:27,485 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:27:27,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27 WrapperNode [2018-01-23 14:27:27,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:27:27,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:27:27,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:27:27,495 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:27:27,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27" (1/1) ... [2018-01-23 14:27:27,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27" (1/1) ... [2018-01-23 14:27:27,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27" (1/1) ... [2018-01-23 14:27:27,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27" (1/1) ... [2018-01-23 14:27:27,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27" (1/1) ... [2018-01-23 14:27:27,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27" (1/1) ... [2018-01-23 14:27:27,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27" (1/1) ... [2018-01-23 14:27:27,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:27:27,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:27:27,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:27:27,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:27:27,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27" (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-23 14:27:27,587 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:27:27,588 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:27:27,588 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:27:27,588 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:27:27,588 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:27:27,588 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:27:27,588 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:27:27,589 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:27:27,589 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:27:27,589 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:27:27,589 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:27:27,589 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:27:27,589 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-23 14:27:27,590 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:27:27,590 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:27:27,590 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:27:27,590 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:27:27,887 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:27:27,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:27:27 BoogieIcfgContainer [2018-01-23 14:27:27,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:27:27,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:27:27,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:27:27,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:27:27,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:27:27" (1/3) ... [2018-01-23 14:27:27,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14989172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:27:27, skipping insertion in model container [2018-01-23 14:27:27,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:27:27" (2/3) ... [2018-01-23 14:27:27,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14989172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:27:27, skipping insertion in model container [2018-01-23 14:27:27,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:27:27" (3/3) ... [2018-01-23 14:27:27,896 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-01-23 14:27:27,902 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:27:27,909 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:27:27,948 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:27:27,949 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:27:27,949 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:27:27,949 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:27:27,949 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:27:27,949 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:27:27,949 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:27:27,949 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:27:27,950 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:27:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-23 14:27:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:27:27,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:27,981 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:27:27,981 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:27:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 141778, now seen corresponding path program 1 times [2018-01-23 14:27:27,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:27,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:28,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:28,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:27:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:27:28,085 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:27:28,092 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:27:28,100 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:27:28,100 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:27:28,100 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:27:28,100 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:27:28,100 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:27:28,100 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:27:28,100 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:27:28,100 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:27:28,101 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:27:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-23 14:27:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-23 14:27:28,103 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:28,103 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:27:28,103 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:27:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1069227820, now seen corresponding path program 1 times [2018-01-23 14:27:28,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:28,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:28,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:28,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:28,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:28,153 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-23 14:27:28,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:27:28,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:27:28,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:27:28,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:27:28,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:27:28,170 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-01-23 14:27:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:28,194 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2018-01-23 14:27:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:27:28,285 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-23 14:27:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:28,299 INFO L225 Difference]: With dead ends: 109 [2018-01-23 14:27:28,299 INFO L226 Difference]: Without dead ends: 55 [2018-01-23 14:27:28,303 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-23 14:27:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-23 14:27:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-23 14:27:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-23 14:27:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-23 14:27:28,342 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2018-01-23 14:27:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:28,342 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-23 14:27:28,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:27:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-23 14:27:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-23 14:27:28,343 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:28,343 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:27:28,343 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:27:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 764024314, now seen corresponding path program 1 times [2018-01-23 14:27:28,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:28,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:28,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:28,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:27:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:27:28,377 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:27:28,381 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:27:28,383 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:27:28,383 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:27:28,391 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:27:28,391 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:27:28,391 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:27:28,391 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:27:28,392 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:27:28,392 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:27:28,392 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:27:28,392 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:27:28,392 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:27:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-23 14:27:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-23 14:27:28,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:28,395 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:27:28,395 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1951957839, now seen corresponding path program 1 times [2018-01-23 14:27:28,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:28,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:28,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:28,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:28,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:28,416 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-23 14:27:28,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:27:28,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:27:28,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:27:28,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:27:28,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:27:28,417 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-01-23 14:27:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:28,425 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2018-01-23 14:27:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:27:28,425 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-23 14:27:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:28,427 INFO L225 Difference]: With dead ends: 109 [2018-01-23 14:27:28,427 INFO L226 Difference]: Without dead ends: 53 [2018-01-23 14:27:28,428 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-23 14:27:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-23 14:27:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-23 14:27:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-23 14:27:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-23 14:27:28,434 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2018-01-23 14:27:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:28,435 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-23 14:27:28,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:27:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-23 14:27:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-23 14:27:28,436 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:28,436 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:27:28,436 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash -691941633, now seen corresponding path program 1 times [2018-01-23 14:27:28,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:28,437 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:28,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:28,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:28,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:28,485 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-23 14:27:28,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:27:28,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:27:28,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:27:28,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:27:28,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:27:28,487 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 3 states. [2018-01-23 14:27:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:28,556 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-01-23 14:27:28,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:27:28,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-23 14:27:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:28,558 INFO L225 Difference]: With dead ends: 72 [2018-01-23 14:27:28,559 INFO L226 Difference]: Without dead ends: 69 [2018-01-23 14:27:28,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:27:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-23 14:27:28,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-01-23 14:27:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-23 14:27:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-01-23 14:27:28,568 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 13 [2018-01-23 14:27:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:28,568 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-01-23 14:27:28,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:27:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-01-23 14:27:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:27:28,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:28,570 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:27:28,570 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:28,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1939646148, now seen corresponding path program 1 times [2018-01-23 14:27:28,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:28,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:28,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:28,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:28,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:28,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:27:28,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:27:28,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:27:28,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:27:28,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:27:28,628 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 3 states. [2018-01-23 14:27:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:28,651 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-01-23 14:27:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:27:28,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-23 14:27:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:28,653 INFO L225 Difference]: With dead ends: 131 [2018-01-23 14:27:28,653 INFO L226 Difference]: Without dead ends: 82 [2018-01-23 14:27:28,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:27:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-23 14:27:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-23 14:27:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-23 14:27:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-01-23 14:27:28,662 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 22 [2018-01-23 14:27:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:28,662 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-01-23 14:27:28,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:27:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-01-23 14:27:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-23 14:27:28,663 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:28,664 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] [2018-01-23 14:27:28,664 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1620764504, now seen corresponding path program 1 times [2018-01-23 14:27:28,664 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:28,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:28,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:28,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:28,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:28,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:27:28,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:27:28,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:27:28,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:27:28,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:27:28,757 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 5 states. [2018-01-23 14:27:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:28,885 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-01-23 14:27:28,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:27:28,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-23 14:27:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:28,887 INFO L225 Difference]: With dead ends: 133 [2018-01-23 14:27:28,887 INFO L226 Difference]: Without dead ends: 86 [2018-01-23 14:27:28,887 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-23 14:27:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-23 14:27:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-01-23 14:27:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-23 14:27:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-23 14:27:28,896 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 29 [2018-01-23 14:27:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:28,896 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-23 14:27:28,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:27:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-23 14:27:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-23 14:27:28,898 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:28,898 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:27:28,898 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1106845045, now seen corresponding path program 1 times [2018-01-23 14:27:28,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:28,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:28,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:28,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:28,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:29,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:27:29,136 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-23 14:27:29,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:29,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:27:29,446 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int)) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~x~10.base 0)) (not (= main_~x~10.base 0)))) is different from true [2018-01-23 14:27:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-23 14:27:29,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:27:29,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-23 14:27:29,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-23 14:27:29,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-23 14:27:29,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=109, Unknown=1, NotChecked=20, Total=156 [2018-01-23 14:27:29,483 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 13 states. [2018-01-23 14:27:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:30,122 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-01-23 14:27:30,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:27:30,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-01-23 14:27:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:30,127 INFO L225 Difference]: With dead ends: 120 [2018-01-23 14:27:30,127 INFO L226 Difference]: Without dead ends: 117 [2018-01-23 14:27:30,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=258, Unknown=1, NotChecked=34, Total=380 [2018-01-23 14:27:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-23 14:27:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2018-01-23 14:27:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-23 14:27:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-01-23 14:27:30,142 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 38 [2018-01-23 14:27:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:30,142 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-01-23 14:27:30,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-23 14:27:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-01-23 14:27:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-23 14:27:30,144 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:30,144 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-23 14:27:30,145 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash -159189785, now seen corresponding path program 1 times [2018-01-23 14:27:30,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:30,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:30,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:30,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:30,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:30,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:30,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:27:30,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-23 14:27:30,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:27:30,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:27:30,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:27:30,442 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 10 states. [2018-01-23 14:27:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:30,832 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2018-01-23 14:27:30,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-23 14:27:30,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-01-23 14:27:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:30,835 INFO L225 Difference]: With dead ends: 178 [2018-01-23 14:27:30,835 INFO L226 Difference]: Without dead ends: 160 [2018-01-23 14:27:30,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:27:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-23 14:27:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 100. [2018-01-23 14:27:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-23 14:27:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-23 14:27:30,847 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 43 [2018-01-23 14:27:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:30,848 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-23 14:27:30,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:27:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-23 14:27:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-23 14:27:30,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:30,849 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-23 14:27:30,849 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash -175714120, now seen corresponding path program 2 times [2018-01-23 14:27:30,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:30,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:30,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:30,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:30,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:30,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:31,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:27:31,290 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-23 14:27:31,304 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:27:31,317 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:27:31,342 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:27:31,355 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:27:31,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:27:31,403 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-23 14:27:31,405 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-23 14:27:31,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-23 14:27:31,426 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 28 treesize of output 23 [2018-01-23 14:27:31,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 27 [2018-01-23 14:27:31,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:22 [2018-01-23 14:27:31,466 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 30 treesize of output 23 [2018-01-23 14:27:31,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-23 14:27:31,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-23 14:27:31,505 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 39 treesize of output 30 [2018-01-23 14:27:31,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:31,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-23 14:27:31,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-23 14:27:31,554 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 44 treesize of output 33 [2018-01-23 14:27:31,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-01-23 14:27:31,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:31,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:29 [2018-01-23 14:27:31,645 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 38 treesize of output 28 [2018-01-23 14:27:31,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 41 [2018-01-23 14:27:31,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-23 14:27:31,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:27:31,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:27:31,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:55 [2018-01-23 14:27:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:31,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:27:31,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 17 [2018-01-23 14:27:31,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-23 14:27:31,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-23 14:27:31,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:27:31,767 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 17 states. [2018-01-23 14:27:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:32,485 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2018-01-23 14:27:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-23 14:27:32,486 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-01-23 14:27:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:32,487 INFO L225 Difference]: With dead ends: 161 [2018-01-23 14:27:32,487 INFO L226 Difference]: Without dead ends: 125 [2018-01-23 14:27:32,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2018-01-23 14:27:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-23 14:27:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2018-01-23 14:27:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-23 14:27:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-23 14:27:32,497 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 47 [2018-01-23 14:27:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:32,497 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-23 14:27:32,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-23 14:27:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-23 14:27:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-23 14:27:32,499 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:32,499 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:27:32,499 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:32,499 INFO L82 PathProgramCache]: Analyzing trace with hash 716995032, now seen corresponding path program 1 times [2018-01-23 14:27:32,500 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:32,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:32,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:32,501 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:27:32,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:32,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:32,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:27:32,673 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-23 14:27:32,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:32,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:27:32,731 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-23 14:27:32,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:32,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:32,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:27:32,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:32,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:32,788 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-23 14:27:32,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:32,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:32,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-23 14:27:32,848 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 11 treesize of output 8 [2018-01-23 14:27:32,858 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 8 treesize of output 7 [2018-01-23 14:27:32,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:32,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:32,862 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-23 14:27:32,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-23 14:27:32,914 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 16 treesize of output 12 [2018-01-23 14:27:32,919 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 12 treesize of output 13 [2018-01-23 14:27:32,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:27:32,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:27:32,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:27:32,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-01-23 14:27:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:32,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:27:32,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-23 14:27:32,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-23 14:27:32,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-23 14:27:32,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-01-23 14:27:32,985 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 21 states. [2018-01-23 14:27:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:33,609 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-01-23 14:27:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-23 14:27:33,610 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-01-23 14:27:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:33,611 INFO L225 Difference]: With dead ends: 225 [2018-01-23 14:27:33,611 INFO L226 Difference]: Without dead ends: 210 [2018-01-23 14:27:33,612 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-01-23 14:27:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-23 14:27:33,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 102. [2018-01-23 14:27:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-23 14:27:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-23 14:27:33,623 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 54 [2018-01-23 14:27:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:33,623 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-23 14:27:33,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-23 14:27:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-23 14:27:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-23 14:27:33,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:33,624 INFO L322 BasicCegarLoop]: trace histogram [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-23 14:27:33,625 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:33,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2069250024, now seen corresponding path program 1 times [2018-01-23 14:27:33,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:33,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:33,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:33,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:33,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:33,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:34,076 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 29 DAG size of output 15 [2018-01-23 14:27:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:34,176 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:27:34,176 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-23 14:27:34,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:34,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:27:34,230 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-23 14:27:34,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:27:34,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:34,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:34,273 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-23 14:27:34,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-23 14:27:34,349 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 11 treesize of output 8 [2018-01-23 14:27:34,351 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 8 treesize of output 7 [2018-01-23 14:27:34,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-23 14:27:34,383 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 36 treesize of output 32 [2018-01-23 14:27:34,385 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-23 14:27:34,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2018-01-23 14:27:34,432 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 37 treesize of output 30 [2018-01-23 14:27:34,439 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-23 14:27:34,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:27:34,448 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-23 14:27:34,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:34,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:27:34,462 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-23 14:27:34,462 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:11 [2018-01-23 14:27:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:34,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:27:34,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-01-23 14:27:34,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-23 14:27:34,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-23 14:27:34,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:27:34,552 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 20 states. [2018-01-23 14:27:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:35,625 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2018-01-23 14:27:35,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-23 14:27:35,625 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-01-23 14:27:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:35,626 INFO L225 Difference]: With dead ends: 173 [2018-01-23 14:27:35,627 INFO L226 Difference]: Without dead ends: 170 [2018-01-23 14:27:35,627 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2018-01-23 14:27:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-23 14:27:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 146. [2018-01-23 14:27:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-23 14:27:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-01-23 14:27:35,635 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 57 [2018-01-23 14:27:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:35,635 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-01-23 14:27:35,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-23 14:27:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-01-23 14:27:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-23 14:27:35,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:35,636 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:27:35,637 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1645798842, now seen corresponding path program 1 times [2018-01-23 14:27:35,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:35,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:35,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:35,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:35,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:35,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:36,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:27:36,244 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-23 14:27:36,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:36,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:27:36,459 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 11 treesize of output 8 [2018-01-23 14:27:36,463 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 8 treesize of output 7 [2018-01-23 14:27:36,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:36,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:36,473 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-23 14:27:36,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:43 [2018-01-23 14:27:36,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 33 [2018-01-23 14:27:36,582 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 33 treesize of output 30 [2018-01-23 14:27:36,584 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-23 14:27:36,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:27:36,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:27:36,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:67 [2018-01-23 14:27:37,165 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int) (v_prenex_8 Int)) (let ((.cse0 (store |c_old(#valid)| main_~x~10.base 1))) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= 0 (select .cse0 v_prenex_8)) (not (= main_~x~10.base 0)) (not (= v_prenex_8 0)) (= |c_#valid| (store (store .cse0 v_prenex_8 0) main_~x~10.base 0))))) is different from true [2018-01-23 14:27:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-23 14:27:37,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:27:37,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-01-23 14:27:37,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-23 14:27:37,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-23 14:27:37,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=642, Unknown=8, NotChecked=50, Total=756 [2018-01-23 14:27:37,205 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 28 states. [2018-01-23 14:27:38,377 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 100 DAG size of output 46 [2018-01-23 14:27:38,681 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 101 DAG size of output 38 [2018-01-23 14:27:38,845 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 99 DAG size of output 41 [2018-01-23 14:27:39,054 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 127 DAG size of output 44 [2018-01-23 14:27:39,232 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 112 DAG size of output 41 [2018-01-23 14:27:39,407 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 85 DAG size of output 63 [2018-01-23 14:27:39,619 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 93 DAG size of output 68 [2018-01-23 14:27:40,049 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 83 DAG size of output 75 [2018-01-23 14:27:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:40,322 INFO L93 Difference]: Finished difference Result 201 states and 214 transitions. [2018-01-23 14:27:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-23 14:27:40,323 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 59 [2018-01-23 14:27:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:40,324 INFO L225 Difference]: With dead ends: 201 [2018-01-23 14:27:40,324 INFO L226 Difference]: Without dead ends: 198 [2018-01-23 14:27:40,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=253, Invalid=1895, Unknown=18, NotChecked=90, Total=2256 [2018-01-23 14:27:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-23 14:27:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 179. [2018-01-23 14:27:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-23 14:27:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 191 transitions. [2018-01-23 14:27:40,341 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 191 transitions. Word has length 59 [2018-01-23 14:27:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:40,341 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 191 transitions. [2018-01-23 14:27:40,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-23 14:27:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 191 transitions. [2018-01-23 14:27:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-23 14:27:40,343 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:40,343 INFO L322 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:27:40,343 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2087622424, now seen corresponding path program 2 times [2018-01-23 14:27:40,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:40,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:40,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:40,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:27:40,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:40,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:40,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:27:40,885 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-23 14:27:40,891 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:27:40,900 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:27:40,911 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:27:40,914 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:27:40,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:27:40,923 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-23 14:27:40,924 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-23 14:27:40,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:40,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:40,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:40,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-23 14:27:40,933 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 26 treesize of output 21 [2018-01-23 14:27:40,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:40,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-01-23 14:27:40,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:40,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:40,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:40,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2018-01-23 14:27:40,966 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 36 treesize of output 29 [2018-01-23 14:27:40,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:40,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:40,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:40,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-23 14:27:40,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:40,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:40,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:40,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-01-23 14:27:41,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-23 14:27:41,057 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 33 treesize of output 32 [2018-01-23 14:27:41,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-23 14:27:41,141 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:27:41,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 52 [2018-01-23 14:27:41,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:41,173 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 4 case distinctions, treesize of input 43 treesize of output 65 [2018-01-23 14:27:41,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-23 14:27:41,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:27:41,247 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 3 xjuncts. [2018-01-23 14:27:41,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:116 [2018-01-23 14:27:41,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2018-01-23 14:27:41,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:41,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 53 [2018-01-23 14:27:41,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:27:41,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 58 [2018-01-23 14:27:41,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:41,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 55 treesize of output 66 [2018-01-23 14:27:41,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2018-01-23 14:27:41,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:41,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 53 [2018-01-23 14:27:41,443 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,455 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-23 14:27:41,485 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:155, output treesize:143 [2018-01-23 14:27:41,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66 [2018-01-23 14:27:41,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:41,564 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:27:41,565 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:27:41,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 73 [2018-01-23 14:27:41,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:27:41,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-01-23 14:27:41,619 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:27:41,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 57 [2018-01-23 14:27:41,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-23 14:27:41,700 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 57 [2018-01-23 14:27:41,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:41,768 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:27:41,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2018-01-23 14:27:41,771 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-23 14:27:41,793 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,801 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-23 14:27:41,823 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:173, output treesize:128 [2018-01-23 14:27:41,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 38 [2018-01-23 14:27:41,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 33 [2018-01-23 14:27:41,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 46 [2018-01-23 14:27:41,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:41,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 46 treesize of output 61 [2018-01-23 14:27:41,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 45 [2018-01-23 14:27:41,941 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:41,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:27:41,963 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:185, output treesize:73 [2018-01-23 14:27:42,162 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 49 treesize of output 61 [2018-01-23 14:27:42,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2018-01-23 14:27:42,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-23 14:27:42,249 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 2 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:27:42,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:27:42,284 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 47 treesize of output 37 [2018-01-23 14:27:42,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:42,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-01-23 14:27:42,343 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-23 14:27:42,376 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 23 treesize of output 13 [2018-01-23 14:27:42,376 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:42,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:27:42,482 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 53 treesize of output 55 [2018-01-23 14:27:42,488 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 43 treesize of output 38 [2018-01-23 14:27:42,488 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:42,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-23 14:27:42,518 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:42,540 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 19 treesize of output 9 [2018-01-23 14:27:42,540 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:42,561 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2018-01-23 14:27:42,562 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-01-23 14:27:42,589 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 17 [2018-01-23 14:27:42,589 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-23 14:27:42,609 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:27:42,692 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 49 treesize of output 57 [2018-01-23 14:27:42,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 37 [2018-01-23 14:27:42,727 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-01-23 14:27:42,800 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 17 [2018-01-23 14:27:42,801 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-23 14:27:42,839 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 43 treesize of output 38 [2018-01-23 14:27:42,839 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:43,037 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 31 treesize of output 19 [2018-01-23 14:27:43,038 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:43,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:43,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:43,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:43,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2018-01-23 14:27:43,159 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:43,184 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 19 treesize of output 9 [2018-01-23 14:27:43,184 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:43,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 41 [2018-01-23 14:27:43,217 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 11 xjuncts. [2018-01-23 14:27:43,279 INFO L267 ElimStorePlain]: Start of recursive call 14: 12 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:27:43,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:27:43,291 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:213, output treesize:22 [2018-01-23 14:27:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:43,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:27:43,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 41 [2018-01-23 14:27:43,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-23 14:27:43,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-23 14:27:43,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2018-01-23 14:27:43,462 INFO L87 Difference]: Start difference. First operand 179 states and 191 transitions. Second operand 41 states. [2018-01-23 14:27:45,758 WARN L146 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 48 DAG size of output 41 [2018-01-23 14:27:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:27:45,930 INFO L93 Difference]: Finished difference Result 372 states and 398 transitions. [2018-01-23 14:27:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-23 14:27:45,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 64 [2018-01-23 14:27:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:27:45,932 INFO L225 Difference]: With dead ends: 372 [2018-01-23 14:27:45,933 INFO L226 Difference]: Without dead ends: 354 [2018-01-23 14:27:45,934 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=712, Invalid=5140, Unknown=0, NotChecked=0, Total=5852 [2018-01-23 14:27:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-23 14:27:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 179. [2018-01-23 14:27:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-23 14:27:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2018-01-23 14:27:45,945 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 64 [2018-01-23 14:27:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:27:45,946 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2018-01-23 14:27:45,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-23 14:27:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2018-01-23 14:27:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-23 14:27:45,946 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:27:45,947 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-23 14:27:45,947 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:27:45,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2017452491, now seen corresponding path program 2 times [2018-01-23 14:27:45,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:27:45,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:27:45,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:45,948 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:27:45,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:27:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:27:45,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:27:46,364 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 27 DAG size of output 15 [2018-01-23 14:27:46,659 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 44 DAG size of output 20 [2018-01-23 14:27:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:27:46,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:27:46,961 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-23 14:27:46,966 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:27:46,975 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:27:46,985 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:27:46,991 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:27:46,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:27:47,044 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-23 14:27:47,046 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-23 14:27:47,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-23 14:27:47,077 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 23 treesize of output 18 [2018-01-23 14:27:47,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 27 [2018-01-23 14:27:47,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-23 14:27:47,114 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 30 treesize of output 23 [2018-01-23 14:27:47,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-23 14:27:47,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-01-23 14:27:47,161 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 39 treesize of output 30 [2018-01-23 14:27:47,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-23 14:27:47,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-01-23 14:27:47,214 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 44 treesize of output 33 [2018-01-23 14:27:47,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-01-23 14:27:47,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-01-23 14:27:47,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-01-23 14:27:47,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:63 [2018-01-23 14:27:47,382 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 42 treesize of output 43 [2018-01-23 14:27:47,384 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-23 14:27:47,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-01-23 14:27:47,452 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 51 treesize of output 50 [2018-01-23 14:27:47,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 27 [2018-01-23 14:27:47,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-01-23 14:27:47,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,529 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 58 treesize of output 64 [2018-01-23 14:27:47,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-01-23 14:27:47,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2018-01-23 14:27:47,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 79 [2018-01-23 14:27:47,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,637 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 118 [2018-01-23 14:27:47,638 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-23 14:27:47,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:97 [2018-01-23 14:27:47,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 98 [2018-01-23 14:27:47,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,770 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 148 [2018-01-23 14:27:47,772 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-23 14:27:47,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:27:47,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:116, output treesize:97 [2018-01-23 14:27:47,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 86 [2018-01-23 14:27:47,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:47,883 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 48 treesize of output 119 [2018-01-23 14:27:47,884 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-23 14:27:47,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 56 xjuncts. [2018-01-23 14:27:48,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-01-23 14:27:48,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-01-23 14:27:48,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:1022 [2018-01-23 14:27:48,976 WARN L146 SmtUtils]: Spent 316ms on a formula simplification. DAG size of input: 142 DAG size of output 70 [2018-01-23 14:27:48,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:48,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 126 [2018-01-23 14:27:49,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,018 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 101 [2018-01-23 14:27:49,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:27:49,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:27:49,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 126 [2018-01-23 14:27:49,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,270 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 109 [2018-01-23 14:27:49,271 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-23 14:27:49,348 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:27:49,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 126 [2018-01-23 14:27:49,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,584 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 116 [2018-01-23 14:27:49,586 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:27:49,645 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:27:49,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 126 [2018-01-23 14:27:49,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:49,902 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 109 [2018-01-23 14:27:49,903 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:27:49,971 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:27:50,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:50,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:50,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:50,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:50,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 158 [2018-01-23 14:27:50,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:50,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:50,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:50,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:50,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:50,313 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 145 [2018-01-23 14:27:50,314 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:27:50,374 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:27:50,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-01-23 14:27:50,607 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:690, output treesize:932 [2018-01-23 14:27:50,914 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 162 DAG size of output 115 [2018-01-23 14:27:51,126 WARN L143 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 120 [2018-01-23 14:27:51,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:51,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:51,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 130 [2018-01-23 14:27:51,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:51,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:51,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:51,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:51,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:27:51,297 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 18 disjoint index pairs (out of 36 index pairs), introduced 3 new quantified variables, introduced 20 case distinctions, treesize of input 89 treesize of output 278 [2018-01-23 14:27:51,297 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-01-23 14:27:51,899 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 73728 conjuctions. This might take some time... Received shutdown request... [2018-01-23 14:28:25,088 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-23 14:28:25,088 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:28:25,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:28:25 BoogieIcfgContainer [2018-01-23 14:28:25,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:28:25,091 INFO L168 Benchmark]: Toolchain (without parser) took 57808.10 ms. Allocated memory was 305.1 MB in the beginning and 1.2 GB in the end (delta: 885.0 MB). Free memory was 264.1 MB in the beginning and 874.2 MB in the end (delta: -610.2 MB). Peak memory consumption was 945.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:28:25,092 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:28:25,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.68 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 252.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:28:25,092 INFO L168 Benchmark]: Boogie Preprocessor took 39.66 ms. Allocated memory is still 305.1 MB. Free memory is still 252.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:28:25,093 INFO L168 Benchmark]: RCFGBuilder took 353.60 ms. Allocated memory is still 305.1 MB. Free memory was 250.0 MB in the beginning and 229.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:28:25,093 INFO L168 Benchmark]: TraceAbstraction took 57201.24 ms. Allocated memory was 305.1 MB in the beginning and 1.2 GB in the end (delta: 885.0 MB). Free memory was 229.1 MB in the beginning and 874.2 MB in the end (delta: -645.2 MB). Peak memory consumption was 910.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:28:25,094 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.17 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.68 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 252.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.66 ms. Allocated memory is still 305.1 MB. Free memory is still 252.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 353.60 ms. Allocated memory is still 305.1 MB. Free memory was 250.0 MB in the beginning and 229.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57201.24 ms. Allocated memory was 305.1 MB in the beginning and 1.2 GB in the end (delta: 885.0 MB). Free memory was 229.1 MB in the beginning and 874.2 MB in the end (delta: -645.2 MB). Peak memory consumption was 910.7 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: - 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 3 procedures, 58 locations, 3 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=58occurred 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); VAL [first={0:0}, last={0:0}] [L633] COND FALSE !(__VERIFIER_nondet_int()) [L663] COND FALSE !(\read(*first)) VAL [first={0:0}, last={0:0}] [L674] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 58 locations, 3 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 73728 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 58 locations, 3 error locations. TIMEOUT Result, 56.6s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 604 SDtfs, 2702 SDslu, 4323 SDs, 0 SdLazy, 4378 SolverSat, 351 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 281 SyntacticMatches, 23 SemanticMatches, 263 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=10, 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, 11 MinimizatonAttempts, 450 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 755 NumberOfCodeBlocks, 755 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 738 ConstructedInterpolants, 21 QuantifiedInterpolants, 555589 SizeOfPredicates, 79 NumberOfNonLiveVariables, 1091 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 69/172 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/test-0504_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-28-25-102.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-28-25-102.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-28-25-102.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-28-25-102.csv Completed graceful shutdown