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_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-properties/splice_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:05:05,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:05:05,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:05:05,171 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:05:05,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:05:05,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:05:05,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:05:05,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:05:05,176 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:05:05,177 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:05:05,178 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:05:05,178 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:05:05,179 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:05:05,181 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:05:05,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:05:05,184 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:05:05,186 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:05:05,188 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:05:05,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:05:05,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:05:05,193 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:05:05,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:05:05,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:05:05,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:05:05,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:05:05,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:05:05,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:05:05,198 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:05:05,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:05:05,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:05:05,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:05:05,199 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-21 00:05:05,208 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:05:05,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:05:05,209 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:05:05,209 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:05:05,209 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:05:05,209 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:05:05,209 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:05:05,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:05:05,210 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:05:05,210 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:05:05,210 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:05:05,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:05:05,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:05:05,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:05:05,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:05:05,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:05:05,211 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:05:05,211 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:05:05,211 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:05:05,211 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:05:05,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:05:05,212 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:05:05,212 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:05:05,212 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:05:05,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:05:05,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:05:05,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:05:05,213 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:05:05,213 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:05:05,213 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:05:05,213 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:05:05,213 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:05:05,214 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:05:05,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:05:05,214 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:05:05,214 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:05:05,215 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:05:05,215 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:05:05,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:05:05,259 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:05:05,262 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:05:05,263 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:05:05,264 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:05:05,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-01-21 00:05:05,416 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:05:05,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:05:05,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:05:05,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:05:05,426 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:05:05,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:05:05" (1/1) ... [2018-01-21 00:05:05,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533d743e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05, skipping insertion in model container [2018-01-21 00:05:05,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:05:05" (1/1) ... [2018-01-21 00:05:05,443 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:05:05,481 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:05:05,611 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:05:05,633 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:05:05,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05 WrapperNode [2018-01-21 00:05:05,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:05:05,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:05:05,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:05:05,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:05:05,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05" (1/1) ... [2018-01-21 00:05:05,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05" (1/1) ... [2018-01-21 00:05:05,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05" (1/1) ... [2018-01-21 00:05:05,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05" (1/1) ... [2018-01-21 00:05:05,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05" (1/1) ... [2018-01-21 00:05:05,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05" (1/1) ... [2018-01-21 00:05:05,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05" (1/1) ... [2018-01-21 00:05:05,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:05:05,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:05:05,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:05:05,684 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:05:05,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05" (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-21 00:05:05,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:05:05,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:05:05,752 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 00:05:05,752 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:05:05,752 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:05:05,752 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:05:05,752 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:05:05,752 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:05:05,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:05:05,753 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:05:05,753 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:05:05,753 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 00:05:05,753 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:05:05,753 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:05:05,753 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 00:05:05,754 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:05:05,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:05:05,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:05:06,042 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:05:06,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:05:06 BoogieIcfgContainer [2018-01-21 00:05:06,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:05:06,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:05:06,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:05:06,045 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:05:06,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:05:05" (1/3) ... [2018-01-21 00:05:06,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59709d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:05:06, skipping insertion in model container [2018-01-21 00:05:06,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:05:05" (2/3) ... [2018-01-21 00:05:06,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59709d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:05:06, skipping insertion in model container [2018-01-21 00:05:06,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:05:06" (3/3) ... [2018-01-21 00:05:06,049 INFO L105 eAbstractionObserver]: Analyzing ICFG splice_true-unreach-call_false-valid-memtrack.i [2018-01-21 00:05:06,058 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:05:06,065 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:05:06,112 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:05:06,112 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:05:06,113 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:05:06,113 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:05:06,113 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:05:06,113 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:05:06,113 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:05:06,113 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 00:05:06,114 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:05:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 00:05:06,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:05:06,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 64 states. [2018-01-21 00:05:06,247 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 00:05:06,247 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-21 00:05:06,247 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-21 00:05:06,248 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 00:05:06,248 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-21 00:05:06,248 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 680) no Hoare annotation was computed. [2018-01-21 00:05:06,248 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 680) no Hoare annotation was computed. [2018-01-21 00:05:06,248 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 680) the Hoare annotation is: true [2018-01-21 00:05:06,248 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 680) no Hoare annotation was computed. [2018-01-21 00:05:06,249 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 680) the Hoare annotation is: true [2018-01-21 00:05:06,249 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 680) no Hoare annotation was computed. [2018-01-21 00:05:06,249 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 680) the Hoare annotation is: true [2018-01-21 00:05:06,249 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 680) no Hoare annotation was computed. [2018-01-21 00:05:06,249 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 680) no Hoare annotation was computed. [2018-01-21 00:05:06,249 INFO L401 ceAbstractionStarter]: For program point L659'(line 659) no Hoare annotation was computed. [2018-01-21 00:05:06,250 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 00:05:06,250 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-21 00:05:06,250 INFO L401 ceAbstractionStarter]: For program point L675'(line 675) no Hoare annotation was computed. [2018-01-21 00:05:06,250 INFO L404 ceAbstractionStarter]: At program point L674''(lines 674 677) the Hoare annotation is: true [2018-01-21 00:05:06,250 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-21 00:05:06,250 INFO L401 ceAbstractionStarter]: For program point L629'''(line 629) no Hoare annotation was computed. [2018-01-21 00:05:06,251 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 680) no Hoare annotation was computed. [2018-01-21 00:05:06,251 INFO L401 ceAbstractionStarter]: For program point L636'(lines 636 648) no Hoare annotation was computed. [2018-01-21 00:05:06,251 INFO L401 ceAbstractionStarter]: For program point L676'(line 676) no Hoare annotation was computed. [2018-01-21 00:05:06,251 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-21 00:05:06,251 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-21 00:05:06,251 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-21 00:05:06,252 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-21 00:05:06,252 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-21 00:05:06,252 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-21 00:05:06,252 INFO L401 ceAbstractionStarter]: For program point L657'(line 657) no Hoare annotation was computed. [2018-01-21 00:05:06,252 INFO L404 ceAbstractionStarter]: At program point L645'(line 645) the Hoare annotation is: true [2018-01-21 00:05:06,253 INFO L404 ceAbstractionStarter]: At program point L629'(line 629) the Hoare annotation is: true [2018-01-21 00:05:06,253 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 680) no Hoare annotation was computed. [2018-01-21 00:05:06,253 INFO L404 ceAbstractionStarter]: At program point L675''(line 675) the Hoare annotation is: true [2018-01-21 00:05:06,253 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-21 00:05:06,253 INFO L401 ceAbstractionStarter]: For program point L637(lines 637 643) no Hoare annotation was computed. [2018-01-21 00:05:06,253 INFO L401 ceAbstractionStarter]: For program point L636(lines 636 648) no Hoare annotation was computed. [2018-01-21 00:05:06,254 INFO L401 ceAbstractionStarter]: For program point L637''(lines 637 643) no Hoare annotation was computed. [2018-01-21 00:05:06,254 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-21 00:05:06,254 INFO L401 ceAbstractionStarter]: For program point L645'''(line 645) no Hoare annotation was computed. [2018-01-21 00:05:06,254 INFO L401 ceAbstractionStarter]: For program point L670'(line 670) no Hoare annotation was computed. [2018-01-21 00:05:06,254 INFO L401 ceAbstractionStarter]: For program point L669(lines 669 672) no Hoare annotation was computed. [2018-01-21 00:05:06,255 INFO L404 ceAbstractionStarter]: At program point L669''(lines 669 672) the Hoare annotation is: true [2018-01-21 00:05:06,255 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-21 00:05:06,255 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-21 00:05:06,255 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 680) no Hoare annotation was computed. [2018-01-21 00:05:06,255 INFO L401 ceAbstractionStarter]: For program point L655(lines 655 667) no Hoare annotation was computed. [2018-01-21 00:05:06,255 INFO L401 ceAbstractionStarter]: For program point L671'(line 671) no Hoare annotation was computed. [2018-01-21 00:05:06,256 INFO L401 ceAbstractionStarter]: For program point L659(line 659) no Hoare annotation was computed. [2018-01-21 00:05:06,256 INFO L401 ceAbstractionStarter]: For program point L658(lines 658 666) no Hoare annotation was computed. [2018-01-21 00:05:06,256 INFO L401 ceAbstractionStarter]: For program point L657(line 657) no Hoare annotation was computed. [2018-01-21 00:05:06,256 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 680) the Hoare annotation is: true [2018-01-21 00:05:06,256 INFO L404 ceAbstractionStarter]: At program point L636'''(lines 636 648) the Hoare annotation is: true [2018-01-21 00:05:06,256 INFO L401 ceAbstractionStarter]: For program point L674'''(lines 674 677) no Hoare annotation was computed. [2018-01-21 00:05:06,257 INFO L401 ceAbstractionStarter]: For program point L628'(line 628) no Hoare annotation was computed. [2018-01-21 00:05:06,257 INFO L401 ceAbstractionStarter]: For program point L670(line 670) no Hoare annotation was computed. [2018-01-21 00:05:06,257 INFO L401 ceAbstractionStarter]: For program point L674(lines 674 677) no Hoare annotation was computed. [2018-01-21 00:05:06,257 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-21 00:05:06,257 INFO L401 ceAbstractionStarter]: For program point L641'(line 641) no Hoare annotation was computed. [2018-01-21 00:05:06,257 INFO L401 ceAbstractionStarter]: For program point L669'''(lines 669 672) no Hoare annotation was computed. [2018-01-21 00:05:06,258 INFO L401 ceAbstractionStarter]: For program point L676(line 676) no Hoare annotation was computed. [2018-01-21 00:05:06,258 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-21 00:05:06,258 INFO L404 ceAbstractionStarter]: At program point L658''(lines 658 666) the Hoare annotation is: true [2018-01-21 00:05:06,258 INFO L401 ceAbstractionStarter]: For program point L638'(line 638) no Hoare annotation was computed. [2018-01-21 00:05:06,258 INFO L401 ceAbstractionStarter]: For program point L636''''(lines 636 648) no Hoare annotation was computed. [2018-01-21 00:05:06,258 INFO L401 ceAbstractionStarter]: For program point L655'''(lines 655 667) no Hoare annotation was computed. [2018-01-21 00:05:06,263 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:05:06,263 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:05:06,263 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:05:06,263 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:05:06,264 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:05:06,264 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:05:06,264 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:05:06,264 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:05:06,264 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:05:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 00:05:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:05:06,268 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:05:06,269 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:05:06,269 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:05:06,274 INFO L82 PathProgramCache]: Analyzing trace with hash 171440, now seen corresponding path program 1 times [2018-01-21 00:05:06,277 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:05:06,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:05:06,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:05:06,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:05:06,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:05:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:05:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:05:06,368 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:05:06,374 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:05:06,381 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:05:06,381 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:05:06,381 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:05:06,381 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:05:06,382 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:05:06,382 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:05:06,382 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:05:06,382 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:05:06,382 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:05:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 00:05:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 00:05:06,387 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:05:06,387 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:05:06,387 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:05:06,388 INFO L82 PathProgramCache]: Analyzing trace with hash -999156771, now seen corresponding path program 1 times [2018-01-21 00:05:06,388 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:05:06,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:05:06,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:05:06,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:05:06,390 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:05:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:05:06,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:05:06,457 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-21 00:05:06,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:05:06,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:05:06,459 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:05:06,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:05:06,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:05:06,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:05:06,541 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-01-21 00:05:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:05:06,559 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2018-01-21 00:05:06,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:05:06,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 00:05:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:05:06,567 INFO L225 Difference]: With dead ends: 99 [2018-01-21 00:05:06,568 INFO L226 Difference]: Without dead ends: 56 [2018-01-21 00:05:06,570 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-21 00:05:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-21 00:05:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-21 00:05:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-21 00:05:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-01-21 00:05:06,599 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 17 [2018-01-21 00:05:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:05:06,599 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-01-21 00:05:06,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:05:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-01-21 00:05:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:05:06,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:05:06,600 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:05:06,600 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:05:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash -564250623, now seen corresponding path program 1 times [2018-01-21 00:05:06,601 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:05:06,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:05:06,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:05:06,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:05:06,602 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:05:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:05:06,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:05:06,678 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-21 00:05:06,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:05:06,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:05:06,679 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:05:06,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:05:06,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:05:06,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:05:06,681 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 4 states. [2018-01-21 00:05:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:05:06,737 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-01-21 00:05:06,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:05:06,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-21 00:05:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:05:06,739 INFO L225 Difference]: With dead ends: 97 [2018-01-21 00:05:06,740 INFO L226 Difference]: Without dead ends: 65 [2018-01-21 00:05:06,741 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:05:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-21 00:05:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-01-21 00:05:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 00:05:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-01-21 00:05:06,748 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 19 [2018-01-21 00:05:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:05:06,749 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-01-21 00:05:06,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:05:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-01-21 00:05:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:05:06,750 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:05:06,750 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:05:06,750 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:05:06,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2078626135, now seen corresponding path program 1 times [2018-01-21 00:05:06,750 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:05:06,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:05:06,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:05:06,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:05:06,752 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:05:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:05:06,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:05:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:05:06,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:05:06,948 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:05:06,949 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-21 00:05:06,951 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [21], [24], [25], [26], [32], [33], [39], [41], [42], [43], [47], [48], [51], [125], [132], [133], [138], [143], [144], [145], [146] [2018-01-21 00:05:07,013 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:05:07,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:05:14,059 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:05:14,060 INFO L268 AbstractInterpreter]: Visited 27 different actions 36 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-01-21 00:05:14,067 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:05:19,722 INFO L232 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 60.71% of their original sizes. [2018-01-21 00:05:19,722 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:05:20,023 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_old(#valid)| 0)) (.cse3 (select |c_#valid| c_main_~a~6.base)) (.cse0 (select |c_#memory_int| c_main_~p~6.base)) (.cse1 (select |c_#valid| 0))) (and (not (= |c_#length| |c_old(#valid)|)) (= c_main_~p~6.offset c_main_~a~6.offset) (not (= |c_#valid| .cse0)) (= .cse1 (select |c_old(#valid)| c_main_~a~6.base)) (= .cse2 c_main_~p~6.offset) (= (select |c_#length| c_main_~a~6.base) 8) (= 0 .cse2) (= .cse3 (select .cse0 c_main_~p~6.offset)) (forall ((v_weq0_1 Int)) (let ((.cse5 (select |c_#valid| v_weq0_1)) (.cse4 (select |c_old(#valid)| v_weq0_1))) (or (= .cse4 .cse5) (let ((.cse11 (select |c_#memory_$Pointer$.offset| v_weq0_1)) (.cse10 (select |c_#memory_$Pointer$.offset| c_main_~p~6.base)) (.cse8 (select |c_#memory_int| c_main_~p~6.base))) (let ((.cse7 (select |c_#valid| 0)) (.cse14 (select .cse8 c_main_~p~6.offset)) (.cse13 (select |c_#valid| c_main_~a~6.base)) (.cse16 (select .cse10 c_main_~p~6.offset)) (.cse6 (select |c_#memory_$Pointer$.base| c_main_~p~6.base)) (.cse12 (select |c_#length| c_main_~a~6.base)) (.cse15 (select .cse11 .cse4)) (.cse9 (select |c_old(#valid)| 0))) (and (= v_weq0_1 c_main_~p~6.base) (= (select .cse6 .cse4) (select .cse6 c_main_~p~6.offset)) (= .cse4 .cse7) (not (= |c_#valid| .cse8)) (= .cse7 (select |c_old(#valid)| c_main_~a~6.base)) (= 0 c_main_~p~6.offset) (= c_main_~p~6.offset .cse9) (= .cse10 .cse11) (= .cse12 8) (= .cse13 .cse14) (= .cse14 .cse5) (= (select |c_#memory_int| v_weq0_1) .cse8) (= c_main_~a~6.offset .cse4) (= .cse15 .cse16) (= 1 .cse13) (= .cse16 (select .cse10 .cse4)) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse6) (= (select |c_#length| v_weq0_1) .cse12) (= (select .cse11 c_main_~p~6.offset) .cse15) (not (= .cse8 |c_old(#valid)|)) (not (= c_main_~a~6.base 0)) (= c_main_~p~6.base c_main_~a~6.base) (= .cse9 c_main_~a~6.offset))))))) (not (= |c_#valid| |c_#length|)) (= 1 .cse3) (not (= 0 c_main_~a~6.base)) (not (= .cse0 |c_old(#valid)|)) (= c_main_~a~6.offset .cse1) (= c_main_~p~6.base c_main_~a~6.base) (not (= |c_#valid| |c_old(#valid)|)))) is different from false [2018-01-21 00:05:20,030 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_old(#valid)| 0)) (.cse3 (select |c_#valid| c_main_~a~6.base)) (.cse0 (select |c_#memory_int| c_main_~p~6.base)) (.cse1 (select |c_#valid| 0))) (and (not (= |c_#length| |c_old(#valid)|)) (= c_main_~p~6.offset c_main_~a~6.offset) (not (= |c_#valid| .cse0)) (= .cse1 (select |c_old(#valid)| c_main_~a~6.base)) (= .cse2 c_main_~p~6.offset) (= (select |c_#length| c_main_~a~6.base) 8) (= 0 .cse2) (= .cse3 (select .cse0 c_main_~p~6.offset)) (forall ((v_weq0_1 Int)) (let ((.cse5 (select |c_#valid| v_weq0_1)) (.cse4 (select |c_old(#valid)| v_weq0_1))) (or (= .cse4 .cse5) (let ((.cse10 (select |c_#memory_$Pointer$.offset| v_weq0_1)) (.cse9 (select |c_#memory_$Pointer$.offset| c_main_~p~6.base)) (.cse7 (select |c_#memory_int| c_main_~p~6.base))) (let ((.cse6 (select |c_#valid| 0)) (.cse14 (select .cse7 c_main_~p~6.offset)) (.cse13 (select |c_#valid| c_main_~a~6.base)) (.cse16 (select .cse9 c_main_~p~6.offset)) (.cse12 (select |c_#memory_$Pointer$.base| c_main_~p~6.base)) (.cse11 (select |c_#length| c_main_~a~6.base)) (.cse15 (select .cse10 .cse4)) (.cse8 (select |c_old(#valid)| 0))) (and (= v_weq0_1 c_main_~p~6.base) (= .cse4 .cse6) (not (= |c_#valid| .cse7)) (= .cse6 (select |c_old(#valid)| c_main_~a~6.base)) (= 0 c_main_~p~6.offset) (= c_main_~p~6.offset .cse8) (= .cse9 .cse10) (= .cse11 8) (= (select .cse12 c_main_~p~6.offset) (select .cse12 .cse4)) (= .cse13 .cse14) (= .cse14 .cse5) (= (select |c_#memory_int| v_weq0_1) .cse7) (= c_main_~a~6.offset .cse4) (= .cse15 .cse16) (= 1 .cse13) (= .cse16 (select .cse9 .cse4)) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse12) (= (select |c_#length| v_weq0_1) .cse11) (= (select .cse10 c_main_~p~6.offset) .cse15) (not (= .cse7 |c_old(#valid)|)) (not (= c_main_~a~6.base 0)) (= c_main_~p~6.base c_main_~a~6.base) (= .cse8 c_main_~a~6.offset))))))) (not (= |c_#valid| |c_#length|)) (= 1 .cse3) (not (= 0 c_main_~a~6.base)) (not (= .cse0 |c_old(#valid)|)) (= c_main_~a~6.offset .cse1) (= c_main_~p~6.base c_main_~a~6.base) (not (= |c_#valid| |c_old(#valid)|)))) is different from false [2018-01-21 00:05:20,037 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_main_#t~malloc4.base|)) (.cse35 (select |c_#valid| c_main_~a~6.base)) (.cse5 (select |c_old(#valid)| |c_main_#t~malloc4.base|)) (.cse2 (select |c_#valid| 0)) (.cse1 (select |c_#memory_int| c_main_~p~6.base)) (.cse3 (select |c_old(#valid)| c_main_~a~6.base)) (.cse4 (select |c_old(#valid)| 0))) (and (= 1 .cse0) (not (= c_main_~a~6.base |c_main_#t~malloc4.base|)) (not (= |c_#valid| .cse1)) (= .cse2 .cse3) (= 0 c_main_~p~6.offset) (= c_main_~p~6.offset .cse4) (= c_main_~a~6.offset .cse5) (forall ((v_weq0_1 Int)) (let ((.cse23 (select |c_#memory_int| c_main_~p~6.base)) (.cse28 (select |c_#memory_$Pointer$.offset| c_main_~p~6.base))) (let ((.cse14 (select |c_#valid| c_main_~a~6.base)) (.cse30 (select |c_old(#valid)| 0)) (.cse31 (select |c_#valid| |c_main_#t~malloc4.base|)) (.cse33 (select |c_old(#valid)| c_main_~a~6.base)) (.cse32 (select |c_#valid| 0)) (.cse25 (select .cse28 c_main_~p~6.offset)) (.cse15 (select .cse23 c_main_~p~6.offset)) (.cse7 (select |c_#valid| v_weq0_1)) (.cse34 (select |c_old(#valid)| |c_main_#t~malloc4.base|)) (.cse6 (select |c_old(#valid)| v_weq0_1)) (.cse26 (select |c_#memory_$Pointer$.base| c_main_~p~6.base))) (let ((.cse8 (= (select .cse26 .cse6) (select .cse26 c_main_~p~6.offset))) (.cse11 (= 0 c_main_~p~6.offset)) (.cse12 (= .cse6 .cse34)) (.cse16 (= .cse15 .cse7)) (.cse17 (= c_main_~a~6.offset .cse6)) (.cse18 (= .cse25 (select .cse28 .cse6))) (.cse20 (= .cse34 .cse32)) (.cse21 (= .cse33 |c_main_#t~malloc4.offset|)) (.cse9 (= 1 .cse31)) (.cse10 (= .cse32 .cse33)) (.cse13 (= c_main_~p~6.offset .cse30)) (.cse19 (= .cse31 .cse14)) (.cse22 (= .cse30 c_main_~a~6.offset))) (or (= .cse6 .cse7) (and (not (= c_main_~p~6.base 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 (not (= c_main_~p~6.base v_weq0_1)) (not (= v_weq0_1 0)) (= |c_main_#t~malloc4.base| v_weq0_1) .cse21 .cse22) (let ((.cse29 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse27 (select .cse23 .cse6)) (.cse24 (select .cse29 .cse6))) (and .cse8 (not (= |c_#valid| .cse23)) .cse11 .cse12 .cse16 (= (select |c_#memory_int| v_weq0_1) .cse23) .cse17 (= .cse24 .cse25) .cse18 (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse26) .cse20 (= .cse27 .cse15) (not (= |c_main_#t~malloc4.base| 0)) (= c_main_~p~6.base c_main_~a~6.base) .cse21 (= v_weq0_1 c_main_~p~6.base) .cse9 .cse10 .cse13 (= .cse14 .cse27) (= .cse28 .cse29) .cse19 (not (= 0 c_main_~a~6.base)) (= (select .cse29 c_main_~p~6.offset) .cse24) (not (= |c_main_#t~malloc4.base| c_main_~a~6.base)) (not (= .cse23 |c_old(#valid)|)) .cse22)))))))) (= .cse35 (select .cse1 c_main_~p~6.offset)) (= .cse0 .cse35) (= .cse5 .cse2) (not (= 0 c_main_~a~6.base)) (not (= |c_main_#t~malloc4.base| 0)) (not (= .cse1 |c_old(#valid)|)) (= c_main_~p~6.base c_main_~a~6.base) (= .cse3 |c_main_#t~malloc4.offset|) (not (= |c_#valid| |c_old(#valid)|)) (= .cse4 c_main_~a~6.offset))) is different from false [2018-01-21 00:05:20,045 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#valid| c_main_~a~6.base)) (.cse1 (select |c_#valid| 0)) (.cse2 (select |c_old(#valid)| c_main_~a~6.base)) (.cse0 (select |c_#memory_int| c_main_~p~6.base)) (.cse30 (select |c_old(#valid)| 0))) (and (not (= 0 c_main_~t~6.base)) (not (= c_main_~a~6.base c_main_~t~6.base)) (not (= |c_#valid| .cse0)) (= .cse1 .cse2) (= 0 c_main_~p~6.offset) (forall ((v_weq0_1 Int)) (let ((.cse6 (select |c_#memory_int| c_main_~p~6.base)) (.cse21 (select |c_#memory_$Pointer$.offset| c_main_~p~6.base))) (let ((.cse10 (select .cse21 c_main_~p~6.offset)) (.cse20 (select |c_#valid| c_main_~a~6.base)) (.cse15 (select .cse6 c_main_~p~6.offset)) (.cse4 (select |c_#valid| v_weq0_1)) (.cse13 (select |c_#memory_$Pointer$.base| c_main_~p~6.base)) (.cse27 (select |c_old(#valid)| 0)) (.cse28 (select |c_old(#valid)| c_main_~a~6.base)) (.cse29 (select |c_#valid| 0)) (.cse3 (select |c_old(#valid)| v_weq0_1))) (let ((.cse16 (= c_main_~t~6.offset .cse3)) (.cse5 (= .cse3 .cse29)) (.cse17 (= .cse29 .cse28)) (.cse7 (= 0 c_main_~p~6.offset)) (.cse18 (= (select |c_#valid| c_main_~t~6.base) 1)) (.cse19 (= c_main_~p~6.offset .cse27)) (.cse23 (= c_main_~a~6.offset c_main_~t~6.offset)) (.cse24 (= (select .cse13 c_main_~p~6.offset) (select .cse13 .cse3))) (.cse8 (= .cse15 .cse4)) (.cse11 (= 1 .cse20)) (.cse12 (= .cse10 (select .cse21 .cse3))) (.cse25 (= .cse28 (select |c_old(#valid)| c_main_~t~6.base))) (.cse26 (= .cse27 c_main_~a~6.offset))) (or (= .cse3 .cse4) (let ((.cse22 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse14 (select .cse6 .cse3)) (.cse9 (select .cse22 .cse3))) (and .cse5 (not (= |c_#valid| .cse6)) .cse7 (not (= c_main_~t~6.base 0)) .cse8 (= (select |c_#memory_int| v_weq0_1) .cse6) (= .cse9 .cse10) .cse11 .cse12 (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse13) (= .cse14 .cse15) (not (= c_main_~a~6.base 0)) (= c_main_~p~6.base c_main_~a~6.base) .cse16 (= v_weq0_1 c_main_~p~6.base) (not (= 0 c_main_~t~6.base)) (not (= c_main_~t~6.base c_main_~a~6.base)) .cse17 .cse18 .cse19 (= .cse20 .cse14) (= .cse21 .cse22) .cse23 .cse24 .cse25 (= (select .cse22 c_main_~p~6.offset) .cse9) (not (= .cse6 |c_old(#valid)|)) .cse26))) (and .cse16 (not (= c_main_~p~6.base 0)) .cse5 .cse17 .cse7 .cse18 .cse19 .cse23 .cse24 (= c_main_~t~6.base v_weq0_1) (= .cse20 .cse15) .cse8 (not (= 0 v_weq0_1)) .cse11 .cse12 .cse25 (not (= c_main_~p~6.base v_weq0_1)) (not (= v_weq0_1 0)) .cse26)))))) (= (select |c_#valid| c_main_~t~6.base) 1) (= c_main_~p~6.offset .cse30) (= c_main_~a~6.offset c_main_~t~6.offset) (= .cse31 (select .cse0 c_main_~p~6.offset)) (= 1 .cse31) (= c_main_~t~6.offset .cse1) (not (= 0 c_main_~a~6.base)) (= .cse2 (select |c_old(#valid)| c_main_~t~6.base)) (not (= .cse0 |c_old(#valid)|)) (= c_main_~p~6.base c_main_~a~6.base) (not (= |c_#valid| |c_old(#valid)|)) (= .cse30 c_main_~a~6.offset))) is different from false [2018-01-21 00:05:20,052 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#valid| c_main_~a~6.base)) (.cse1 (select |c_#valid| 0)) (.cse2 (select |c_old(#valid)| c_main_~a~6.base)) (.cse0 (select |c_#memory_int| c_main_~p~6.base)) (.cse30 (select |c_old(#valid)| 0))) (and (not (= 0 c_main_~t~6.base)) (not (= c_main_~a~6.base c_main_~t~6.base)) (not (= |c_#valid| .cse0)) (= .cse1 .cse2) (= 0 c_main_~p~6.offset) (forall ((v_weq0_1 Int)) (let ((.cse6 (select |c_#memory_int| c_main_~p~6.base)) (.cse21 (select |c_#memory_$Pointer$.offset| c_main_~p~6.base))) (let ((.cse10 (select .cse21 c_main_~p~6.offset)) (.cse20 (select |c_#valid| c_main_~a~6.base)) (.cse15 (select .cse6 c_main_~p~6.offset)) (.cse4 (select |c_#valid| v_weq0_1)) (.cse13 (select |c_#memory_$Pointer$.base| c_main_~p~6.base)) (.cse27 (select |c_old(#valid)| 0)) (.cse28 (select |c_old(#valid)| c_main_~a~6.base)) (.cse29 (select |c_#valid| 0)) (.cse3 (select |c_old(#valid)| v_weq0_1))) (let ((.cse16 (= c_main_~t~6.offset .cse3)) (.cse5 (= .cse3 .cse29)) (.cse17 (= .cse29 .cse28)) (.cse7 (= 0 c_main_~p~6.offset)) (.cse18 (= (select |c_#valid| c_main_~t~6.base) 1)) (.cse19 (= c_main_~p~6.offset .cse27)) (.cse23 (= c_main_~a~6.offset c_main_~t~6.offset)) (.cse24 (= (select .cse13 c_main_~p~6.offset) (select .cse13 .cse3))) (.cse8 (= .cse15 .cse4)) (.cse11 (= 1 .cse20)) (.cse12 (= .cse10 (select .cse21 .cse3))) (.cse25 (= .cse28 (select |c_old(#valid)| c_main_~t~6.base))) (.cse26 (= .cse27 c_main_~a~6.offset))) (or (= .cse3 .cse4) (let ((.cse22 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse14 (select .cse6 .cse3)) (.cse9 (select .cse22 .cse3))) (and .cse5 (not (= |c_#valid| .cse6)) .cse7 (not (= c_main_~t~6.base 0)) .cse8 (= (select |c_#memory_int| v_weq0_1) .cse6) (= .cse9 .cse10) .cse11 .cse12 (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse13) (= .cse14 .cse15) (not (= c_main_~a~6.base 0)) (= c_main_~p~6.base c_main_~a~6.base) .cse16 (= v_weq0_1 c_main_~p~6.base) (not (= 0 c_main_~t~6.base)) (not (= c_main_~t~6.base c_main_~a~6.base)) .cse17 .cse18 .cse19 (= .cse20 .cse14) (= .cse21 .cse22) .cse23 .cse24 .cse25 (= (select .cse22 c_main_~p~6.offset) .cse9) (not (= .cse6 |c_old(#valid)|)) .cse26))) (and .cse16 (not (= c_main_~p~6.base 0)) .cse5 .cse17 .cse7 .cse18 .cse19 .cse23 .cse24 (= c_main_~t~6.base v_weq0_1) (= .cse20 .cse15) .cse8 (not (= 0 v_weq0_1)) .cse11 .cse12 .cse25 (not (= c_main_~p~6.base v_weq0_1)) (not (= v_weq0_1 0)) .cse26)))))) (= (select |c_#valid| c_main_~t~6.base) 1) (= c_main_~p~6.offset .cse30) (not (= c_main_~t~6.base 0)) (= c_main_~a~6.offset c_main_~t~6.offset) (= .cse31 (select .cse0 c_main_~p~6.offset)) (= 1 .cse31) (= c_main_~t~6.offset .cse1) (= .cse2 (select |c_old(#valid)| c_main_~t~6.base)) (not (= .cse0 |c_old(#valid)|)) (not (= c_main_~a~6.base 0)) (= c_main_~p~6.base c_main_~a~6.base) (not (= |c_#valid| |c_old(#valid)|)) (= .cse30 c_main_~a~6.offset))) is different from false [2018-01-21 00:05:20,061 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse35 (select |c_#memory_$Pointer$.base| c_main_~p~6.base)) (.cse37 (+ c_main_~p~6.offset 4))) (let ((.cse2 (select .cse35 .cse37)) (.cse36 (select |c_#memory_$Pointer$.offset| c_main_~p~6.base))) (let ((.cse0 (select .cse36 .cse37)) (.cse1 (select |c_#valid| c_main_~a~6.base)) (.cse32 (select |c_old(#valid)| .cse2)) (.cse33 (select |c_#valid| 0)) (.cse34 (select |c_old(#valid)| 0))) (and (= 0 .cse0) (= .cse1 (select |c_#valid| .cse2)) (not (= c_main_~a~6.base .cse2)) (forall ((v_weq0_1 Int)) (let ((.cse26 (select |c_#memory_$Pointer$.base| c_main_~p~6.base)) (.cse21 (+ c_main_~p~6.offset 4))) (let ((.cse22 (select |c_#memory_$Pointer$.offset| c_main_~p~6.base)) (.cse10 (select .cse26 .cse21))) (let ((.cse27 (select |c_old(#valid)| 0)) (.cse28 (select |c_old(#valid)| .cse10)) (.cse17 (select |c_old(#valid)| v_weq0_1)) (.cse8 (select |c_#valid| 0)) (.cse29 (select |c_#valid| c_main_~a~6.base)) (.cse31 (select |c_#valid| .cse10)) (.cse18 (select |c_#valid| v_weq0_1)) (.cse30 (select .cse22 .cse21))) (let ((.cse3 (= 0 .cse30)) (.cse4 (= .cse31 .cse18)) (.cse5 (= .cse29 .cse31)) (.cse6 (= .cse17 .cse8)) (.cse9 (select |c_old(#valid)| c_main_~a~6.base)) (.cse7 (= .cse30 .cse28)) (.cse11 (= c_main_~p~6.offset .cse27)) (.cse12 (= c_main_~a~6.offset .cse17)) (.cse13 (= 1 .cse29)) (.cse14 (= .cse28 c_main_~p~6.offset)) (.cse15 (not (= 0 .cse10))) (.cse16 (= .cse27 c_main_~a~6.offset))) (or (and .cse3 .cse4 .cse5 (not (= c_main_~p~6.base 0)) .cse6 .cse7 (= .cse8 .cse9) (= v_weq0_1 .cse10) .cse11 (not (= .cse10 0)) (not (= c_main_~p~6.base .cse10)) .cse12 .cse13 .cse14 .cse15 .cse16) (= .cse17 .cse18) (let ((.cse23 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse19 (select .cse23 .cse21)) (.cse25 (select |c_#memory_int| c_main_~p~6.base)) (.cse24 (select |c_#memory_int| v_weq0_1)) (.cse20 (select |c_#memory_$Pointer$.base| v_weq0_1))) (and .cse3 .cse4 .cse5 (= v_weq0_1 c_main_~p~6.base) .cse6 (= .cse19 .cse9) .cse7 (= (select .cse20 .cse21) .cse10) .cse11 (= .cse22 .cse23) (= .cse8 .cse19) (= .cse24 .cse25) .cse12 .cse13 (= (select .cse25 .cse21) (select .cse24 .cse21)) (= .cse20 .cse26) .cse14 (not (= .cse10 c_main_~a~6.base)) .cse15 (not (= c_main_~a~6.base 0)) (not (= .cse26 .cse22)) (= c_main_~p~6.base c_main_~a~6.base) .cse16))))))))) (= .cse0 .cse32) (= .cse33 (select |c_old(#valid)| c_main_~a~6.base)) (= c_main_~p~6.offset .cse34) (not (= |c_#memory_$Pointer$.base| |c_#memory_$Pointer$.offset|)) (= 1 .cse1) (= .cse32 c_main_~p~6.offset) (not (= 0 c_main_~a~6.base)) (not (= 0 .cse2)) (= c_main_~a~6.offset .cse33) (not (= .cse35 .cse36)) (= c_main_~p~6.base c_main_~a~6.base) (not (= |c_#valid| |c_old(#valid)|)) (= .cse34 c_main_~a~6.offset))))) is different from false [2018-01-21 00:05:20,169 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#valid| 0))) (let ((.cse5 (select |c_#valid| c_main_~a~6.base)) (.cse7 (= .cse9 (select |c_old(#valid)| c_main_~a~6.base))) (.cse6 (not (= 0 c_main_~a~6.base))) (.cse10 (not (= |c_#valid| |c_old(#valid)|))) (.cse8 (select |c_old(#valid)| 0))) (or (and (forall ((v_weq0_1 Int)) (let ((.cse0 (select |c_old(#valid)| v_weq0_1)) (.cse1 (select |c_#valid| v_weq0_1))) (or (= .cse0 .cse1) (let ((.cse2 (select |c_#valid| 0)) (.cse3 (select |c_#valid| c_main_~a~6.base)) (.cse4 (select |c_old(#valid)| 0))) (and (= v_weq0_1 c_main_~p~6.base) (= c_main_~a~6.offset .cse0) (= .cse0 .cse2) (= 1 .cse3) (= .cse2 (select |c_old(#valid)| c_main_~a~6.base)) (= 0 c_main_~p~6.offset) (= c_main_~p~6.offset .cse4) (= .cse3 .cse1) (not (= c_main_~a~6.base 0)) (= c_main_~p~6.base c_main_~a~6.base) (= .cse4 c_main_~a~6.offset)))))) (= c_main_~p~6.offset c_main_~a~6.offset) (= 1 .cse5) .cse6 .cse7 (= .cse8 c_main_~p~6.offset) (= c_main_~a~6.offset .cse9) (= 0 .cse8) (= c_main_~p~6.base c_main_~a~6.base) .cse10) (let ((.cse12 (select |c_#valid| c_main_~p~6.base)) (.cse11 (select |c_old(#valid)| c_main_~p~6.base))) (and (not (= 0 c_main_~p~6.base)) (= c_main_~a~6.offset .cse11) (= .cse12 .cse5) .cse7 (= 0 c_main_~p~6.offset) (= c_main_~p~6.offset .cse8) (not (= (select |c_#memory_$Pointer$.base| c_main_~a~6.base) (select |c_#memory_$Pointer$.offset| c_main_~a~6.base))) (forall ((v_weq0_1 Int)) (let ((.cse27 (select |c_#valid| v_weq0_1)) (.cse30 (select |c_old(#valid)| 0)) (.cse32 (select |c_#valid| c_main_~p~6.base)) (.cse31 (select |c_#valid| c_main_~a~6.base)) (.cse34 (select |c_old(#valid)| c_main_~p~6.base)) (.cse26 (select |c_old(#valid)| v_weq0_1)) (.cse33 (select |c_#valid| 0))) (let ((.cse13 (not (= c_main_~p~6.base 0))) (.cse14 (not (= 0 c_main_~p~6.base))) (.cse15 (= .cse26 .cse33)) (.cse16 (= c_main_~a~6.offset .cse34)) (.cse17 (= .cse32 .cse31)) (.cse18 (= .cse34 .cse26)) (.cse19 (= .cse33 (select |c_old(#valid)| c_main_~a~6.base))) (.cse20 (= 0 c_main_~p~6.offset)) (.cse21 (= c_main_~p~6.offset .cse30)) (.cse22 (= 1 .cse32)) (.cse23 (= .cse31 .cse27)) (.cse24 (not (= c_main_~a~6.base 0))) (.cse25 (= .cse30 c_main_~a~6.offset))) (or (and (= v_weq0_1 c_main_~p~6.base) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (not (= c_main_~a~6.base c_main_~p~6.base)) .cse24 .cse25) (= .cse26 .cse27) (let ((.cse29 (select |c_#memory_$Pointer$.base| c_main_~a~6.base)) (.cse28 (select |c_#memory_$Pointer$.offset| c_main_~a~6.base))) (and (= (select |c_#memory_$Pointer$.offset| v_weq0_1) .cse28) .cse13 (= .cse29 (select |c_#memory_$Pointer$.base| v_weq0_1)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= c_main_~p~6.base c_main_~a~6.base)) (not (= .cse29 .cse28)) (= v_weq0_1 c_main_~a~6.base) .cse22 (= (select |c_#memory_int| v_weq0_1) (select |c_#memory_int| c_main_~a~6.base)) .cse23 .cse24 .cse25)))))) (= 1 .cse12) (not (= |c_#memory_$Pointer$.base| |c_#memory_$Pointer$.offset|)) .cse6 (not (= c_main_~a~6.base c_main_~p~6.base)) (= .cse11 .cse9) .cse10 (= .cse8 c_main_~a~6.offset)))))) is different from false [2018-01-21 00:05:20,233 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#valid)| 0))) (and (= .cse0 (select |c_#valid| 0)) (forall ((v_weq0_1 Int)) (let ((.cse1 (select |c_old(#valid)| v_weq0_1)) (.cse2 (select |c_#valid| v_weq0_1))) (or (= .cse1 .cse2) (let ((.cse3 (select |c_old(#valid)| 0))) (and (= .cse1 (select |c_#valid| 0)) (= .cse3 .cse1) (not (= v_weq0_1 0)) (= 0 .cse3) (= 1 .cse2)))))) (= 0 .cse0) (not (= |c_#valid| |c_old(#valid)|)))) is different from false [2018-01-21 00:05:20,235 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_old(#valid)| 0))) (and (forall ((v_weq0_1 Int)) (let ((.cse0 (select |c_old(#valid)| v_weq0_1)) (.cse1 (select |c_#valid| v_weq0_1))) (or (= .cse0 .cse1) (let ((.cse2 (select |c_old(#valid)| 0))) (and (= .cse0 (select |c_#valid| 0)) (= |c_main_#res| .cse0) (not (= v_weq0_1 0)) (= .cse2 |c_main_#res|) (= 0 .cse2) (= 1 .cse1)))))) (= |c_main_#res| (select |c_#valid| 0)) (= .cse3 |c_main_#res|) (= 0 .cse3) (not (= |c_#valid| |c_old(#valid)|)))) is different from false [2018-01-21 00:05:20,236 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:05:20,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:05:20,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 28 [2018-01-21 00:05:20,237 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:05:20,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-21 00:05:20,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-21 00:05:20,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=165, Unknown=19, NotChecked=306, Total=552 [2018-01-21 00:05:20,238 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 24 states. [2018-01-21 00:05:21,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:05:21,476 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCongruenceClosure.(WeqCongruenceClosure.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.copyWeqCc(WeqCcManager.java:1327) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.isStrongerThan(WeqCcManager.java:582) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.isStrongerThan(EqConstraint.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.isSubsetOf(EqState.java:192) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.isSubsetOf(EqState.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.getMaximalElements(DisjunctiveAbstractState.java:565) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.crossProduct(DisjunctiveAbstractState.java:407) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.intersect(DisjunctiveAbstractState.java:291) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.lambda$3(CegarAbsIntRunner.java:684) at java.util.stream.ReduceOps$2ReducingSink.accept(ReduceOps.java:123) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.reduce(ReferencePipeline.java:479) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.getOrConstructPredicateForConjunction(CegarAbsIntRunner.java:684) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1054) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:956) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:185) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:552) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:522) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-21 00:05:21,480 INFO L168 Benchmark]: Toolchain (without parser) took 16062.61 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 267.1 MB in the beginning and 700.5 MB in the end (delta: -433.4 MB). Peak memory consumption was 696.5 MB. Max. memory is 5.3 GB. [2018-01-21 00:05:21,480 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:05:21,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.80 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 255.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:05:21,481 INFO L168 Benchmark]: Boogie Preprocessor took 40.53 ms. Allocated memory is still 307.2 MB. Free memory was 255.1 MB in the beginning and 254.1 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-21 00:05:21,481 INFO L168 Benchmark]: RCFGBuilder took 359.26 ms. Allocated memory is still 307.2 MB. Free memory was 253.1 MB in the beginning and 231.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:05:21,482 INFO L168 Benchmark]: TraceAbstraction took 15435.21 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 231.1 MB in the beginning and 700.5 MB in the end (delta: -469.4 MB). Peak memory consumption was 660.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:05:21,484 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.80 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 255.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.53 ms. Allocated memory is still 307.2 MB. Free memory was 255.1 MB in the beginning and 254.1 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 359.26 ms. Allocated memory is still 307.2 MB. Free memory was 253.1 MB in the beginning and 231.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15435.21 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 231.1 MB in the beginning and 700.5 MB in the end (delta: -469.4 MB). Peak memory consumption was 660.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 10 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 310 LocStat_NO_SUPPORTING_DISEQUALITIES : 127 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 49 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.973646 RENAME_VARIABLES(MILLISECONDS) : 24.243068 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.912124 PROJECTAWAY(MILLISECONDS) : 52.175458 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.089948 DISJOIN(MILLISECONDS) : 2.837728 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 24.306825 ADD_EQUALITY(MILLISECONDS) : 0.012930 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005439 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 99 #UNFREEZE : 0 #CONJOIN : 99 #PROJECTAWAY : 79 #ADD_WEAK_EQUALITY : 23 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 97 #ADD_EQUALITY : 63 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 525]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: exitErr0EnsuresViolation CFG has 4 procedures, 67 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 13 PreInvPairs, 13 NumberOfFragments, 12 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 67 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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 - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCongruenceClosure.(WeqCongruenceClosure.java:157) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-05-21-494.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-05-21-494.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-05-21-494.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-05-21-494.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-05-21-494.csv Received shutdown request...