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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-acfac67
[2018-01-28 23:36:58,411 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-28 23:36:58,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-28 23:36:58,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-28 23:36:58,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-28 23:36:58,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-28 23:36:58,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-28 23:36:58,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-28 23:36:58,435 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-28 23:36:58,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-28 23:36:58,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-28 23:36:58,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-28 23:36:58,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-28 23:36:58,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-28 23:36:58,438 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-28 23:36:58,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-28 23:36:58,443 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-28 23:36:58,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-28 23:36:58,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-28 23:36:58,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-28 23:36:58,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-28 23:36:58,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-28 23:36:58,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-28 23:36:58,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-28 23:36:58,453 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-28 23:36:58,454 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-28 23:36:58,454 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-28 23:36:58,455 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-28 23:36:58,455 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-28 23:36:58,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-28 23:36:58,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-28 23:36:58,457 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-28 23:36:58,467 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-28 23:36:58,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-28 23:36:58,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-28 23:36:58,468 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-28 23:36:58,469 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-28 23:36:58,469 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-28 23:36:58,469 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-28 23:36:58,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-28 23:36:58,470 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-28 23:36:58,470 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-28 23:36:58,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-28 23:36:58,470 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-28 23:36:58,471 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-28 23:36:58,471 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-28 23:36:58,471 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-28 23:36:58,471 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-28 23:36:58,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-28 23:36:58,471 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-28 23:36:58,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-28 23:36:58,472 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-28 23:36:58,472 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-28 23:36:58,472 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-28 23:36:58,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-28 23:36:58,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-28 23:36:58,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-28 23:36:58,473 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-28 23:36:58,473 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-28 23:36:58,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-28 23:36:58,474 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-28 23:36:58,474 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-28 23:36:58,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-28 23:36:58,474 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-28 23:36:58,475 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-28 23:36:58,475 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-28 23:36:58,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-28 23:36:58,520 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-28 23:36:58,523 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-28 23:36:58,524 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-28 23:36:58,525 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-28 23:36:58,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i
[2018-01-28 23:36:58,683 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-28 23:36:58,691 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2018-01-28 23:36:58,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-28 23:36:58,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-28 23:36:58,700 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-28 23:36:58,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:36:58" (1/1) ...
[2018-01-28 23:36:58,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6f32fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58, skipping insertion in model container
[2018-01-28 23:36:58,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:36:58" (1/1) ...
[2018-01-28 23:36:58,724 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-28 23:36:58,767 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-28 23:36:58,890 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-28 23:36:58,907 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-28 23:36:58,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58 WrapperNode
[2018-01-28 23:36:58,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-28 23:36:58,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-28 23:36:58,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-28 23:36:58,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-28 23:36:58,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58" (1/1) ...
[2018-01-28 23:36:58,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58" (1/1) ...
[2018-01-28 23:36:58,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58" (1/1) ...
[2018-01-28 23:36:58,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58" (1/1) ...
[2018-01-28 23:36:58,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58" (1/1) ...
[2018-01-28 23:36:58,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58" (1/1) ...
[2018-01-28 23:36:58,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58" (1/1) ...
[2018-01-28 23:36:58,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-28 23:36:58,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-28 23:36:58,946 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-28 23:36:58,947 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-28 23:36:58,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58" (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-28 23:36:58,994 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-28 23:36:58,994 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-28 23:36:58,994 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace
[2018-01-28 23:36:58,995 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-28 23:36:58,995 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-28 23:36:58,995 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-28 23:36:58,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-28 23:36:58,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-28 23:36:58,995 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-28 23:36:58,996 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-28 23:36:58,996 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace
[2018-01-28 23:36:58,996 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-28 23:36:58,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-28 23:36:58,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-28 23:36:59,216 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-28 23:36:59,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:36:59 BoogieIcfgContainer
[2018-01-28 23:36:59,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-28 23:36:59,217 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2018-01-28 23:36:59,217 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2018-01-28 23:36:59,218 INFO L276 PluginConnector]: IcfgTransformer initialized
[2018-01-28 23:36:59,220 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:36:59" (1/1) ...
[2018-01-28 23:36:59,227 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning
[2018-01-28 23:36:59,227 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int]
[2018-01-28 23:36:59,228 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing
[2018-01-28 23:36:59,285 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis
[2018-01-28 23:36:59,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2)
[2018-01-28 23:37:37,882 INFO L311 AbstractInterpreter]: Visited 67 different actions 641 times. Merged at 41 different actions 435 times. Widened at 1 different actions 9 times. Found 38 fixpoints after 4 different actions. Largest state had 33 variables.
[2018-01-28 23:37:37,885 INFO L226 apSepIcfgTransformer]: finished equality analysis
[2018-01-28 23:37:37,896 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4
[2018-01-28 23:37:37,896 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning
[2018-01-28 23:37:37,896 INFO L239 apSepIcfgTransformer]: array groups: Set:
[#memory_int]
[2018-01-28 23:37:37,896 INFO L241 apSepIcfgTransformer]: select infos: Set:
((select |v_#memory_int_10| v_main_~nondetString1~5.base_5), at (SUMMARY for call write~int(0, ~nondetString1~5.base, ~nondetString1~5.offset + (~length1~5 - 1) * 1, 1); srcloc: L559))
((select |v_#memory_int_4| v_cstrreplace_~p~2.base_8), at (SUMMARY for call write~int(~new, ~p~2.base, ~p~2.offset, 1); srcloc: L546))
((select (select |v_#memory_int_1| v_cstrreplace_~p~2.base_2) v_cstrreplace_~p~2.offset_2), at (SUMMARY for call #t~mem0 := read~int(~p~2.base, ~p~2.offset, 1); srcloc: L544))
((select (select |v_#memory_int_2| v_cstrreplace_~p~2.base_5) v_cstrreplace_~p~2.offset_4), at (SUMMARY for call #t~mem1 := read~int(~p~2.base, ~p~2.offset, 1); srcloc: L545))
[2018-01-28 23:37:37,903 INFO L544 PartitionManager]: partitioning result:
[2018-01-28 23:37:37,903 INFO L549 PartitionManager]: location blocks for array group [#memory_int]
[2018-01-28 23:37:37,903 INFO L558 PartitionManager]: at dimension 0
[2018-01-28 23:37:37,903 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1
[2018-01-28 23:37:37,903 INFO L560 PartitionManager]: # location blocks :1
[2018-01-28 23:37:37,903 INFO L558 PartitionManager]: at dimension 1
[2018-01-28 23:37:37,903 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1
[2018-01-28 23:37:37,904 INFO L560 PartitionManager]: # location blocks :1
[2018-01-28 23:37:37,904 INFO L86 ransitionTransformer]: executing heap partitioning transformation
[2018-01-28 23:37:37,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:37:37 BasicIcfg
[2018-01-28 23:37:37,916 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2018-01-28 23:37:37,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-28 23:37:37,917 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-28 23:37:37,919 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-28 23:37:37,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:36:58" (1/4) ...
[2018-01-28 23:37:37,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57008085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:37:37, skipping insertion in model container
[2018-01-28 23:37:37,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:58" (2/4) ...
[2018-01-28 23:37:37,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57008085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:37:37, skipping insertion in model container
[2018-01-28 23:37:37,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:36:59" (3/4) ...
[2018-01-28 23:37:37,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57008085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:37:37, skipping insertion in model container
[2018-01-28 23:37:37,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:37:37" (4/4) ...
[2018-01-28 23:37:37,922 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg
[2018-01-28 23:37:37,972 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-28 23:37:37,978 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations.
[2018-01-28 23:37:38,006 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-28 23:37:38,006 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-28 23:37:38,006 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-28 23:37:38,007 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-28 23:37:38,007 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-28 23:37:38,007 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-28 23:37:38,007 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-28 23:37:38,007 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-28 23:37:38,008 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-28 23:37:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states.
[2018-01-28 23:37:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-28 23:37:38,022 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:37:38,023 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:37:38,023 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-01-28 23:37:38,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1586738624, now seen corresponding path program 1 times
[2018-01-28 23:37:38,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:37:38,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:37:38,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:38,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:37:38,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:37:38,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:37:38,224 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-28 23:37:38,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:37:38,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-28 23:37:38,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-28 23:37:38,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-28 23:37:38,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-28 23:37:38,237 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 5 states.
[2018-01-28 23:37:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:37:38,325 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions.
[2018-01-28 23:37:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-28 23:37:38,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9
[2018-01-28 23:37:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:37:38,338 INFO L225 Difference]: With dead ends: 76
[2018-01-28 23:37:38,338 INFO L226 Difference]: Without dead ends: 57
[2018-01-28 23:37:38,342 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2018-01-28 23:37:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2018-01-28 23:37:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2018-01-28 23:37:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2018-01-28 23:37:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions.
[2018-01-28 23:37:38,374 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9
[2018-01-28 23:37:38,374 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:37:38,374 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions.
[2018-01-28 23:37:38,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-28 23:37:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions.
[2018-01-28 23:37:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-28 23:37:38,375 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:37:38,375 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:37:38,375 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-01-28 23:37:38,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1586738622, now seen corresponding path program 1 times
[2018-01-28 23:37:38,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:37:38,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:37:38,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:38,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:37:38,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:37:38,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:37:38,407 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-28 23:37:38,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:37:38,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 23:37:38,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-28 23:37:38,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-28 23:37:38,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-28 23:37:38,409 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states.
[2018-01-28 23:37:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:37:38,485 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions.
[2018-01-28 23:37:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-28 23:37:38,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9
[2018-01-28 23:37:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:37:38,487 INFO L225 Difference]: With dead ends: 57
[2018-01-28 23:37:38,487 INFO L226 Difference]: Without dead ends: 56
[2018-01-28 23:37:38,488 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-28 23:37:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2018-01-28 23:37:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2018-01-28 23:37:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2018-01-28 23:37:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions.
[2018-01-28 23:37:38,494 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9
[2018-01-28 23:37:38,494 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:37:38,495 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions.
[2018-01-28 23:37:38,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-28 23:37:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions.
[2018-01-28 23:37:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-01-28 23:37:38,496 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:37:38,496 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:37:38,496 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-01-28 23:37:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash 830385074, now seen corresponding path program 1 times
[2018-01-28 23:37:38,496 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:37:38,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:37:38,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:38,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:37:38,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:37:38,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:37:38,572 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-28 23:37:38,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:37:38,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-28 23:37:38,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-28 23:37:38,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-28 23:37:38,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-28 23:37:38,573 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states.
[2018-01-28 23:37:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:37:38,701 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions.
[2018-01-28 23:37:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-28 23:37:38,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2018-01-28 23:37:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:37:38,703 INFO L225 Difference]: With dead ends: 60
[2018-01-28 23:37:38,703 INFO L226 Difference]: Without dead ends: 57
[2018-01-28 23:37:38,703 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-01-28 23:37:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2018-01-28 23:37:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56.
[2018-01-28 23:37:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2018-01-28 23:37:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions.
[2018-01-28 23:37:38,711 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 19
[2018-01-28 23:37:38,711 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:37:38,712 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions.
[2018-01-28 23:37:38,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-28 23:37:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions.
[2018-01-28 23:37:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-01-28 23:37:38,712 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:37:38,713 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:37:38,713 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-01-28 23:37:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 830385076, now seen corresponding path program 1 times
[2018-01-28 23:37:38,713 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:37:38,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:37:38,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:38,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:37:38,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:37:38,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:37:38,859 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-28 23:37:38,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:37:38,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-28 23:37:38,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-28 23:37:38,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-28 23:37:38,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2018-01-28 23:37:38,860 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 9 states.
[2018-01-28 23:37:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:37:39,029 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions.
[2018-01-28 23:37:39,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-28 23:37:39,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19
[2018-01-28 23:37:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:37:39,033 INFO L225 Difference]: With dead ends: 75
[2018-01-28 23:37:39,033 INFO L226 Difference]: Without dead ends: 72
[2018-01-28 23:37:39,034 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2018-01-28 23:37:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2018-01-28 23:37:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62.
[2018-01-28 23:37:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2018-01-28 23:37:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions.
[2018-01-28 23:37:39,040 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 19
[2018-01-28 23:37:39,041 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:37:39,041 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions.
[2018-01-28 23:37:39,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-28 23:37:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions.
[2018-01-28 23:37:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-28 23:37:39,041 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:37:39,041 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:37:39,042 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-01-28 23:37:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1732752207, now seen corresponding path program 1 times
[2018-01-28 23:37:39,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:37:39,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:37:39,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:39,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:37:39,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:37:39,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:37:39,128 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-28 23:37:39,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:37:39,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 23:37:39,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-28 23:37:39,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-28 23:37:39,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-28 23:37:39,129 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states.
[2018-01-28 23:37:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:37:39,227 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions.
[2018-01-28 23:37:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-28 23:37:39,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2018-01-28 23:37:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:37:39,228 INFO L225 Difference]: With dead ends: 62
[2018-01-28 23:37:39,228 INFO L226 Difference]: Without dead ends: 49
[2018-01-28 23:37:39,229 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-28 23:37:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2018-01-28 23:37:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49.
[2018-01-28 23:37:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2018-01-28 23:37:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions.
[2018-01-28 23:37:39,235 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20
[2018-01-28 23:37:39,235 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:37:39,236 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions.
[2018-01-28 23:37:39,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-28 23:37:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions.
[2018-01-28 23:37:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-01-28 23:37:39,237 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:37:39,237 INFO L330 BasicCegarLoop]: trace histogram [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-28 23:37:39,237 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-01-28 23:37:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1127193870, now seen corresponding path program 1 times
[2018-01-28 23:37:39,238 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:37:39,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:37:39,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:39,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:37:39,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:37:39,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:37:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-01-28 23:37:39,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:37:39,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-28 23:37:39,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-28 23:37:39,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-28 23:37:39,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-01-28 23:37:39,309 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states.
[2018-01-28 23:37:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:37:39,414 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions.
[2018-01-28 23:37:39,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-28 23:37:39,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29
[2018-01-28 23:37:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:37:39,416 INFO L225 Difference]: With dead ends: 49
[2018-01-28 23:37:39,416 INFO L226 Difference]: Without dead ends: 48
[2018-01-28 23:37:39,416 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2018-01-28 23:37:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-01-28 23:37:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-01-28 23:37:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-01-28 23:37:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions.
[2018-01-28 23:37:39,421 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29
[2018-01-28 23:37:39,422 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:37:39,422 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions.
[2018-01-28 23:37:39,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-28 23:37:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions.
[2018-01-28 23:37:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-01-28 23:37:39,423 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:37:39,423 INFO L330 BasicCegarLoop]: trace histogram [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-28 23:37:39,423 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-01-28 23:37:39,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1127193868, now seen corresponding path program 1 times
[2018-01-28 23:37:39,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:37:39,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:37:39,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:39,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:37:39,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:37:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-01-28 23:37:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-01-28 23:37:39,475 INFO L389 BasicCegarLoop]: Counterexample might be feasible
[2018-01-28 23:37:39,478 INFO L84 mationBacktranslator]: Skipped ATE [269] [269] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base]
[2018-01-28 23:37:39,478 INFO L84 mationBacktranslator]: Skipped ATE [275] [275] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,478 INFO L84 mationBacktranslator]: Skipped ATE [281] [281] mainENTRY-->L554: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,478 INFO L84 mationBacktranslator]: Skipped ATE [285] [285] L554-->L554': Formula: (= v_main_~length1~5_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_2|, main_~length1~5=v_main_~length1~5_2} AuxVars[] AssignedVars[main_~length1~5]
[2018-01-28 23:37:39,479 INFO L84 mationBacktranslator]: Skipped ATE [289] [289] L554'-->L555: Formula: true InVars {} OutVars{main_#t~nondet5=|v_main_#t~nondet5_3|} AuxVars[] AssignedVars[main_#t~nondet5]
[2018-01-28 23:37:39,479 INFO L84 mationBacktranslator]: Skipped ATE [293] [293] L555-->L555'': Formula: (not (< v_main_~length1~5_5 1)) InVars {main_~length1~5=v_main_~length1~5_5} OutVars{main_~length1~5=v_main_~length1~5_5} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,479 INFO L84 mationBacktranslator]: Skipped ATE [297] [297] L555''-->L558: Formula: (and (not (= 0 |v_main_#t~malloc6.base_3|)) (= |v_#valid_18| (store |v_#valid_19| |v_main_#t~malloc6.base_3| 1)) (= |v_main_#t~malloc6.offset_3| 0) (= |v_#length_10| (store |v_#length_11| |v_main_#t~malloc6.base_3| v_main_~length1~5_6)) (= 0 (select |v_#valid_19| |v_main_#t~malloc6.base_3|))) InVars {#length=|v_#length_11|, #valid=|v_#valid_19|, main_~length1~5=v_main_~length1~5_6} OutVars{#length=|v_#length_10|, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|, #valid=|v_#valid_18|, main_~length1~5=v_main_~length1~5_6} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset]
[2018-01-28 23:37:39,479 INFO L84 mationBacktranslator]: Skipped ATE [299] [299] L558-->L559: Formula: (and (= v_main_~nondetString1~5.base_4 |v_main_#t~malloc6.base_4|) (= v_main_~nondetString1~5.offset_3 |v_main_#t~malloc6.offset_4|)) InVars {main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|, main_#t~malloc6.base=|v_main_#t~malloc6.base_4|} OutVars{main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_3, main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_4} AuxVars[] AssignedVars[main_~nondetString1~5.base, main_~nondetString1~5.offset]
[2018-01-28 23:37:39,479 INFO L84 mationBacktranslator]: Skipped ATE [301] [301] L559-->L559': Formula: (let ((.cse0 (+ v_main_~length1~5_7 v_main_~nondetString1~5.offset_4))) (and (<= .cse0 (select |v_#length_12| v_main_~nondetString1~5.base_5)) (<= 1 .cse0) (= (select |v_#valid_20| v_main_~nondetString1~5.base_5) 1) (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_1|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_5, main_~length1~5=v_main_~length1~5_7, #valid=|v_#valid_20|, main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_4, #length=|v_#length_12|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_2|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_5, main_~length1~5=v_main_~length1~5_7, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_4, #length=|v_#length_12|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int]
[2018-01-28 23:37:39,479 INFO L84 mationBacktranslator]: Skipped ATE [307] [307] L559'-->L560: Formula: (and (<= 0 (+ |v_main_#t~nondet8_1| 2147483648)) (<= |v_main_#t~nondet8_1| 2147483647)) InVars {main_#t~nondet8=|v_main_#t~nondet8_1|} OutVars{main_#t~nondet8=|v_main_#t~nondet8_1|} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,480 INFO L84 mationBacktranslator]: Skipped ATE [309] [309] L560-->L560': Formula: (and (<= |v_main_#t~nondet9_1| 2147483647) (<= 0 (+ |v_main_#t~nondet9_1| 2147483648))) InVars {main_#t~nondet9=|v_main_#t~nondet9_1|} OutVars{main_#t~nondet9=|v_main_#t~nondet9_1|} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,480 INFO L84 mationBacktranslator]: Skipped ATE [313] [313] L560'-->cstrreplaceENTRY: Formula: (and (= |v_cstrreplace_#in~newInParam_1| (let ((.cse0 (mod |v_main_#t~nondet9_4| 256))) (ite (<= .cse0 127) .cse0 (+ .cse0 (- 256))))) (= |v_cstrreplace_#in~s.offsetInParam_1| v_main_~nondetString1~5.offset_5) (= |v_cstrreplace_#in~s.baseInParam_1| v_main_~nondetString1~5.base_6) (= |v_cstrreplace_#in~oldInParam_1| (let ((.cse1 (mod |v_main_#t~nondet8_4| 256))) (ite (<= .cse1 127) .cse1 (+ .cse1 (- 256)))))) InVars {main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_5, main_#t~nondet9=|v_main_#t~nondet9_4|, main_#t~nondet8=|v_main_#t~nondet8_4|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_6} OutVars{cstrreplace_#in~s.offset=|v_cstrreplace_#in~s.offsetInParam_1|, cstrreplace_#in~new=|v_cstrreplace_#in~newInParam_1|, cstrreplace_#in~old=|v_cstrreplace_#in~oldInParam_1|, cstrreplace_#in~s.base=|v_cstrreplace_#in~s.baseInParam_1|} AuxVars[] AssignedVars[cstrreplace_#in~s.offset, cstrreplace_#in~new, cstrreplace_#in~s.base, cstrreplace_#in~old]
[2018-01-28 23:37:39,480 INFO L84 mationBacktranslator]: Skipped ATE [317] [317] cstrreplaceENTRY-->L540: Formula: (and (= v_cstrreplace_~s.offset_1 |v_cstrreplace_#in~s.offset_1|) (= v_cstrreplace_~s.base_1 |v_cstrreplace_#in~s.base_1|)) InVars {cstrreplace_#in~s.offset=|v_cstrreplace_#in~s.offset_1|, cstrreplace_#in~s.base=|v_cstrreplace_#in~s.base_1|} OutVars{cstrreplace_#in~s.offset=|v_cstrreplace_#in~s.offset_1|, cstrreplace_~s.base=v_cstrreplace_~s.base_1, cstrreplace_~s.offset=v_cstrreplace_~s.offset_1, cstrreplace_#in~s.base=|v_cstrreplace_#in~s.base_1|} AuxVars[] AssignedVars[cstrreplace_~s.offset, cstrreplace_~s.base]
[2018-01-28 23:37:39,480 INFO L84 mationBacktranslator]: Skipped ATE [321] [321] L540-->L540': Formula: (= v_cstrreplace_~old_1 |v_cstrreplace_#in~old_1|) InVars {cstrreplace_#in~old=|v_cstrreplace_#in~old_1|} OutVars{cstrreplace_#in~old=|v_cstrreplace_#in~old_1|, cstrreplace_~old=v_cstrreplace_~old_1} AuxVars[] AssignedVars[cstrreplace_~old]
[2018-01-28 23:37:39,480 INFO L84 mationBacktranslator]: Skipped ATE [325] [325] L540'-->L542: Formula: (= v_cstrreplace_~new_1 |v_cstrreplace_#in~new_1|) InVars {cstrreplace_#in~new=|v_cstrreplace_#in~new_1|} OutVars{cstrreplace_#in~new=|v_cstrreplace_#in~new_1|, cstrreplace_~new=v_cstrreplace_~new_1} AuxVars[] AssignedVars[cstrreplace_~new]
[2018-01-28 23:37:39,480 INFO L84 mationBacktranslator]: Skipped ATE [329] [329] L542-->L543: Formula: (and (= v_cstrreplace_~p~2.base_1 v_cstrreplace_~s.base_2) (= v_cstrreplace_~p~2.offset_1 v_cstrreplace_~s.offset_2)) InVars {cstrreplace_~s.base=v_cstrreplace_~s.base_2, cstrreplace_~s.offset=v_cstrreplace_~s.offset_2} OutVars{cstrreplace_~s.base=v_cstrreplace_~s.base_2, cstrreplace_~s.offset=v_cstrreplace_~s.offset_2, cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_1, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_1} AuxVars[] AssignedVars[cstrreplace_~p~2.offset, cstrreplace_~p~2.base]
[2018-01-28 23:37:39,481 INFO L84 mationBacktranslator]: Skipped ATE [333] [333] L543-->L544''''': Formula: (= v_cstrreplace_~numReplaced~2_1 0) InVars {} OutVars{cstrreplace_~numReplaced~2=v_cstrreplace_~numReplaced~2_1} AuxVars[] AssignedVars[cstrreplace_~numReplaced~2]
[2018-01-28 23:37:39,481 INFO L84 mationBacktranslator]: Skipped ATE [337] [337] L544'''''-->L544: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,481 INFO L84 mationBacktranslator]: Skipped ATE [343] [343] L544-->L544': Formula: (and (<= (+ v_cstrreplace_~p~2.offset_2 1) (select |v_#length_1| v_cstrreplace_~p~2.base_2)) (<= 0 v_cstrreplace_~p~2.offset_2) (= (select (select |v_#memory_int_part_locs_0_locs_0_3| v_cstrreplace_~p~2.base_2) v_cstrreplace_~p~2.offset_2) |v_cstrreplace_#t~mem0_1|) (= 1 (select |v_#valid_3| v_cstrreplace_~p~2.base_2))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, #length=|v_#length_1|, cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_2, #valid=|v_#valid_3|, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_2} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, cstrreplace_#t~mem0=|v_cstrreplace_#t~mem0_1|, cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_2, #valid=|v_#valid_3|, #length=|v_#length_1|, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_2} AuxVars[] AssignedVars[cstrreplace_#t~mem0]
[2018-01-28 23:37:39,481 INFO L84 mationBacktranslator]: Skipped ATE [357] [357] L544'-->L544'''': Formula: (not (= 0 |v_cstrreplace_#t~mem0_4|)) InVars {cstrreplace_#t~mem0=|v_cstrreplace_#t~mem0_4|} OutVars{cstrreplace_#t~mem0=|v_cstrreplace_#t~mem0_4|} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,481 INFO L84 mationBacktranslator]: Skipped ATE [363] [363] L544''''-->L545: Formula: true InVars {} OutVars{cstrreplace_#t~mem0=|v_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[cstrreplace_#t~mem0]
[2018-01-28 23:37:39,481 INFO L84 mationBacktranslator]: Skipped ATE [365] [365] L545-->L545': Formula: (and (<= 0 v_cstrreplace_~p~2.offset_4) (= (select (select |v_#memory_int_part_locs_0_locs_0_4| v_cstrreplace_~p~2.base_5) v_cstrreplace_~p~2.offset_4) |v_cstrreplace_#t~mem1_1|) (= 1 (select |v_#valid_5| v_cstrreplace_~p~2.base_5)) (<= (+ v_cstrreplace_~p~2.offset_4 1) (select |v_#length_3| v_cstrreplace_~p~2.base_5))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, #length=|v_#length_3|, cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_4, #valid=|v_#valid_5|, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_5} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, cstrreplace_#t~mem1=|v_cstrreplace_#t~mem1_1|, cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_4, #valid=|v_#valid_5|, #length=|v_#length_3|, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_5} AuxVars[] AssignedVars[cstrreplace_#t~mem1]
[2018-01-28 23:37:39,482 INFO L84 mationBacktranslator]: Skipped ATE [373] [373] L545'-->L545'''': Formula: (not (= v_cstrreplace_~old_3 |v_cstrreplace_#t~mem1_4|)) InVars {cstrreplace_#t~mem1=|v_cstrreplace_#t~mem1_4|, cstrreplace_~old=v_cstrreplace_~old_3} OutVars{cstrreplace_#t~mem1=|v_cstrreplace_#t~mem1_4|, cstrreplace_~old=v_cstrreplace_~old_3} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,482 INFO L84 mationBacktranslator]: Skipped ATE [377] [377] L545''''-->L545''''': Formula: true InVars {} OutVars{cstrreplace_#t~mem1=|v_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[cstrreplace_#t~mem1]
[2018-01-28 23:37:39,482 INFO L84 mationBacktranslator]: Skipped ATE [385] [385] L545'''''-->L549: Formula: (and (= |v_cstrreplace_#t~post4.base_1| v_cstrreplace_~p~2.base_11) (= |v_cstrreplace_#t~post4.offset_1| v_cstrreplace_~p~2.offset_8)) InVars {cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_8, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_11} OutVars{cstrreplace_#t~post4.offset=|v_cstrreplace_#t~post4.offset_1|, cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_8, cstrreplace_#t~post4.base=|v_cstrreplace_#t~post4.base_1|, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_11} AuxVars[] AssignedVars[cstrreplace_#t~post4.offset, cstrreplace_#t~post4.base]
[2018-01-28 23:37:39,482 INFO L84 mationBacktranslator]: Skipped ATE [389] [389] L549-->L549': Formula: (and (= v_cstrreplace_~p~2.base_12 |v_cstrreplace_#t~post4.base_2|) (= v_cstrreplace_~p~2.offset_9 (+ |v_cstrreplace_#t~post4.offset_2| 1))) InVars {cstrreplace_#t~post4.offset=|v_cstrreplace_#t~post4.offset_2|, cstrreplace_#t~post4.base=|v_cstrreplace_#t~post4.base_2|} OutVars{cstrreplace_#t~post4.offset=|v_cstrreplace_#t~post4.offset_2|, cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_9, cstrreplace_#t~post4.base=|v_cstrreplace_#t~post4.base_2|, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_12} AuxVars[] AssignedVars[cstrreplace_~p~2.offset, cstrreplace_~p~2.base]
[2018-01-28 23:37:39,482 INFO L84 mationBacktranslator]: Skipped ATE [393] [393] L549'-->L544''''': Formula: true InVars {} OutVars{cstrreplace_#t~post4.offset=|v_cstrreplace_#t~post4.offset_3|, cstrreplace_#t~post4.base=|v_cstrreplace_#t~post4.base_3|} AuxVars[] AssignedVars[cstrreplace_#t~post4.offset, cstrreplace_#t~post4.base]
[2018-01-28 23:37:39,482 INFO L84 mationBacktranslator]: Skipped ATE [337] [337] L544'''''-->L544: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,483 INFO L84 mationBacktranslator]: Skipped ATE [347] [347] L544-->cstrreplaceErr1RequiresViolation: Formula: (or (not (<= (+ v_cstrreplace_~p~2.offset_3 1) (select |v_#length_2| v_cstrreplace_~p~2.base_4))) (not (<= 0 v_cstrreplace_~p~2.offset_3))) InVars {#length=|v_#length_2|, cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_3, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_4} OutVars{#length=|v_#length_2|, cstrreplace_~p~2.offset=v_cstrreplace_~p~2.offset_3, cstrreplace_~p~2.base=v_cstrreplace_~p~2.base_4} AuxVars[] AssignedVars[]
[2018-01-28 23:37:39,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:37:39 BasicIcfg
[2018-01-28 23:37:39,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-28 23:37:39,489 INFO L168 Benchmark]: Toolchain (without parser) took 40805.33 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 264.6 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 146.5 MB. Max. memory is 5.3 GB.
[2018-01-28 23:37:39,490 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-28 23:37:39,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.01 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
[2018-01-28 23:37:39,491 INFO L168 Benchmark]: Boogie Preprocessor took 32.69 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-28 23:37:39,491 INFO L168 Benchmark]: RCFGBuilder took 269.99 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 234.0 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 5.3 GB.
[2018-01-28 23:37:39,491 INFO L168 Benchmark]: IcfgTransformer took 38699.85 ms. Allocated memory was 304.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 234.0 MB in the beginning and 470.5 MB in the end (delta: -236.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB.
[2018-01-28 23:37:39,492 INFO L168 Benchmark]: TraceAbstraction took 1571.32 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 119.5 MB). Free memory was 470.5 MB in the beginning and 2.1 GB in the end (delta: -1.6 GB). There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-28 23:37:39,493 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.22 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 221.01 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 32.69 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 269.99 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 234.0 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 5.3 GB.
* IcfgTransformer took 38699.85 ms. Allocated memory was 304.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 234.0 MB in the beginning and 470.5 MB in the end (delta: -236.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB.
* TraceAbstraction took 1571.32 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 119.5 MB). Free memory was 470.5 MB in the beginning and 2.1 GB in the end (delta: -1.6 GB). There was no memory consumed. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2:
- StatisticsResult: ArrayEqualityDomainStatistics
#Locations : 56
LocStat_MAX_WEQGRAPH_SIZE : 4
LocStat_MAX_SIZEOF_WEQEDGELABEL : 2
LocStat_NO_SUPPORTING_EQUALITIES : 675
LocStat_NO_SUPPORTING_DISEQUALITIES : 148
LocStat_NO_DISJUNCTIONS : -112
LocStat_MAX_NO_DISJUNCTIONS : -1
#Transitions : 76
TransStat_MAX_WEQGRAPH_SIZE : 2
TransStat_MAX_SIZEOF_WEQEDGELABEL : 1
TransStat_NO_SUPPORTING_EQUALITIES : 86
TransStat_NO_SUPPORTING_DISEQUALITIES : 9
TransStat_NO_DISJUNCTIONS : 79
TransStat_MAX_NO_DISJUNCTIONS : 2
- StatisticsResult: EqConstraintFactoryStatistics
CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.014865
RENAME_VARIABLES(MILLISECONDS) : 0.656714
UNFREEZE(MILLISECONDS) : 0.000000
CONJOIN(MILLISECONDS) : 0.000793
PROJECTAWAY(MILLISECONDS) : 1.441494
ADD_WEAK_EQUALITY(MILLISECONDS) : 0.057979
DISJOIN(MILLISECONDS) : 0.511327
RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.673312
ADD_EQUALITY(MILLISECONDS) : 0.119798
DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000
ADD_DISEQUALITY(MILLISECONDS) : 0.019112
#CONJOIN_DISJUNCTIVE : 1097
#RENAME_VARIABLES : 2401
#UNFREEZE : 0
#CONJOIN : 1443
#PROJECTAWAY : 1357
#ADD_WEAK_EQUALITY : 8
#DISJOIN : 273
#RENAME_VARIABLES_DISJUNCTIVE : 2332
#ADD_EQUALITY : 88
#DISJOIN_DISJUNCTIVE : 0
#ADD_DISEQUALITY : 8
* Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation:
- StatisticsResult: HeapSeparatorStatistics
COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1
COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1
COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1
COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1
COUNT_ARRAY_READS for [#memory_int] : 4
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 1]: pointer dereference may fail
pointer dereference may fail
We found a FailurePath:
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 61 locations, 9 error locations. UNSAFE Result, 1.4s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 287 SDtfs, 367 SDslu, 540 SDs, 0 SdLazy, 294 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=4, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 9365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-28_23-37-39-500.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-28_23-37-39-500.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-28_23-37-39-500.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-28_23-37-39-500.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_23-37-39-500.csv
Received shutdown request...