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_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 23:31:51,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:31:51,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:31:51,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:31:51,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:31:51,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:31:51,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:31:51,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:31:51,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:31:51,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:31:51,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:31:51,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:31:51,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:31:51,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:31:51,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:31:51,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:31:51,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:31:51,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:31:51,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:31:51,423 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:31:51,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:31:51,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:31:51,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:31:51,427 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:31:51,428 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:31:51,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:31:51,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:31:51,430 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:31:51,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:31:51,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:31:51,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:31:51,431 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:31:51,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:31:51,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:31:51,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:31:51,441 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:31:51,441 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:31:51,441 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:31:51,442 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:31:51,442 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:31:51,442 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:31:51,442 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:31:51,442 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:31:51,443 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:31:51,443 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:31:51,443 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:31:51,443 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:31:51,443 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:31:51,443 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:31:51,443 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:31:51,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:31:51,444 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:31:51,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:31:51,444 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:31:51,444 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:31:51,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:31:51,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:31:51,445 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:31:51,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:31:51,445 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:31:51,445 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:31:51,445 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:31:51,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:31:51,446 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:31:51,446 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:31:51,446 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:31:51,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:31:51,491 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:31:51,494 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:31:51,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:31:51,496 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:31:51,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 23:31:51,667 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:31:51,672 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:31:51,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:31:51,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:31:51,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:31:51,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:31:51" (1/1) ... [2018-01-28 23:31:51,681 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:31:51, skipping insertion in model container [2018-01-28 23:31:51,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:31:51" (1/1) ... [2018-01-28 23:31:51,694 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:31:51,731 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:31:51,846 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:31:51,865 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:31:51,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51 WrapperNode [2018-01-28 23:31:51,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:31:51,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:31:51,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:31:51,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:31:51,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51" (1/1) ... [2018-01-28 23:31:51,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51" (1/1) ... [2018-01-28 23:31:51,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51" (1/1) ... [2018-01-28 23:31:51,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51" (1/1) ... [2018-01-28 23:31:51,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51" (1/1) ... [2018-01-28 23:31:51,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51" (1/1) ... [2018-01-28 23:31:51,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51" (1/1) ... [2018-01-28 23:31:51,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:31:51,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:31:51,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:31:51,930 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:31:51,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51" (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:31:51,985 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:31:51,985 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:31:51,985 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-28 23:31:51,986 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:31:51,986 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:31:51,986 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:31:51,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:31:51,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:31:51,986 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:31:51,987 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 23:31:51,987 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-28 23:31:51,987 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:31:51,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:31:51,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:31:52,203 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:31:52,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:31:52 BoogieIcfgContainer [2018-01-28 23:31:52,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:31:52,204 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:31:52,204 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:31:52,205 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:31:52,207 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:31:52" (1/1) ... [2018-01-28 23:31:52,214 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:31:52,214 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:31:52,215 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:31:52,268 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:31:52,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:32:20,598 INFO L311 AbstractInterpreter]: Visited 66 different actions 361 times. Merged at 40 different actions 196 times. Never widened. Found 21 fixpoints after 5 different actions. Largest state had 36 variables. [2018-01-28 23:32:20,600 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:32:20,611 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 3 [2018-01-28 23:32:20,611 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:32:20,611 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:32:20,611 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_cstrcpy_~from.base_2) v_cstrcpy_~from.offset_2), at (SUMMARY for call #t~mem3 := read~int(~from.base, ~from.offset, 1); srcloc: L544)) ((select |v_#memory_int_7| 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: L559)) ((select |v_#memory_int_3| v_cstrcpy_~to.base_3), at (SUMMARY for call write~int(#t~mem3, ~to.base, ~to.offset, 1); srcloc: L544')) [2018-01-28 23:32:20,623 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:32:20,624 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:32:20,624 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:32:20,624 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:32:20,624 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:32:20,624 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:32:20,624 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:32:20,624 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:32:20,625 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:32:20,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:32:20 BasicIcfg [2018-01-28 23:32:20,640 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:32:20,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:32:20,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:32:20,644 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:32:20,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:31:51" (1/4) ... [2018-01-28 23:32:20,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72acdd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:32:20, skipping insertion in model container [2018-01-28 23:32:20,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:31:51" (2/4) ... [2018-01-28 23:32:20,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72acdd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:32:20, skipping insertion in model container [2018-01-28 23:32:20,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:31:52" (3/4) ... [2018-01-28 23:32:20,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72acdd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:32:20, skipping insertion in model container [2018-01-28 23:32:20,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:32:20" (4/4) ... [2018-01-28 23:32:20,648 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:32:20,717 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:32:20,723 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-28 23:32:20,751 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:32:20,751 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:32:20,751 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:32:20,751 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:32:20,751 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:32:20,752 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:32:20,752 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:32:20,752 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:32:20,752 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:32:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-28 23:32:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-28 23:32:20,768 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:20,769 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:32:20,769 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:32:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1803990722, now seen corresponding path program 1 times [2018-01-28 23:32:20,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:20,774 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:20,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:20,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:20,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:20,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:20,913 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:32:20,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:20,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 23:32:20,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 23:32:20,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 23:32:20,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 23:32:20,930 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-28 23:32:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:20,993 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-01-28 23:32:20,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 23:32:20,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-28 23:32:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:21,010 INFO L225 Difference]: With dead ends: 74 [2018-01-28 23:32:21,010 INFO L226 Difference]: Without dead ends: 55 [2018-01-28 23:32:21,014 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:32:21,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-28 23:32:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-28 23:32:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-28 23:32:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-28 23:32:21,052 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 13 [2018-01-28 23:32:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:21,052 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-28 23:32:21,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 23:32:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-28 23:32:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:32:21,053 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:21,053 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:32:21,053 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:32:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash -178693985, now seen corresponding path program 1 times [2018-01-28 23:32:21,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:21,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:21,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:21,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:21,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:21,126 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:32:21,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:21,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:32:21,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:32:21,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:32:21,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:32:21,129 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2018-01-28 23:32:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:21,204 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-01-28 23:32:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:32:21,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 23:32:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:21,206 INFO L225 Difference]: With dead ends: 55 [2018-01-28 23:32:21,206 INFO L226 Difference]: Without dead ends: 54 [2018-01-28 23:32:21,207 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:32:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-28 23:32:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-28 23:32:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-28 23:32:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-28 23:32:21,214 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 16 [2018-01-28 23:32:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:21,214 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-28 23:32:21,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:32:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-28 23:32:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:32:21,215 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:21,215 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:32:21,215 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:32:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash -178693983, now seen corresponding path program 1 times [2018-01-28 23:32:21,216 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:21,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:21,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:21,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:21,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:21,320 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:32:21,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:21,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:32:21,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:32:21,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:32:21,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:32:21,322 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2018-01-28 23:32:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:21,371 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-28 23:32:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:32:21,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-28 23:32:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:21,372 INFO L225 Difference]: With dead ends: 54 [2018-01-28 23:32:21,372 INFO L226 Difference]: Without dead ends: 53 [2018-01-28 23:32:21,372 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:32:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-28 23:32:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-28 23:32:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 23:32:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-28 23:32:21,377 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2018-01-28 23:32:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:21,377 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-28 23:32:21,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:32:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-28 23:32:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 23:32:21,377 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:21,378 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:32:21,378 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:32:21,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1408380147, now seen corresponding path program 1 times [2018-01-28 23:32:21,378 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:21,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:21,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:21,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:21,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:21,441 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:32:21,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:21,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:32:21,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:32:21,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:32:21,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:32:21,442 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2018-01-28 23:32:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:21,511 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-01-28 23:32:21,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 23:32:21,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-28 23:32:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:21,512 INFO L225 Difference]: With dead ends: 53 [2018-01-28 23:32:21,512 INFO L226 Difference]: Without dead ends: 52 [2018-01-28 23:32:21,513 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:32:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-28 23:32:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-28 23:32:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-28 23:32:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-28 23:32:21,516 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 22 [2018-01-28 23:32:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:21,517 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-28 23:32:21,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:32:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-28 23:32:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 23:32:21,517 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:21,517 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:32:21,517 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:32:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1408380145, now seen corresponding path program 1 times [2018-01-28 23:32:21,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:21,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:21,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:21,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:21,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:21,634 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:32:21,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:21,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 23:32:21,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 23:32:21,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 23:32:21,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:32:21,635 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-01-28 23:32:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:21,752 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-28 23:32:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:32:21,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-28 23:32:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:21,755 INFO L225 Difference]: With dead ends: 66 [2018-01-28 23:32:21,755 INFO L226 Difference]: Without dead ends: 65 [2018-01-28 23:32:21,755 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:32:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-28 23:32:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-01-28 23:32:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-28 23:32:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-28 23:32:21,761 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 22 [2018-01-28 23:32:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:21,761 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-28 23:32:21,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 23:32:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-28 23:32:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 23:32:21,762 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:21,762 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] [2018-01-28 23:32:21,762 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:32:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash -710111294, now seen corresponding path program 1 times [2018-01-28 23:32:21,762 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:21,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:21,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:21,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:21,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:21,891 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:32:21,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:21,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 23:32:21,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 23:32:21,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 23:32:21,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:32:21,893 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-01-28 23:32:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:21,985 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-28 23:32:21,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:32:21,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-28 23:32:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:21,986 INFO L225 Difference]: With dead ends: 54 [2018-01-28 23:32:21,986 INFO L226 Difference]: Without dead ends: 53 [2018-01-28 23:32:21,987 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:32:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-28 23:32:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-28 23:32:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 23:32:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-28 23:32:21,992 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 23 [2018-01-28 23:32:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:21,992 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-28 23:32:21,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 23:32:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-28 23:32:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 23:32:21,993 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:21,994 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] [2018-01-28 23:32:21,994 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:32:21,994 INFO L82 PathProgramCache]: Analyzing trace with hash -710111292, now seen corresponding path program 1 times [2018-01-28 23:32:21,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:21,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:21,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:21,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:21,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:22,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:22,103 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:32:22,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:22,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 23:32:22,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 23:32:22,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 23:32:22,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:32:22,105 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 8 states. [2018-01-28 23:32:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:22,241 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-01-28 23:32:22,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:32:22,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-28 23:32:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:22,243 INFO L225 Difference]: With dead ends: 55 [2018-01-28 23:32:22,243 INFO L226 Difference]: Without dead ends: 54 [2018-01-28 23:32:22,243 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-28 23:32:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-28 23:32:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-28 23:32:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-28 23:32:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-28 23:32:22,249 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 23 [2018-01-28 23:32:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:22,249 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-28 23:32:22,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 23:32:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-28 23:32:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 23:32:22,250 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:22,250 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:32:22,251 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:32:22,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1563441027, now seen corresponding path program 1 times [2018-01-28 23:32:22,251 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:22,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:22,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:22,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:22,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:22,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:22,355 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:32:22,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:22,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:32:22,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:32:22,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:32:22,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:32:22,356 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-01-28 23:32:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:22,437 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-28 23:32:22,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:32:22,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 23:32:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:22,438 INFO L225 Difference]: With dead ends: 54 [2018-01-28 23:32:22,438 INFO L226 Difference]: Without dead ends: 42 [2018-01-28 23:32:22,439 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:32:22,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-28 23:32:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-28 23:32:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-28 23:32:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-28 23:32:22,445 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 24 [2018-01-28 23:32:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:22,445 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-28 23:32:22,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:32:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-28 23:32:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 23:32:22,446 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:22,446 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, 1] [2018-01-28 23:32:22,446 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:32:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1974467980, now seen corresponding path program 1 times [2018-01-28 23:32:22,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:22,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:22,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:22,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:22,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:32:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:32:22,502 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:32:22,505 INFO L84 mationBacktranslator]: Skipped ATE [265] [265] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-28 23:32:22,505 INFO L84 mationBacktranslator]: Skipped ATE [271] [271] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:32:22,505 INFO L84 mationBacktranslator]: Skipped ATE [277] [277] mainENTRY-->L548: 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:32:22,505 INFO L84 mationBacktranslator]: Skipped ATE [281] [281] L548-->L548': 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:32:22,505 INFO L84 mationBacktranslator]: Skipped ATE [285] [285] L548'-->L549: Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_3|} AuxVars[] AssignedVars[main_#t~nondet4] [2018-01-28 23:32:22,505 INFO L84 mationBacktranslator]: Skipped ATE [287] [287] L549-->L549': 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:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [289] [289] L549'-->L549'': Formula: (= v_main_~length2~4_4 |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_4} AuxVars[] AssignedVars[main_~length2~4] [2018-01-28 23:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [291] [291] L549''-->L550: Formula: true InVars {} OutVars{main_#t~nondet5=|v_main_#t~nondet5_3|} AuxVars[] AssignedVars[main_#t~nondet5] [2018-01-28 23:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [295] [295] L550-->L550'': 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:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [301] [301] L550''-->L553': Formula: (not (< v_main_~length2~4_7 1)) InVars {main_~length2~4=v_main_~length2~4_7} OutVars{main_~length2~4=v_main_~length2~4_7} AuxVars[] AssignedVars[] [2018-01-28 23:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [307] [307] L553'-->L557: Formula: (not (< v_main_~length1~4_6 v_main_~length2~4_9)) InVars {main_~length2~4=v_main_~length2~4_9, main_~length1~4=v_main_~length1~4_6} OutVars{main_~length2~4=v_main_~length2~4_9, main_~length1~4=v_main_~length1~4_6} AuxVars[] AssignedVars[] [2018-01-28 23:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [311] [311] L557-->L557': Formula: (and (= (select |v_#valid_22| |v_main_#t~malloc6.base_4|) 0) (not (= 0 |v_main_#t~malloc6.base_4|)) (= (store |v_#length_12| |v_main_#t~malloc6.base_4| v_main_~length1~4_7) |v_#length_11|) (= |v_main_#t~malloc6.offset_4| 0) (= (store |v_#valid_22| |v_main_#t~malloc6.base_4| 1) |v_#valid_21|)) InVars {#length=|v_#length_12|, main_~length1~4=v_main_~length1~4_7, #valid=|v_#valid_22|} OutVars{#length=|v_#length_11|, main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~length1~4=v_main_~length1~4_7, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] [2018-01-28 23:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [317] [317] L557'-->L558: Formula: (and (= v_main_~nondetArea~4.base_1 |v_main_#t~malloc6.base_1|) (= v_main_~nondetArea~4.offset_1 |v_main_#t~malloc6.offset_1|)) InVars {main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|} 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_1|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|} AuxVars[] AssignedVars[main_~nondetArea~4.base, main_~nondetArea~4.offset] [2018-01-28 23:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [319] [319] L558-->L558': Formula: (and (= |v_#length_7| (store |v_#length_8| |v_main_#t~malloc7.base_1| v_main_~length2~4_1)) (= |v_#valid_11| (store |v_#valid_12| |v_main_#t~malloc7.base_1| 1)) (= 0 (select |v_#valid_12| |v_main_#t~malloc7.base_1|)) (not (= |v_main_#t~malloc7.base_1| 0)) (= |v_main_#t~malloc7.offset_1| 0)) InVars {main_~length2~4=v_main_~length2~4_1, #length=|v_#length_8|, #valid=|v_#valid_12|} OutVars{main_~length2~4=v_main_~length2~4_1, #length=|v_#length_7|, main_#t~malloc7.base=|v_main_#t~malloc7.base_1|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_1|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[main_#t~malloc7.offset, #valid, #length, main_#t~malloc7.base] [2018-01-28 23:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [321] [321] L558'-->L559: 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:32:22,506 INFO L84 mationBacktranslator]: Skipped ATE [323] [323] L559-->L559': Formula: (let ((.cse0 (+ v_main_~length2~4_2 v_main_~nondetString~4.offset_2))) (and (<= .cse0 (select |v_#length_9| v_main_~nondetString~4.base_2)) (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|) (<= 1 .cse0) (= 1 (select |v_#valid_13| v_main_~nondetString~4.base_2)))) InVars {#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_13|, main_~length2~4=v_main_~length2~4_2, #length=|v_#length_9|} OutVars{#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_13|, #memory_int=|v_#memory_int_6|, main_~length2~4=v_main_~length2~4_2, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:32:22,507 INFO L84 mationBacktranslator]: Skipped ATE [331] [331] L559'-->cstrcpyENTRY: Formula: (and (= |v_cstrcpy_#in~from.offsetInParam_1| v_main_~nondetString~4.offset_5) (= |v_cstrcpy_#in~to.baseInParam_1| v_main_~nondetArea~4.base_3) (= |v_cstrcpy_#in~from.baseInParam_1| v_main_~nondetString~4.base_6) (= |v_cstrcpy_#in~to.offsetInParam_1| v_main_~nondetArea~4.offset_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{cstrcpy_#in~to.offset=|v_cstrcpy_#in~to.offsetInParam_1|, cstrcpy_#in~from.offset=|v_cstrcpy_#in~from.offsetInParam_1|, cstrcpy_#in~to.base=|v_cstrcpy_#in~to.baseInParam_1|, cstrcpy_#in~from.base=|v_cstrcpy_#in~from.baseInParam_1|} AuxVars[] AssignedVars[cstrcpy_#in~to.offset, cstrcpy_#in~from.offset, cstrcpy_#in~to.base, cstrcpy_#in~from.base] [2018-01-28 23:32:22,507 INFO L84 mationBacktranslator]: Skipped ATE [335] [335] cstrcpyENTRY-->L540: Formula: (and (= v_cstrcpy_~to.offset_1 |v_cstrcpy_#in~to.offset_1|) (= v_cstrcpy_~to.base_1 |v_cstrcpy_#in~to.base_1|)) InVars {cstrcpy_#in~to.offset=|v_cstrcpy_#in~to.offset_1|, cstrcpy_#in~to.base=|v_cstrcpy_#in~to.base_1|} OutVars{cstrcpy_#in~to.offset=|v_cstrcpy_#in~to.offset_1|, cstrcpy_~to.base=v_cstrcpy_~to.base_1, cstrcpy_~to.offset=v_cstrcpy_~to.offset_1, cstrcpy_#in~to.base=|v_cstrcpy_#in~to.base_1|} AuxVars[] AssignedVars[cstrcpy_~to.base, cstrcpy_~to.offset] [2018-01-28 23:32:22,507 INFO L84 mationBacktranslator]: Skipped ATE [339] [339] L540-->L543: Formula: (and (= v_cstrcpy_~from.offset_1 |v_cstrcpy_#in~from.offset_1|) (= v_cstrcpy_~from.base_1 |v_cstrcpy_#in~from.base_1|)) InVars {cstrcpy_#in~from.offset=|v_cstrcpy_#in~from.offset_1|, cstrcpy_#in~from.base=|v_cstrcpy_#in~from.base_1|} OutVars{cstrcpy_#in~from.offset=|v_cstrcpy_#in~from.offset_1|, cstrcpy_~from.offset=v_cstrcpy_~from.offset_1, cstrcpy_~from.base=v_cstrcpy_~from.base_1, cstrcpy_#in~from.base=|v_cstrcpy_#in~from.base_1|} AuxVars[] AssignedVars[cstrcpy_~from.offset, cstrcpy_~from.base] [2018-01-28 23:32:22,507 INFO L84 mationBacktranslator]: Skipped ATE [343] [343] L543-->L544'''''''''''': Formula: (and (= v_cstrcpy_~save~2.base_1 v_cstrcpy_~to.base_2) (= v_cstrcpy_~save~2.offset_1 v_cstrcpy_~to.offset_2)) InVars {cstrcpy_~to.offset=v_cstrcpy_~to.offset_2, cstrcpy_~to.base=v_cstrcpy_~to.base_2} OutVars{cstrcpy_~to.base=v_cstrcpy_~to.base_2, cstrcpy_~to.offset=v_cstrcpy_~to.offset_2, cstrcpy_~save~2.offset=v_cstrcpy_~save~2.offset_1, cstrcpy_~save~2.base=v_cstrcpy_~save~2.base_1} AuxVars[] AssignedVars[cstrcpy_~save~2.offset, cstrcpy_~save~2.base] [2018-01-28 23:32:22,507 INFO L84 mationBacktranslator]: Skipped ATE [347] [347] L544''''''''''''-->L544: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:32:22,507 INFO L84 mationBacktranslator]: Skipped ATE [353] [353] L544-->L544': Formula: (and (= 1 (select |v_#valid_1| v_cstrcpy_~from.base_2)) (<= (+ v_cstrcpy_~from.offset_2 1) (select |v_#length_1| v_cstrcpy_~from.base_2)) (<= 0 v_cstrcpy_~from.offset_2) (= (select (select |v_#memory_int_part_locs_0_locs_0_3| v_cstrcpy_~from.base_2) v_cstrcpy_~from.offset_2) |v_cstrcpy_#t~mem3_1|)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, cstrcpy_~from.offset=v_cstrcpy_~from.offset_2, #length=|v_#length_1|, cstrcpy_~from.base=v_cstrcpy_~from.base_2, #valid=|v_#valid_1|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, cstrcpy_~from.offset=v_cstrcpy_~from.offset_2, cstrcpy_#t~mem3=|v_cstrcpy_#t~mem3_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, cstrcpy_~from.base=v_cstrcpy_~from.base_2} AuxVars[] AssignedVars[cstrcpy_#t~mem3] [2018-01-28 23:32:22,508 INFO L84 mationBacktranslator]: Skipped ATE [363] [363] L544'-->L544'': Formula: (and (<= 0 v_cstrcpy_~to.offset_3) (<= (+ v_cstrcpy_~to.offset_3 1) (select |v_#length_3| v_cstrcpy_~to.base_3)) (= (select |v_#valid_3| v_cstrcpy_~to.base_3) 1) (= |v_#memory_int_part_locs_0_locs_0_4| |v_#memory_int_part_locs_0_locs_0_5|)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, cstrcpy_~to.base=v_cstrcpy_~to.base_3, #length=|v_#length_3|, cstrcpy_~to.offset=v_cstrcpy_~to.offset_3, #valid=|v_#valid_3|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, cstrcpy_~to.base=v_cstrcpy_~to.base_3, cstrcpy_~to.offset=v_cstrcpy_~to.offset_3, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:32:22,508 INFO L84 mationBacktranslator]: Skipped ATE [373] [373] L544''-->L544''''': Formula: (not (= 0 |v_cstrcpy_#t~mem3_5|)) InVars {cstrcpy_#t~mem3=|v_cstrcpy_#t~mem3_5|} OutVars{cstrcpy_#t~mem3=|v_cstrcpy_#t~mem3_5|} AuxVars[] AssignedVars[] [2018-01-28 23:32:22,508 INFO L84 mationBacktranslator]: Skipped ATE [377] [377] L544'''''-->L544'''''': Formula: true InVars {} OutVars{cstrcpy_#t~mem3=|v_cstrcpy_#t~mem3_6|} AuxVars[] AssignedVars[cstrcpy_#t~mem3] [2018-01-28 23:32:22,508 INFO L84 mationBacktranslator]: Skipped ATE [379] [379] L544''''''-->L544''''''': Formula: (and (= |v_cstrcpy_#t~pre0.offset_1| (+ v_cstrcpy_~from.offset_4 1)) (= |v_cstrcpy_#t~pre0.base_1| v_cstrcpy_~from.base_5)) InVars {cstrcpy_~from.offset=v_cstrcpy_~from.offset_4, cstrcpy_~from.base=v_cstrcpy_~from.base_5} OutVars{cstrcpy_~from.offset=v_cstrcpy_~from.offset_4, cstrcpy_~from.base=v_cstrcpy_~from.base_5, cstrcpy_#t~pre0.base=|v_cstrcpy_#t~pre0.base_1|, cstrcpy_#t~pre0.offset=|v_cstrcpy_#t~pre0.offset_1|} AuxVars[] AssignedVars[cstrcpy_#t~pre0.base, cstrcpy_#t~pre0.offset] [2018-01-28 23:32:22,508 INFO L84 mationBacktranslator]: Skipped ATE [381] [381] L544'''''''-->L544'''''''': Formula: (and (= v_cstrcpy_~from.base_6 v_cstrcpy_~from.base_7) (= v_cstrcpy_~from.offset_5 (+ v_cstrcpy_~from.offset_6 1))) InVars {cstrcpy_~from.offset=v_cstrcpy_~from.offset_6, cstrcpy_~from.base=v_cstrcpy_~from.base_7} OutVars{cstrcpy_~from.offset=v_cstrcpy_~from.offset_5, cstrcpy_~from.base=v_cstrcpy_~from.base_6} AuxVars[] AssignedVars[cstrcpy_~from.offset, cstrcpy_~from.base] [2018-01-28 23:32:22,508 INFO L84 mationBacktranslator]: Skipped ATE [383] [383] L544''''''''-->L544''''''''': Formula: true InVars {} OutVars{cstrcpy_#t~pre0.base=|v_cstrcpy_#t~pre0.base_2|, cstrcpy_#t~pre0.offset=|v_cstrcpy_#t~pre0.offset_2|} AuxVars[] AssignedVars[cstrcpy_#t~pre0.base, cstrcpy_#t~pre0.offset] [2018-01-28 23:32:22,508 INFO L84 mationBacktranslator]: Skipped ATE [385] [385] L544'''''''''-->L544'''''''''': Formula: (and (= |v_cstrcpy_#t~pre1.base_1| v_cstrcpy_~to.base_6) (= |v_cstrcpy_#t~pre1.offset_1| (+ v_cstrcpy_~to.offset_5 1))) InVars {cstrcpy_~to.offset=v_cstrcpy_~to.offset_5, cstrcpy_~to.base=v_cstrcpy_~to.base_6} OutVars{cstrcpy_~to.base=v_cstrcpy_~to.base_6, cstrcpy_#t~pre1.offset=|v_cstrcpy_#t~pre1.offset_1|, cstrcpy_~to.offset=v_cstrcpy_~to.offset_5, cstrcpy_#t~pre1.base=|v_cstrcpy_#t~pre1.base_1|} AuxVars[] AssignedVars[cstrcpy_#t~pre1.offset, cstrcpy_#t~pre1.base] [2018-01-28 23:32:22,509 INFO L84 mationBacktranslator]: Skipped ATE [387] [387] L544''''''''''-->L544''''''''''': Formula: (and (= v_cstrcpy_~to.offset_6 (+ v_cstrcpy_~to.offset_7 1)) (= v_cstrcpy_~to.base_7 v_cstrcpy_~to.base_8)) InVars {cstrcpy_~to.offset=v_cstrcpy_~to.offset_7, cstrcpy_~to.base=v_cstrcpy_~to.base_8} OutVars{cstrcpy_~to.offset=v_cstrcpy_~to.offset_6, cstrcpy_~to.base=v_cstrcpy_~to.base_7} AuxVars[] AssignedVars[cstrcpy_~to.base, cstrcpy_~to.offset] [2018-01-28 23:32:22,509 INFO L84 mationBacktranslator]: Skipped ATE [389] [389] L544'''''''''''-->L544'''''''''''': Formula: true InVars {} OutVars{cstrcpy_#t~pre1.offset=|v_cstrcpy_#t~pre1.offset_2|, cstrcpy_#t~pre1.base=|v_cstrcpy_#t~pre1.base_2|} AuxVars[] AssignedVars[cstrcpy_#t~pre1.offset, cstrcpy_#t~pre1.base] [2018-01-28 23:32:22,509 INFO L84 mationBacktranslator]: Skipped ATE [347] [347] L544''''''''''''-->L544: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:32:22,509 INFO L84 mationBacktranslator]: Skipped ATE [357] [357] L544-->cstrcpyErr1RequiresViolation: Formula: (or (not (<= (+ v_cstrcpy_~from.offset_3 1) (select |v_#length_2| v_cstrcpy_~from.base_4))) (not (<= 0 v_cstrcpy_~from.offset_3))) InVars {cstrcpy_~from.offset=v_cstrcpy_~from.offset_3, #length=|v_#length_2|, cstrcpy_~from.base=v_cstrcpy_~from.base_4} OutVars{cstrcpy_~from.offset=v_cstrcpy_~from.offset_3, #length=|v_#length_2|, cstrcpy_~from.base=v_cstrcpy_~from.base_4} AuxVars[] AssignedVars[] [2018-01-28 23:32:22,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:32:22 BasicIcfg [2018-01-28 23:32:22,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:32:22,515 INFO L168 Benchmark]: Toolchain (without parser) took 30846.66 ms. Allocated memory was 304.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 264.0 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 215.8 MB. Max. memory is 5.3 GB. [2018-01-28 23:32:22,515 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.1 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:32:22,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.71 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-28 23:32:22,516 INFO L168 Benchmark]: Boogie Preprocessor took 41.32 ms. Allocated memory is still 304.1 MB. Free memory was 252.7 MB in the beginning and 251.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-28 23:32:22,516 INFO L168 Benchmark]: RCFGBuilder took 273.52 ms. Allocated memory is still 304.1 MB. Free memory was 250.7 MB in the beginning and 232.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:32:22,516 INFO L168 Benchmark]: IcfgTransformer took 28435.94 ms. Allocated memory was 304.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 232.7 MB in the beginning and 318.1 MB in the end (delta: -85.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-28 23:32:22,517 INFO L168 Benchmark]: TraceAbstraction took 1873.41 ms. Allocated memory was 1.8 GB in the beginning and 2.0 GB in the end (delta: 191.9 MB). Free memory was 318.1 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:32:22,519 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 304.1 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.71 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.32 ms. Allocated memory is still 304.1 MB. Free memory was 252.7 MB in the beginning and 251.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 273.52 ms. Allocated memory is still 304.1 MB. Free memory was 250.7 MB in the beginning and 232.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 28435.94 ms. Allocated memory was 304.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 232.7 MB in the beginning and 318.1 MB in the end (delta: -85.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * TraceAbstraction took 1873.41 ms. Allocated memory was 1.8 GB in the beginning and 2.0 GB in the end (delta: 191.9 MB). Free memory was 318.1 MB in the beginning and 1.7 GB in the end (delta: -1.4 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 : 55 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 801 LocStat_NO_SUPPORTING_DISEQUALITIES : 314 LocStat_NO_DISJUNCTIONS : -110 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 75 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 103 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 77 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.436905 RENAME_VARIABLES(MILLISECONDS) : 0.462250 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.412301 PROJECTAWAY(MILLISECONDS) : 0.237587 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048048 DISJOIN(MILLISECONDS) : 0.308824 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.478578 ADD_EQUALITY(MILLISECONDS) : 0.012512 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011667 #CONJOIN_DISJUNCTIVE : 606 #RENAME_VARIABLES : 1320 #UNFREEZE : 0 #CONJOIN : 854 #PROJECTAWAY : 793 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 172 #RENAME_VARIABLES_DISJUNCTIVE : 1296 #ADD_EQUALITY : 105 #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, 59 locations, 7 error locations. UNSAFE Result, 1.7s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 380 SDtfs, 308 SDslu, 761 SDs, 0 SdLazy, 463 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 13867 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_cstrcpy-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-32-22-528.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-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-32-22-528.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-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-32-22-528.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-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-32-22-528.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-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-32-22-528.csv Received shutdown request...