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/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 23:29:03,785 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:29:03,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:29:03,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:29:03,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:29:03,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:29:03,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:29:03,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:29:03,806 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:29:03,807 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:29:03,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:29:03,808 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:29:03,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:29:03,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:29:03,811 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:29:03,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:29:03,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:29:03,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:29:03,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:29:03,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:29:03,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:29:03,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:29:03,822 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:29:03,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:29:03,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:29:03,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:29:03,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:29:03,826 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:29:03,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:29:03,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:29:03,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:29:03,827 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:29:03,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:29:03,836 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:29:03,836 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:29:03,836 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:29:03,837 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:29:03,837 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:29:03,837 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:29:03,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:29:03,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:29:03,838 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:29:03,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:29:03,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:29:03,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:29:03,838 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:29:03,838 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:29:03,838 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:29:03,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:29:03,839 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:29:03,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:29:03,839 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:29:03,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:29:03,839 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:29:03,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:29:03,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:29:03,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:29:03,840 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:29:03,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:29:03,840 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:29:03,840 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:29:03,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:29:03,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:29:03,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:29:03,841 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:29:03,841 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:29:03,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:29:03,883 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:29:03,886 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:29:03,887 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:29:03,888 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:29:03,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 23:29:04,034 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:29:04,039 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:29:04,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:29:04,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:29:04,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:29:04,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5e2bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04, skipping insertion in model container [2018-01-28 23:29:04,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,062 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:29:04,098 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:29:04,216 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:29:04,233 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:29:04,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04 WrapperNode [2018-01-28 23:29:04,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:29:04,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:29:04,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:29:04,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:29:04,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:29:04,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:29:04,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:29:04,272 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:29:04,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04" (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:29:04,321 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:29:04,321 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:29:04,322 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-01-28 23:29:04,322 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:29:04,322 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:29:04,322 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:29:04,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:29:04,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:29:04,322 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:29:04,322 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 23:29:04,322 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-01-28 23:29:04,323 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:29:04,323 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:29:04,323 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:29:04,536 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:29:04,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:29:04 BoogieIcfgContainer [2018-01-28 23:29:04,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:29:04,537 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:29:04,537 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:29:04,538 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:29:04,540 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:29:04" (1/1) ... [2018-01-28 23:29:04,547 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:29:04,547 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:29:04,549 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:29:04,598 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:29:04,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:29:28,739 INFO L311 AbstractInterpreter]: Visited 65 different actions 361 times. Merged at 40 different actions 198 times. Never widened. Found 21 fixpoints after 4 different actions. Largest state had 34 variables. [2018-01-28 23:29:28,741 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:29:28,751 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 3 [2018-01-28 23:29:28,752 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:29:28,752 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:29:28,752 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_9| v_cstpcpy_~to.base_6), at (SUMMARY for call write~int(#t~mem3, ~to.base, ~to.offset, 1); srcloc: L542')) ((select |v_#memory_int_4| v_main_~nondetString~4.base_2), at (SUMMARY for call write~int(0, ~nondetString~4.base, ~nondetString~4.offset + (~length2~4 - 1) * 1, 1); srcloc: L557)) ((select (select |v_#memory_int_7| v_cstpcpy_~from.base_5) v_cstpcpy_~from.offset_5), at (SUMMARY for call #t~mem3 := read~int(~from.base, ~from.offset, 1); srcloc: L542)) [2018-01-28 23:29:28,764 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:29:28,764 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:29:28,765 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:29:28,765 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:29:28,765 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:29:28,765 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:29:28,765 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:29:28,765 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:29:28,766 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:29:28,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:29:28 BasicIcfg [2018-01-28 23:29:28,781 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:29:28,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:29:28,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:29:28,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:29:28,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:29:04" (1/4) ... [2018-01-28 23:29:28,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4779d8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:29:28, skipping insertion in model container [2018-01-28 23:29:28,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:29:04" (2/4) ... [2018-01-28 23:29:28,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4779d8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:29:28, skipping insertion in model container [2018-01-28 23:29:28,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:29:04" (3/4) ... [2018-01-28 23:29:28,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4779d8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:29:28, skipping insertion in model container [2018-01-28 23:29:28,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:29:28" (4/4) ... [2018-01-28 23:29:28,788 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:29:28,857 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:29:28,862 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-28 23:29:28,889 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:29:28,889 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:29:28,889 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:29:28,890 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:29:28,890 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:29:28,890 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:29:28,890 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:29:28,890 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:29:28,891 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:29:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-28 23:29:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-28 23:29:28,904 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:29:28,905 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:29:28,905 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 23:29:28,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1564575298, now seen corresponding path program 1 times [2018-01-28 23:29:28,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:29:28,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:29:28,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:28,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:29:28,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:29:28,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:29:29,049 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:29:29,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:29:29,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 23:29:29,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 23:29:29,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 23:29:29,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 23:29:29,061 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2018-01-28 23:29:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:29:29,138 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-01-28 23:29:29,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 23:29:29,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-28 23:29:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:29:29,149 INFO L225 Difference]: With dead ends: 73 [2018-01-28 23:29:29,150 INFO L226 Difference]: Without dead ends: 54 [2018-01-28 23:29:29,152 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 23:29:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-28 23:29:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-28 23:29:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-28 23:29:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-28 23:29:29,183 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 13 [2018-01-28 23:29:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:29:29,183 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-28 23:29:29,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 23:29:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-28 23:29:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:29:29,184 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:29:29,184 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:29:29,185 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 23:29:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1218128737, now seen corresponding path program 1 times [2018-01-28 23:29:29,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:29:29,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:29:29,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:29:29,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:29:29,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:29:29,254 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:29:29,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:29:29,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:29:29,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:29:29,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:29:29,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:29:29,258 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-01-28 23:29:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:29:29,327 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-28 23:29:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:29:29,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 23:29:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:29:29,329 INFO L225 Difference]: With dead ends: 54 [2018-01-28 23:29:29,329 INFO L226 Difference]: Without dead ends: 53 [2018-01-28 23:29:29,330 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:29:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-28 23:29:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-28 23:29:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 23:29:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-28 23:29:29,336 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2018-01-28 23:29:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:29:29,337 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-28 23:29:29,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:29:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-28 23:29:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:29:29,338 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:29:29,338 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:29:29,338 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 23:29:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1218128735, now seen corresponding path program 1 times [2018-01-28 23:29:29,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:29:29,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:29:29,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:29:29,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:29:29,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:29:29,425 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:29:29,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:29:29,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:29:29,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:29:29,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:29:29,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:29:29,426 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2018-01-28 23:29:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:29:29,476 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-01-28 23:29:29,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:29:29,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-28 23:29:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:29:29,477 INFO L225 Difference]: With dead ends: 53 [2018-01-28 23:29:29,477 INFO L226 Difference]: Without dead ends: 52 [2018-01-28 23:29:29,477 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:29:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-28 23:29:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-28 23:29:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-28 23:29:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-28 23:29:29,482 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-01-28 23:29:29,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:29:29,482 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-28 23:29:29,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:29:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-28 23:29:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 23:29:29,483 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:29:29,483 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, 1] [2018-01-28 23:29:29,483 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 23:29:29,483 INFO L82 PathProgramCache]: Analyzing trace with hash 688133654, now seen corresponding path program 1 times [2018-01-28 23:29:29,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:29:29,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:29:29,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:29:29,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:29:29,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:29:29,531 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:29:29,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:29:29,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:29:29,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:29:29,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:29:29,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:29:29,532 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-01-28 23:29:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:29:29,608 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-01-28 23:29:29,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 23:29:29,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-28 23:29:29,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:29:29,610 INFO L225 Difference]: With dead ends: 52 [2018-01-28 23:29:29,610 INFO L226 Difference]: Without dead ends: 51 [2018-01-28 23:29:29,611 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:29:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-28 23:29:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-28 23:29:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-28 23:29:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-28 23:29:29,617 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 21 [2018-01-28 23:29:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:29:29,617 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-28 23:29:29,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:29:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-28 23:29:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 23:29:29,618 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:29:29,618 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, 1] [2018-01-28 23:29:29,618 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 23:29:29,619 INFO L82 PathProgramCache]: Analyzing trace with hash 688133656, now seen corresponding path program 1 times [2018-01-28 23:29:29,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:29:29,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:29:29,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:29:29,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:29:29,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:29:29,720 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:29:29,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:29:29,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 23:29:29,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 23:29:29,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 23:29:29,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:29:29,721 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 8 states. [2018-01-28 23:29:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:29:29,829 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-28 23:29:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:29:29,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-28 23:29:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:29:29,834 INFO L225 Difference]: With dead ends: 65 [2018-01-28 23:29:29,834 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 23:29:29,835 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:29:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 23:29:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-01-28 23:29:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 23:29:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-28 23:29:29,842 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 21 [2018-01-28 23:29:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:29:29,843 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-28 23:29:29,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 23:29:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-28 23:29:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 23:29:29,844 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:29:29,844 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, 1, 1] [2018-01-28 23:29:29,844 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 23:29:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash -142692911, now seen corresponding path program 1 times [2018-01-28 23:29:29,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:29:29,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:29:29,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:29:29,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:29:29,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:29:29,934 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:29:29,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:29:29,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 23:29:29,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 23:29:29,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 23:29:29,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:29:29,935 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 8 states. [2018-01-28 23:29:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:29:30,053 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-01-28 23:29:30,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:29:30,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-28 23:29:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:29:30,054 INFO L225 Difference]: With dead ends: 53 [2018-01-28 23:29:30,055 INFO L226 Difference]: Without dead ends: 52 [2018-01-28 23:29:30,055 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:29:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-28 23:29:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-28 23:29:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-28 23:29:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-28 23:29:30,060 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 22 [2018-01-28 23:29:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:29:30,061 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-28 23:29:30,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 23:29:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-28 23:29:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 23:29:30,062 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:29:30,062 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, 1, 1] [2018-01-28 23:29:30,062 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 23:29:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash -142692909, now seen corresponding path program 1 times [2018-01-28 23:29:30,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:29:30,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:29:30,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:30,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:29:30,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:29:30,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:29:30,185 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:29:30,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:29:30,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 23:29:30,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 23:29:30,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 23:29:30,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:29:30,187 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-01-28 23:29:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:29:30,315 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-28 23:29:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:29:30,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-28 23:29:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:29:30,317 INFO L225 Difference]: With dead ends: 65 [2018-01-28 23:29:30,317 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 23:29:30,317 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-28 23:29:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 23:29:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-01-28 23:29:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 23:29:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-28 23:29:30,323 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 22 [2018-01-28 23:29:30,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:29:30,324 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-28 23:29:30,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 23:29:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-28 23:29:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 23:29:30,324 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:29:30,324 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, 1, 1, 1, 1] [2018-01-28 23:29:30,325 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 23:29:30,325 INFO L82 PathProgramCache]: Analyzing trace with hash -713751941, now seen corresponding path program 1 times [2018-01-28 23:29:30,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:29:30,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:29:30,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:30,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:29:30,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:29:30,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:29:30,412 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:29:30,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:29:30,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:29:30,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:29:30,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:29:30,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:29:30,413 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2018-01-28 23:29:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:29:30,520 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-01-28 23:29:30,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:29:30,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 23:29:30,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:29:30,521 INFO L225 Difference]: With dead ends: 53 [2018-01-28 23:29:30,521 INFO L226 Difference]: Without dead ends: 41 [2018-01-28 23:29:30,522 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:29:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-28 23:29:30,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-28 23:29:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-28 23:29:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-28 23:29:30,527 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2018-01-28 23:29:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:29:30,528 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-28 23:29:30,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:29:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-28 23:29:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 23:29:30,529 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:29:30,529 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, 1, 1, 1] [2018-01-28 23:29:30,529 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-28 23:29:30,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1452870205, now seen corresponding path program 1 times [2018-01-28 23:29:30,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:29:30,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:29:30,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:30,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:29:30,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:29:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:29:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:29:30,581 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:29:30,584 INFO L84 mationBacktranslator]: Skipped ATE [261] [261] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-28 23:29:30,584 INFO L84 mationBacktranslator]: Skipped ATE [267] [267] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:29:30,585 INFO L84 mationBacktranslator]: Skipped ATE [273] [273] mainENTRY-->L546: Formula: (and (<= 0 (+ |v_main_#t~nondet4_1| 2147483648)) (<= |v_main_#t~nondet4_1| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] [2018-01-28 23:29:30,585 INFO L84 mationBacktranslator]: Skipped ATE [277] [277] L546-->L546': Formula: (= v_main_~length1~4_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_2|, main_~length1~4=v_main_~length1~4_1} AuxVars[] AssignedVars[main_~length1~4] [2018-01-28 23:29:30,585 INFO L84 mationBacktranslator]: Skipped ATE [281] [281] L546'-->L547: Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_3|} AuxVars[] AssignedVars[main_#t~nondet4] [2018-01-28 23:29:30,585 INFO L84 mationBacktranslator]: Skipped ATE [283] [283] L547-->L547': 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:29:30,585 INFO L84 mationBacktranslator]: Skipped ATE [285] [285] L547'-->L547'': Formula: (= v_main_~length2~4_1 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_2|, main_~length2~4=v_main_~length2~4_1} AuxVars[] AssignedVars[main_~length2~4] [2018-01-28 23:29:30,585 INFO L84 mationBacktranslator]: Skipped ATE [287] [287] L547''-->L548: Formula: true InVars {} OutVars{main_#t~nondet5=|v_main_#t~nondet5_3|} AuxVars[] AssignedVars[main_#t~nondet5] [2018-01-28 23:29:30,585 INFO L84 mationBacktranslator]: Skipped ATE [291] [291] L548-->L548'': Formula: (not (< v_main_~length1~4_4 1)) InVars {main_~length1~4=v_main_~length1~4_4} OutVars{main_~length1~4=v_main_~length1~4_4} AuxVars[] AssignedVars[] [2018-01-28 23:29:30,585 INFO L84 mationBacktranslator]: Skipped ATE [297] [297] L548''-->L551': Formula: (not (< v_main_~length2~4_4 1)) InVars {main_~length2~4=v_main_~length2~4_4} OutVars{main_~length2~4=v_main_~length2~4_4} AuxVars[] AssignedVars[] [2018-01-28 23:29:30,585 INFO L84 mationBacktranslator]: Skipped ATE [303] [303] L551'-->L555: Formula: (not (< v_main_~length1~4_6 v_main_~length2~4_6)) InVars {main_~length2~4=v_main_~length2~4_6, main_~length1~4=v_main_~length1~4_6} OutVars{main_~length2~4=v_main_~length2~4_6, main_~length1~4=v_main_~length1~4_6} AuxVars[] AssignedVars[] [2018-01-28 23:29:30,586 INFO L84 mationBacktranslator]: Skipped ATE [307] [307] L555-->L555': Formula: (and (not (= 0 |v_main_#t~malloc6.base_1|)) (= |v_#valid_7| (store |v_#valid_8| |v_main_#t~malloc6.base_1| 1)) (= |v_main_#t~malloc6.offset_1| 0) (= |v_#length_3| (store |v_#length_4| |v_main_#t~malloc6.base_1| v_main_~length1~4_7)) (= 0 (select |v_#valid_8| |v_main_#t~malloc6.base_1|))) InVars {#length=|v_#length_4|, main_~length1~4=v_main_~length1~4_7, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~length1~4=v_main_~length1~4_7, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] [2018-01-28 23:29:30,586 INFO L84 mationBacktranslator]: Skipped ATE [313] [313] L555'-->L556: Formula: (and (= v_main_~nondetArea~4.base_1 |v_main_#t~malloc6.base_2|) (= v_main_~nondetArea~4.offset_1 |v_main_#t~malloc6.offset_2|)) InVars {main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, main_#t~malloc6.base=|v_main_#t~malloc6.base_2|} OutVars{main_~nondetArea~4.base=v_main_~nondetArea~4.base_1, main_~nondetArea~4.offset=v_main_~nondetArea~4.offset_1, main_#t~malloc6.base=|v_main_#t~malloc6.base_2|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|} AuxVars[] AssignedVars[main_~nondetArea~4.base, main_~nondetArea~4.offset] [2018-01-28 23:29:30,586 INFO L84 mationBacktranslator]: Skipped ATE [315] [315] L556-->L556': Formula: (and (= |v_#length_5| (store |v_#length_6| |v_main_#t~malloc7.base_1| v_main_~length2~4_7)) (= (store |v_#valid_10| |v_main_#t~malloc7.base_1| 1) |v_#valid_9|) (not (= |v_main_#t~malloc7.base_1| 0)) (= 0 (select |v_#valid_10| |v_main_#t~malloc7.base_1|)) (= |v_main_#t~malloc7.offset_1| 0)) InVars {main_~length2~4=v_main_~length2~4_7, #length=|v_#length_6|, #valid=|v_#valid_10|} OutVars{main_~length2~4=v_main_~length2~4_7, #length=|v_#length_5|, main_#t~malloc7.base=|v_main_#t~malloc7.base_1|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_1|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[main_#t~malloc7.offset, #valid, #length, main_#t~malloc7.base] [2018-01-28 23:29:30,586 INFO L84 mationBacktranslator]: Skipped ATE [317] [317] L556'-->L557: Formula: (and (= v_main_~nondetString~4.offset_1 |v_main_#t~malloc7.offset_2|) (= v_main_~nondetString~4.base_1 |v_main_#t~malloc7.base_2|)) InVars {main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, main_#t~malloc7.base=|v_main_#t~malloc7.base_2|} OutVars{main_~nondetString~4.base=v_main_~nondetString~4.base_1, main_#t~malloc7.base=|v_main_#t~malloc7.base_2|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, main_~nondetString~4.offset=v_main_~nondetString~4.offset_1} AuxVars[] AssignedVars[main_~nondetString~4.base, main_~nondetString~4.offset] [2018-01-28 23:29:30,586 INFO L84 mationBacktranslator]: Skipped ATE [319] [319] L557-->L557': Formula: (let ((.cse0 (+ v_main_~nondetString~4.offset_2 v_main_~length2~4_8))) (and (<= 1 .cse0) (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|) (<= .cse0 (select |v_#length_7| v_main_~nondetString~4.base_2)) (= 1 (select |v_#valid_11| v_main_~nondetString~4.base_2)))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_1|, main_~nondetString~4.base=v_main_~nondetString~4.base_2, main_~nondetString~4.offset=v_main_~nondetString~4.offset_2, #valid=|v_#valid_11|, main_~length2~4=v_main_~length2~4_8, #length=|v_#length_7|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_2|, main_~nondetString~4.base=v_main_~nondetString~4.base_2, main_~nondetString~4.offset=v_main_~nondetString~4.offset_2, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, main_~length2~4=v_main_~length2~4_8, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:29:30,586 INFO L84 mationBacktranslator]: Skipped ATE [327] [327] L557'-->cstpcpyENTRY: Formula: (and (= |v_cstpcpy_#in~from.offsetInParam_1| v_main_~nondetString~4.offset_5) (= |v_cstpcpy_#in~to.offsetInParam_1| v_main_~nondetArea~4.offset_3) (= |v_cstpcpy_#in~from.baseInParam_1| v_main_~nondetString~4.base_6) (= |v_cstpcpy_#in~to.baseInParam_1| v_main_~nondetArea~4.base_3)) InVars {main_~nondetArea~4.base=v_main_~nondetArea~4.base_3, main_~nondetArea~4.offset=v_main_~nondetArea~4.offset_3, main_~nondetString~4.base=v_main_~nondetString~4.base_6, main_~nondetString~4.offset=v_main_~nondetString~4.offset_5} OutVars{cstpcpy_#in~to.base=|v_cstpcpy_#in~to.baseInParam_1|, cstpcpy_#in~from.offset=|v_cstpcpy_#in~from.offsetInParam_1|, cstpcpy_#in~to.offset=|v_cstpcpy_#in~to.offsetInParam_1|, cstpcpy_#in~from.base=|v_cstpcpy_#in~from.baseInParam_1|} AuxVars[] AssignedVars[cstpcpy_#in~to.base, cstpcpy_#in~from.offset, cstpcpy_#in~to.offset, cstpcpy_#in~from.base] [2018-01-28 23:29:30,586 INFO L84 mationBacktranslator]: Skipped ATE [331] [331] cstpcpyENTRY-->L540: Formula: (and (= v_cstpcpy_~to.base_5 |v_cstpcpy_#in~to.base_1|) (= v_cstpcpy_~to.offset_5 |v_cstpcpy_#in~to.offset_1|)) InVars {cstpcpy_#in~to.offset=|v_cstpcpy_#in~to.offset_1|, cstpcpy_#in~to.base=|v_cstpcpy_#in~to.base_1|} OutVars{cstpcpy_~to.offset=v_cstpcpy_~to.offset_5, cstpcpy_#in~to.base=|v_cstpcpy_#in~to.base_1|, cstpcpy_#in~to.offset=|v_cstpcpy_#in~to.offset_1|, cstpcpy_~to.base=v_cstpcpy_~to.base_5} AuxVars[] AssignedVars[cstpcpy_~to.offset, cstpcpy_~to.base] [2018-01-28 23:29:30,586 INFO L84 mationBacktranslator]: Skipped ATE [335] [335] L540-->L542'''''''''''': Formula: (and (= v_cstpcpy_~from.offset_4 |v_cstpcpy_#in~from.offset_1|) (= v_cstpcpy_~from.base_4 |v_cstpcpy_#in~from.base_1|)) InVars {cstpcpy_#in~from.offset=|v_cstpcpy_#in~from.offset_1|, cstpcpy_#in~from.base=|v_cstpcpy_#in~from.base_1|} OutVars{cstpcpy_~from.offset=v_cstpcpy_~from.offset_4, cstpcpy_~from.base=v_cstpcpy_~from.base_4, cstpcpy_#in~from.offset=|v_cstpcpy_#in~from.offset_1|, cstpcpy_#in~from.base=|v_cstpcpy_#in~from.base_1|} AuxVars[] AssignedVars[cstpcpy_~from.offset, cstpcpy_~from.base] [2018-01-28 23:29:30,586 INFO L84 mationBacktranslator]: Skipped ATE [339] [339] L542''''''''''''-->L542: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [345] [345] L542-->L542': Formula: (and (<= 0 v_cstpcpy_~from.offset_5) (= (select |v_#valid_19| v_cstpcpy_~from.base_5) 1) (= |v_cstpcpy_#t~mem3_3| (select (select |v_#memory_int_part_locs_0_locs_0_3| v_cstpcpy_~from.base_5) v_cstpcpy_~from.offset_5)) (<= (+ v_cstpcpy_~from.offset_5 1) (select |v_#length_9| v_cstpcpy_~from.base_5))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, cstpcpy_~from.offset=v_cstpcpy_~from.offset_5, cstpcpy_~from.base=v_cstpcpy_~from.base_5, #length=|v_#length_9|, #valid=|v_#valid_19|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, cstpcpy_#t~mem3=|v_cstpcpy_#t~mem3_3|, cstpcpy_~from.offset=v_cstpcpy_~from.offset_5, cstpcpy_~from.base=v_cstpcpy_~from.base_5, #valid=|v_#valid_19|, #length=|v_#length_9|} AuxVars[] AssignedVars[cstpcpy_#t~mem3] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [355] [355] L542'-->L542'': Formula: (and (= |v_#memory_int_part_locs_0_locs_0_4| |v_#memory_int_part_locs_0_locs_0_5|) (<= (+ v_cstpcpy_~to.offset_6 1) (select |v_#length_11| v_cstpcpy_~to.base_6)) (= 1 (select |v_#valid_21| v_cstpcpy_~to.base_6)) (<= 0 v_cstpcpy_~to.offset_6)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, cstpcpy_~to.offset=v_cstpcpy_~to.offset_6, #length=|v_#length_11|, #valid=|v_#valid_21|, cstpcpy_~to.base=v_cstpcpy_~to.base_6} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, cstpcpy_~to.offset=v_cstpcpy_~to.offset_6, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, #length=|v_#length_11|, cstpcpy_~to.base=v_cstpcpy_~to.base_6} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [367] [367] L542''-->L542''''': Formula: (not (= |v_cstpcpy_#t~mem3_1| 0)) InVars {cstpcpy_#t~mem3=|v_cstpcpy_#t~mem3_1|} OutVars{cstpcpy_#t~mem3=|v_cstpcpy_#t~mem3_1|} AuxVars[] AssignedVars[] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [371] [371] L542'''''-->L542'''''': Formula: true InVars {} OutVars{cstpcpy_#t~mem3=|v_cstpcpy_#t~mem3_2|} AuxVars[] AssignedVars[cstpcpy_#t~mem3] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [373] [373] L542''''''-->L542''''''': Formula: (and (= |v_cstpcpy_#t~pre0.base_1| v_cstpcpy_~from.base_1) (= |v_cstpcpy_#t~pre0.offset_1| (+ v_cstpcpy_~from.offset_1 1))) InVars {cstpcpy_~from.offset=v_cstpcpy_~from.offset_1, cstpcpy_~from.base=v_cstpcpy_~from.base_1} OutVars{cstpcpy_~from.offset=v_cstpcpy_~from.offset_1, cstpcpy_~from.base=v_cstpcpy_~from.base_1, cstpcpy_#t~pre0.offset=|v_cstpcpy_#t~pre0.offset_1|, cstpcpy_#t~pre0.base=|v_cstpcpy_#t~pre0.base_1|} AuxVars[] AssignedVars[cstpcpy_#t~pre0.offset, cstpcpy_#t~pre0.base] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [375] [375] L542'''''''-->L542'''''''': Formula: (and (= v_cstpcpy_~from.base_2 v_cstpcpy_~from.base_3) (= v_cstpcpy_~from.offset_2 (+ v_cstpcpy_~from.offset_3 1))) InVars {cstpcpy_~from.offset=v_cstpcpy_~from.offset_3, cstpcpy_~from.base=v_cstpcpy_~from.base_3} OutVars{cstpcpy_~from.offset=v_cstpcpy_~from.offset_2, cstpcpy_~from.base=v_cstpcpy_~from.base_2} AuxVars[] AssignedVars[cstpcpy_~from.offset, cstpcpy_~from.base] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [377] [377] L542''''''''-->L542''''''''': Formula: true InVars {} OutVars{cstpcpy_#t~pre0.offset=|v_cstpcpy_#t~pre0.offset_2|, cstpcpy_#t~pre0.base=|v_cstpcpy_#t~pre0.base_2|} AuxVars[] AssignedVars[cstpcpy_#t~pre0.offset, cstpcpy_#t~pre0.base] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [379] [379] L542'''''''''-->L542'''''''''': Formula: (and (= |v_cstpcpy_#t~pre1.offset_1| (+ v_cstpcpy_~to.offset_1 1)) (= |v_cstpcpy_#t~pre1.base_1| v_cstpcpy_~to.base_1)) InVars {cstpcpy_~to.offset=v_cstpcpy_~to.offset_1, cstpcpy_~to.base=v_cstpcpy_~to.base_1} OutVars{cstpcpy_~to.offset=v_cstpcpy_~to.offset_1, cstpcpy_#t~pre1.offset=|v_cstpcpy_#t~pre1.offset_1|, cstpcpy_#t~pre1.base=|v_cstpcpy_#t~pre1.base_1|, cstpcpy_~to.base=v_cstpcpy_~to.base_1} AuxVars[] AssignedVars[cstpcpy_#t~pre1.offset, cstpcpy_#t~pre1.base] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [381] [381] L542''''''''''-->L542''''''''''': Formula: (and (= v_cstpcpy_~to.base_2 v_cstpcpy_~to.base_3) (= v_cstpcpy_~to.offset_2 (+ v_cstpcpy_~to.offset_3 1))) InVars {cstpcpy_~to.offset=v_cstpcpy_~to.offset_3, cstpcpy_~to.base=v_cstpcpy_~to.base_3} OutVars{cstpcpy_~to.offset=v_cstpcpy_~to.offset_2, cstpcpy_~to.base=v_cstpcpy_~to.base_2} AuxVars[] AssignedVars[cstpcpy_~to.offset, cstpcpy_~to.base] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [383] [383] L542'''''''''''-->L542'''''''''''': Formula: true InVars {} OutVars{cstpcpy_#t~pre1.offset=|v_cstpcpy_#t~pre1.offset_2|, cstpcpy_#t~pre1.base=|v_cstpcpy_#t~pre1.base_2|} AuxVars[] AssignedVars[cstpcpy_#t~pre1.offset, cstpcpy_#t~pre1.base] [2018-01-28 23:29:30,587 INFO L84 mationBacktranslator]: Skipped ATE [339] [339] L542''''''''''''-->L542: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:29:30,588 INFO L84 mationBacktranslator]: Skipped ATE [349] [349] L542-->cstpcpyErr1RequiresViolation: Formula: (or (not (<= (+ v_cstpcpy_~from.offset_6 1) (select |v_#length_10| v_cstpcpy_~from.base_7))) (not (<= 0 v_cstpcpy_~from.offset_6))) InVars {cstpcpy_~from.offset=v_cstpcpy_~from.offset_6, cstpcpy_~from.base=v_cstpcpy_~from.base_7, #length=|v_#length_10|} OutVars{cstpcpy_~from.offset=v_cstpcpy_~from.offset_6, cstpcpy_~from.base=v_cstpcpy_~from.base_7, #length=|v_#length_10|} AuxVars[] AssignedVars[] [2018-01-28 23:29:30,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:29:30 BasicIcfg [2018-01-28 23:29:30,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:29:30,593 INFO L168 Benchmark]: Toolchain (without parser) took 26558.70 ms. Allocated memory was 301.5 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 261.5 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 198.5 MB. Max. memory is 5.3 GB. [2018-01-28 23:29:30,594 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:29:30,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.97 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:29:30,594 INFO L168 Benchmark]: Boogie Preprocessor took 30.02 ms. Allocated memory is still 301.5 MB. Free memory was 250.5 MB in the beginning and 248.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:29:30,595 INFO L168 Benchmark]: RCFGBuilder took 265.15 ms. Allocated memory is still 301.5 MB. Free memory was 248.5 MB in the beginning and 230.9 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. [2018-01-28 23:29:30,595 INFO L168 Benchmark]: IcfgTransformer took 24244.12 ms. Allocated memory was 301.5 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 230.9 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 108.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:29:30,595 INFO L168 Benchmark]: TraceAbstraction took 1810.38 ms. Allocated memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: 82.3 MB). Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: -22.4 MB). Peak memory consumption was 59.9 MB. Max. memory is 5.3 GB. [2018-01-28 23:29:30,597 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.12 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.97 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.02 ms. Allocated memory is still 301.5 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 265.15 ms. Allocated memory is still 301.5 MB. Free memory was 248.5 MB in the beginning and 230.9 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. * IcfgTransformer took 24244.12 ms. Allocated memory was 301.5 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 230.9 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 108.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1810.38 ms. Allocated memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: 82.3 MB). Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: -22.4 MB). Peak memory consumption was 59.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 54 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 734 LocStat_NO_SUPPORTING_DISEQUALITIES : 315 LocStat_NO_DISJUNCTIONS : -108 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 74 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 101 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 76 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.485922 RENAME_VARIABLES(MILLISECONDS) : 0.435746 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.185283 PROJECTAWAY(MILLISECONDS) : 0.068375 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.035750 DISJOIN(MILLISECONDS) : 0.497414 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.451858 ADD_EQUALITY(MILLISECONDS) : 0.009732 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007667 #CONJOIN_DISJUNCTIVE : 629 #RENAME_VARIABLES : 1378 #UNFREEZE : 0 #CONJOIN : 889 #PROJECTAWAY : 823 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 184 #RENAME_VARIABLES_DISJUNCTIVE : 1350 #ADD_EQUALITY : 103 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * 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] : 3 * 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, 58 locations, 7 error locations. UNSAFE Result, 1.7s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 372 SDtfs, 304 SDslu, 787 SDs, 0 SdLazy, 470 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 12465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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/openbsd_cstpcpy-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-29-30-608.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-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-29-30-608.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-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-29-30-608.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-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-29-30-608.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-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-29-30-608.csv Received shutdown request...