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_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 23:36:12,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:36:12,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:36:12,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:36:12,342 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:36:12,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:36:12,344 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:36:12,346 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:36:12,348 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:36:12,349 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:36:12,350 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:36:12,350 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:36:12,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:36:12,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:36:12,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:36:12,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:36:12,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:36:12,360 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:36:12,361 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:36:12,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:36:12,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:36:12,365 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:36:12,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:36:12,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:36:12,367 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:36:12,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:36:12,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:36:12,369 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:36:12,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:36:12,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:36:12,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:36:12,371 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 23:36:12,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:36:12,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:36:12,382 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:36:12,382 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:36:12,382 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:36:12,382 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:36:12,383 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:36:12,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:36:12,383 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:36:12,384 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:36:12,384 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:36:12,384 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:36:12,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:36:12,384 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:36:12,384 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:36:12,385 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:36:12,385 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:36:12,385 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:36:12,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:36:12,385 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:36:12,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:36:12,386 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:36:12,386 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:36:12,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:36:12,386 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:36:12,386 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:36:12,387 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:36:12,387 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:36:12,387 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:36:12,387 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:36:12,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:36:12,387 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:36:12,388 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:36:12,388 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:36:12,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:36:12,436 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:36:12,440 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:36:12,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:36:12,442 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:36:12,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-28 23:36:12,620 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:36:12,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:36:12,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:36:12,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:36:12,636 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:36:12,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:36:12" (1/1) ... [2018-01-28 23:36:12,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e00d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12, skipping insertion in model container [2018-01-28 23:36:12,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:36:12" (1/1) ... [2018-01-28 23:36:12,663 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:36:12,706 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:36:12,844 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:36:12,866 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:36:12,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12 WrapperNode [2018-01-28 23:36:12,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:36:12,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:36:12,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:36:12,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:36:12,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12" (1/1) ... [2018-01-28 23:36:12,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12" (1/1) ... [2018-01-28 23:36:12,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12" (1/1) ... [2018-01-28 23:36:12,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12" (1/1) ... [2018-01-28 23:36:12,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12" (1/1) ... [2018-01-28 23:36:12,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12" (1/1) ... [2018-01-28 23:36:12,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12" (1/1) ... [2018-01-28 23:36:12,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:36:12,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:36:12,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:36:12,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:36:12,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:36:12,979 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:36:12,980 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:36:12,980 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-28 23:36:12,980 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-28 23:36:12,980 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-01-28 23:36:12,980 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:36:12,980 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:36:12,980 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:36:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:36:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:36:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:36:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 23:36:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-28 23:36:12,981 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-28 23:36:12,982 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-01-28 23:36:12,982 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:36:12,982 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:36:12,982 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:36:13,407 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:36:13,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:36:13 BoogieIcfgContainer [2018-01-28 23:36:13,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:36:13,409 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:36:13,409 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:36:13,410 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:36:13,413 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:36:13" (1/1) ... [2018-01-28 23:36:13,421 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:36:13,421 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:36:13,422 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:36:13,510 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:36:13,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:36:53,915 INFO L311 AbstractInterpreter]: Visited 169 different actions 2062 times. Merged at 103 different actions 882 times. Never widened. Found 142 fixpoints after 13 different actions. Largest state had 42 variables. [2018-01-28 23:36:53,917 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:36:54,140 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 10 [2018-01-28 23:36:54,141 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:36:54,141 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:36:54,141 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_11| |v_cstrncmp_#t~pre6.base_2|) |v_cstrncmp_#t~pre6.offset_2|), at (SUMMARY for call #t~mem8 := read~int(#t~pre6.base, #t~pre6.offset, 1); srcloc: L555''')) ((select (select |v_#memory_int_12| |v_cstrncmp_#t~post9.base_3|) |v_cstrncmp_#t~post9.offset_3|), at (SUMMARY for call #t~mem10 := read~int(#t~post9.base, #t~post9.offset, 1); srcloc: L556'')) ((select |v_#memory_int_5| v_main_~nondetString1~10.base_2), at (SUMMARY for call write~int(0, ~nondetString1~10.base, ~nondetString1~10.offset + (~length1~10 - 1) * 1, 1); srcloc: L589)) ((select (select |v_#memory_int_13| |v_cstrstr_#t~post11.base_3|) |v_cstrstr_#t~post11.offset_3|), at (SUMMARY for call #t~mem12 := read~int(#t~post11.base, #t~post11.offset, 1); srcloc: L566'')) ((select (select |v_#memory_int_9| |v_cstrncmp_#t~post3.base_3|) |v_cstrncmp_#t~post3.offset_3|), at (SUMMARY for call #t~mem5 := read~int(#t~post3.base, #t~post3.offset, 1); srcloc: L554''')) ((select (select |v_#memory_int_10| v_cstrncmp_~s1.base_5) v_cstrncmp_~s1.offset_4), at (SUMMARY for call #t~mem7 := read~int(~s1.base, ~s1.offset, 1); srcloc: L555)) ((select |v_#memory_int_7| v_main_~nondetString2~10.base_2), at (SUMMARY for call write~int(0, ~nondetString2~10.base, ~nondetString2~10.offset + (~length2~10 - 1) * 1, 1); srcloc: L589')) ((select (select |v_#memory_int_1| v_cstrlen_~s~2.base_3) v_cstrlen_~s~2.offset_3), at (SUMMARY for call #t~mem1 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L544')) ((select (select |v_#memory_int_14| |v_cstrstr_#t~post15.base_3|) |v_cstrstr_#t~post15.offset_3|), at (SUMMARY for call #t~mem16 := read~int(#t~post15.base, #t~post15.offset, 1); srcloc: L570'')) ((select (select |v_#memory_int_8| v_cstrncmp_~s1.base_2) v_cstrncmp_~s1.offset_2), at (SUMMARY for call #t~mem4 := read~int(~s1.base, ~s1.offset, 1); srcloc: L554)) [2018-01-28 23:36:54,189 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:36:54,189 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:36:54,189 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:36:54,189 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:36:54,189 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:36:54,189 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:36:54,189 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:36:54,189 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:36:54,190 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:36:54,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:36:54 BasicIcfg [2018-01-28 23:36:54,213 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:36:54,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:36:54,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:36:54,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:36:54,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:36:12" (1/4) ... [2018-01-28 23:36:54,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4251b68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:36:54, skipping insertion in model container [2018-01-28 23:36:54,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:36:12" (2/4) ... [2018-01-28 23:36:54,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4251b68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:36:54, skipping insertion in model container [2018-01-28 23:36:54,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:36:13" (3/4) ... [2018-01-28 23:36:54,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4251b68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:36:54, skipping insertion in model container [2018-01-28 23:36:54,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:36:54" (4/4) ... [2018-01-28 23:36:54,222 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:36:54,232 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:36:54,238 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-28 23:36:54,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:36:54,268 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:36:54,268 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:36:54,268 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:36:54,268 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:36:54,268 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:36:54,268 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:36:54,268 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:36:54,269 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:36:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2018-01-28 23:36:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:36:54,286 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:54,286 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:36:54,287 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-28 23:36:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1957478658, now seen corresponding path program 1 times [2018-01-28 23:36:54,291 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:54,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:54,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:54,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:54,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:54,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:54,461 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:36:54,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:54,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:36:54,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:36:54,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:36:54,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:36:54,474 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 4 states. [2018-01-28 23:36:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:54,594 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2018-01-28 23:36:54,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:36:54,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-28 23:36:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:54,602 INFO L225 Difference]: With dead ends: 243 [2018-01-28 23:36:54,602 INFO L226 Difference]: Without dead ends: 146 [2018-01-28 23:36:54,606 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:36:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-28 23:36:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-01-28 23:36:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-28 23:36:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2018-01-28 23:36:54,646 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 15 [2018-01-28 23:36:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:54,646 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2018-01-28 23:36:54,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:36:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-01-28 23:36:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:36:54,647 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:54,647 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:36:54,647 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-28 23:36:54,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1957478656, now seen corresponding path program 1 times [2018-01-28 23:36:54,648 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:54,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:54,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:54,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:54,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:54,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:54,850 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:36:54,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:54,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:36:54,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:36:54,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:36:54,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:36:54,853 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand 6 states. [2018-01-28 23:36:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:54,947 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-01-28 23:36:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:36:54,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-28 23:36:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:54,950 INFO L225 Difference]: With dead ends: 146 [2018-01-28 23:36:54,950 INFO L226 Difference]: Without dead ends: 145 [2018-01-28 23:36:54,951 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:36:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-28 23:36:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-01-28 23:36:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-28 23:36:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2018-01-28 23:36:54,964 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 15 [2018-01-28 23:36:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:54,964 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2018-01-28 23:36:54,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:36:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2018-01-28 23:36:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:36:54,965 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:54,965 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:36:54,965 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-28 23:36:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash -552295583, now seen corresponding path program 1 times [2018-01-28 23:36:54,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:54,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:54,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:54,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:54,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:54,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:55,007 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:36:55,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:55,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:36:55,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:36:55,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:36:55,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:36:55,008 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand 4 states. [2018-01-28 23:36:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:55,130 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-01-28 23:36:55,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:36:55,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 23:36:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:55,131 INFO L225 Difference]: With dead ends: 145 [2018-01-28 23:36:55,132 INFO L226 Difference]: Without dead ends: 144 [2018-01-28 23:36:55,132 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:36:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-28 23:36:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-01-28 23:36:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-28 23:36:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-01-28 23:36:55,143 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 16 [2018-01-28 23:36:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:55,143 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-01-28 23:36:55,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:36:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-01-28 23:36:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:36:55,144 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:55,145 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:36:55,145 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-28 23:36:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash -552295581, now seen corresponding path program 1 times [2018-01-28 23:36:55,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:55,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:55,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:55,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:55,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:55,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:55,270 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:36:55,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:55,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:36:55,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:36:55,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:36:55,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:36:55,271 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 5 states. [2018-01-28 23:36:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:55,321 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-01-28 23:36:55,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:36:55,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-28 23:36:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:55,324 INFO L225 Difference]: With dead ends: 144 [2018-01-28 23:36:55,324 INFO L226 Difference]: Without dead ends: 143 [2018-01-28 23:36:55,325 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:36:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-28 23:36:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-01-28 23:36:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-28 23:36:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-01-28 23:36:55,335 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 16 [2018-01-28 23:36:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:55,335 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-01-28 23:36:55,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:36:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-01-28 23:36:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 23:36:55,336 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:55,336 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:36:55,337 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-28 23:36:55,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1924756721, now seen corresponding path program 1 times [2018-01-28 23:36:55,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:55,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:55,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:55,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:55,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:55,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:55,468 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:36:55,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:55,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:36:55,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:36:55,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:36:55,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:36:55,470 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 6 states. [2018-01-28 23:36:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:55,833 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2018-01-28 23:36:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:36:55,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 23:36:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:55,834 INFO L225 Difference]: With dead ends: 143 [2018-01-28 23:36:55,834 INFO L226 Difference]: Without dead ends: 123 [2018-01-28 23:36:55,835 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:36:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-28 23:36:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-28 23:36:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-28 23:36:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-01-28 23:36:55,843 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 24 [2018-01-28 23:36:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:55,843 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-01-28 23:36:55,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:36:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-01-28 23:36:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 23:36:55,844 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:55,845 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, 1] [2018-01-28 23:36:55,845 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-28 23:36:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1242802996, now seen corresponding path program 1 times [2018-01-28 23:36:55,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:55,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:55,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:55,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:55,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:55,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:55,912 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:36:55,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:55,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:36:55,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:36:55,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:36:55,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:36:55,914 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-01-28 23:36:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:55,994 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2018-01-28 23:36:55,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:36:55,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-28 23:36:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:55,995 INFO L225 Difference]: With dead ends: 123 [2018-01-28 23:36:55,995 INFO L226 Difference]: Without dead ends: 122 [2018-01-28 23:36:55,995 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:36:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-28 23:36:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-28 23:36:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-28 23:36:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-01-28 23:36:56,001 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 25 [2018-01-28 23:36:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:56,002 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-01-28 23:36:56,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:36:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-01-28 23:36:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 23:36:56,003 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:56,003 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, 1] [2018-01-28 23:36:56,003 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-28 23:36:56,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1242802998, now seen corresponding path program 1 times [2018-01-28 23:36:56,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:56,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:56,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:56,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:56,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:56,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:56,091 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:36:56,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:56,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 23:36:56,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 23:36:56,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 23:36:56,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 23:36:56,130 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 9 states. [2018-01-28 23:36:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:56,247 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-01-28 23:36:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 23:36:56,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-28 23:36:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:56,248 INFO L225 Difference]: With dead ends: 122 [2018-01-28 23:36:56,248 INFO L226 Difference]: Without dead ends: 121 [2018-01-28 23:36:56,249 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-28 23:36:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-28 23:36:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-28 23:36:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-28 23:36:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-01-28 23:36:56,255 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 25 [2018-01-28 23:36:56,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:56,255 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-01-28 23:36:56,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 23:36:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-01-28 23:36:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 23:36:56,256 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:56,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:36:56,257 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-28 23:36:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1437856882, now seen corresponding path program 1 times [2018-01-28 23:36:56,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:56,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:56,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:56,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:56,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:56,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:56,325 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:36:56,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:56,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 23:36:56,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 23:36:56,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 23:36:56,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-28 23:36:56,326 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 9 states. [2018-01-28 23:36:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:56,469 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-01-28 23:36:56,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 23:36:56,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-28 23:36:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:56,470 INFO L225 Difference]: With dead ends: 121 [2018-01-28 23:36:56,470 INFO L226 Difference]: Without dead ends: 120 [2018-01-28 23:36:56,470 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-28 23:36:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-28 23:36:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-28 23:36:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-28 23:36:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-01-28 23:36:56,475 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 35 [2018-01-28 23:36:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:56,475 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-01-28 23:36:56,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 23:36:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-01-28 23:36:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 23:36:56,476 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:56,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:36:56,477 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-28 23:36:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1437856884, now seen corresponding path program 1 times [2018-01-28 23:36:56,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:56,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:56,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:56,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:56,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:36:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:36:56,529 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:36:56,532 INFO L84 mationBacktranslator]: Skipped ATE [677] [677] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [683] [683] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [689] [689] mainENTRY-->L579: Formula: (and (<= 0 (+ |v_main_#t~nondet18_1| 2147483648)) (<= |v_main_#t~nondet18_1| 2147483647)) InVars {main_#t~nondet18=|v_main_#t~nondet18_1|} OutVars{main_#t~nondet18=|v_main_#t~nondet18_1|} AuxVars[] AssignedVars[] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [693] [693] L579-->L579': Formula: (= v_main_~length1~10_1 |v_main_#t~nondet18_2|) InVars {main_#t~nondet18=|v_main_#t~nondet18_2|} OutVars{main_#t~nondet18=|v_main_#t~nondet18_2|, main_~length1~10=v_main_~length1~10_1} AuxVars[] AssignedVars[main_~length1~10] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [697] [697] L579'-->L580: Formula: true InVars {} OutVars{main_#t~nondet18=|v_main_#t~nondet18_3|} AuxVars[] AssignedVars[main_#t~nondet18] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [699] [699] L580-->L580': Formula: (and (<= 0 (+ |v_main_#t~nondet19_1| 2147483648)) (<= |v_main_#t~nondet19_1| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_1|} OutVars{main_#t~nondet19=|v_main_#t~nondet19_1|} AuxVars[] AssignedVars[] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [701] [701] L580'-->L580'': Formula: (= v_main_~length2~10_1 |v_main_#t~nondet19_2|) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~length2~10=v_main_~length2~10_1, main_#t~nondet19=|v_main_#t~nondet19_2|} AuxVars[] AssignedVars[main_~length2~10] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [703] [703] L580''-->L581: Formula: true InVars {} OutVars{main_#t~nondet19=|v_main_#t~nondet19_3|} AuxVars[] AssignedVars[main_#t~nondet19] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [707] [707] L581-->L581'': Formula: (not (< v_main_~length1~10_4 1)) InVars {main_~length1~10=v_main_~length1~10_4} OutVars{main_~length1~10=v_main_~length1~10_4} AuxVars[] AssignedVars[] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [713] [713] L581''-->L584': Formula: (not (< v_main_~length2~10_4 1)) InVars {main_~length2~10=v_main_~length2~10_4} OutVars{main_~length2~10=v_main_~length2~10_4} AuxVars[] AssignedVars[] [2018-01-28 23:36:56,533 INFO L84 mationBacktranslator]: Skipped ATE [717] [717] L584'-->L587: Formula: (and (not (= |v_main_#t~malloc20.base_3| 0)) (= (store |v_#valid_16| |v_main_#t~malloc20.base_3| 1) |v_#valid_15|) (= |v_#length_5| (store |v_#length_6| |v_main_#t~malloc20.base_3| v_main_~length1~10_5)) (= 0 |v_main_#t~malloc20.offset_3|) (= (select |v_#valid_16| |v_main_#t~malloc20.base_3|) 0)) InVars {#length=|v_#length_6|, main_~length1~10=v_main_~length1~10_5, #valid=|v_#valid_16|} OutVars{#length=|v_#length_5|, main_~length1~10=v_main_~length1~10_5, main_#t~malloc20.base=|v_main_#t~malloc20.base_3|, main_#t~malloc20.offset=|v_main_#t~malloc20.offset_3|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc20.base, main_#t~malloc20.offset] [2018-01-28 23:36:56,534 INFO L84 mationBacktranslator]: Skipped ATE [719] [719] L587-->L588: Formula: (and (= v_main_~nondetString1~10.offset_1 |v_main_#t~malloc20.offset_4|) (= v_main_~nondetString1~10.base_1 |v_main_#t~malloc20.base_4|)) InVars {main_#t~malloc20.offset=|v_main_#t~malloc20.offset_4|, main_#t~malloc20.base=|v_main_#t~malloc20.base_4|} OutVars{main_~nondetString1~10.base=v_main_~nondetString1~10.base_1, main_#t~malloc20.base=|v_main_#t~malloc20.base_4|, main_#t~malloc20.offset=|v_main_#t~malloc20.offset_4|, main_~nondetString1~10.offset=v_main_~nondetString1~10.offset_1} AuxVars[] AssignedVars[main_~nondetString1~10.offset, main_~nondetString1~10.base] [2018-01-28 23:36:56,534 INFO L84 mationBacktranslator]: Skipped ATE [721] [721] L588-->L588': Formula: (and (not (= 0 |v_main_#t~malloc21.base_3|)) (= |v_#valid_17| (store |v_#valid_18| |v_main_#t~malloc21.base_3| 1)) (= 0 |v_main_#t~malloc21.offset_3|) (= |v_#length_7| (store |v_#length_8| |v_main_#t~malloc21.base_3| v_main_~length2~10_5)) (= 0 (select |v_#valid_18| |v_main_#t~malloc21.base_3|))) InVars {#length=|v_#length_8|, main_~length2~10=v_main_~length2~10_5, #valid=|v_#valid_18|} OutVars{main_#t~malloc21.offset=|v_main_#t~malloc21.offset_3|, #length=|v_#length_7|, main_#t~malloc21.base=|v_main_#t~malloc21.base_3|, main_~length2~10=v_main_~length2~10_5, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#valid, main_#t~malloc21.offset, #length, main_#t~malloc21.base] [2018-01-28 23:36:56,534 INFO L84 mationBacktranslator]: Skipped ATE [723] [723] L588'-->L589: Formula: (and (= v_main_~nondetString2~10.offset_1 |v_main_#t~malloc21.offset_4|) (= v_main_~nondetString2~10.base_1 |v_main_#t~malloc21.base_4|)) InVars {main_#t~malloc21.offset=|v_main_#t~malloc21.offset_4|, main_#t~malloc21.base=|v_main_#t~malloc21.base_4|} OutVars{main_#t~malloc21.offset=|v_main_#t~malloc21.offset_4|, main_~nondetString2~10.offset=v_main_~nondetString2~10.offset_1, main_#t~malloc21.base=|v_main_#t~malloc21.base_4|, main_~nondetString2~10.base=v_main_~nondetString2~10.base_1} AuxVars[] AssignedVars[main_~nondetString2~10.offset, main_~nondetString2~10.base] [2018-01-28 23:36:56,534 INFO L84 mationBacktranslator]: Skipped ATE [725] [725] L589-->L589': Formula: (let ((.cse0 (+ v_main_~nondetString1~10.offset_2 v_main_~length1~10_6))) (and (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|) (= 1 (select |v_#valid_19| v_main_~nondetString1~10.base_2)) (<= 1 .cse0) (<= .cse0 (select |v_#length_9| v_main_~nondetString1~10.base_2)))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_2|, main_~nondetString1~10.offset=v_main_~nondetString1~10.offset_2, #valid=|v_#valid_19|, main_~nondetString1~10.base=v_main_~nondetString1~10.base_2, main_~length1~10=v_main_~length1~10_6, #length=|v_#length_9|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_1|, main_~nondetString1~10.offset=v_main_~nondetString1~10.offset_2, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_4|, main_~nondetString1~10.base=v_main_~nondetString1~10.base_2, main_~length1~10=v_main_~length1~10_6, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:36:56,534 INFO L84 mationBacktranslator]: Skipped ATE [731] [731] L589'-->L590: Formula: (let ((.cse0 (+ v_main_~length2~10_6 v_main_~nondetString2~10.offset_2))) (and (= |v_#memory_int_part_locs_0_locs_0_3| |v_#memory_int_part_locs_0_locs_0_4|) (<= .cse0 (select |v_#length_11| v_main_~nondetString2~10.base_2)) (= 1 (select |v_#valid_21| v_main_~nondetString2~10.base_2)) (<= 1 .cse0))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, main_~nondetString2~10.offset=v_main_~nondetString2~10.offset_2, #valid=|v_#valid_21|, #length=|v_#length_11|, main_~length2~10=v_main_~length2~10_6, main_~nondetString2~10.base=v_main_~nondetString2~10.base_2} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, main_~nondetString2~10.offset=v_main_~nondetString2~10.offset_2, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|, main_~length2~10=v_main_~length2~10_6, main_~nondetString2~10.base=v_main_~nondetString2~10.base_2} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:36:56,534 INFO L84 mationBacktranslator]: Skipped ATE [739] [739] L590-->cstrstrENTRY: Formula: (and (= |v_cstrstr_#in~s.baseInParam_1| v_main_~nondetString1~10.base_6) (= |v_cstrstr_#in~find.baseInParam_1| v_main_~nondetString2~10.base_6) (= |v_cstrstr_#in~find.offsetInParam_1| v_main_~nondetString2~10.offset_5) (= |v_cstrstr_#in~s.offsetInParam_1| v_main_~nondetString1~10.offset_5)) InVars {main_~nondetString1~10.base=v_main_~nondetString1~10.base_6, main_~nondetString2~10.offset=v_main_~nondetString2~10.offset_5, main_~nondetString2~10.base=v_main_~nondetString2~10.base_6, main_~nondetString1~10.offset=v_main_~nondetString1~10.offset_5} OutVars{cstrstr_#in~find.base=|v_cstrstr_#in~find.baseInParam_1|, cstrstr_#in~s.base=|v_cstrstr_#in~s.baseInParam_1|, cstrstr_#in~s.offset=|v_cstrstr_#in~s.offsetInParam_1|, cstrstr_#in~find.offset=|v_cstrstr_#in~find.offsetInParam_1|} AuxVars[] AssignedVars[cstrstr_#in~find.base, cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.offset] [2018-01-28 23:36:56,534 INFO L84 mationBacktranslator]: Skipped ATE [743] [743] cstrstrENTRY-->L561: Formula: (and (= v_cstrstr_~s.base_1 |v_cstrstr_#in~s.base_1|) (= v_cstrstr_~s.offset_1 |v_cstrstr_#in~s.offset_1|)) InVars {cstrstr_#in~s.base=|v_cstrstr_#in~s.base_1|, cstrstr_#in~s.offset=|v_cstrstr_#in~s.offset_1|} OutVars{cstrstr_~s.offset=v_cstrstr_~s.offset_1, cstrstr_~s.base=v_cstrstr_~s.base_1, cstrstr_#in~s.base=|v_cstrstr_#in~s.base_1|, cstrstr_#in~s.offset=|v_cstrstr_#in~s.offset_1|} AuxVars[] AssignedVars[cstrstr_~s.offset, cstrstr_~s.base] [2018-01-28 23:36:56,534 INFO L84 mationBacktranslator]: Skipped ATE [747] [747] L561-->L564: Formula: (and (= v_cstrstr_~find.offset_1 |v_cstrstr_#in~find.offset_1|) (= v_cstrstr_~find.base_1 |v_cstrstr_#in~find.base_1|)) InVars {cstrstr_#in~find.base=|v_cstrstr_#in~find.base_1|, cstrstr_#in~find.offset=|v_cstrstr_#in~find.offset_1|} OutVars{cstrstr_#in~find.base=|v_cstrstr_#in~find.base_1|, cstrstr_~find.offset=v_cstrstr_~find.offset_1, cstrstr_~find.base=v_cstrstr_~find.base_1, cstrstr_#in~find.offset=|v_cstrstr_#in~find.offset_1|} AuxVars[] AssignedVars[cstrstr_~find.base, cstrstr_~find.offset] [2018-01-28 23:36:56,534 INFO L84 mationBacktranslator]: Skipped ATE [751] [751] L564-->L564': Formula: true InVars {} OutVars{cstrstr_~c~6=v_cstrstr_~c~6_1} AuxVars[] AssignedVars[cstrstr_~c~6] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [755] [755] L564'-->L565: Formula: true InVars {} OutVars{cstrstr_~sc~6=v_cstrstr_~sc~6_1} AuxVars[] AssignedVars[cstrstr_~sc~6] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [759] [759] L565-->L566: Formula: true InVars {} OutVars{cstrstr_~len~6=v_cstrstr_~len~6_1} AuxVars[] AssignedVars[cstrstr_~len~6] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [763] [763] L566-->L566': Formula: (and (= |v_cstrstr_#t~post11.offset_1| v_cstrstr_~find.offset_2) (= |v_cstrstr_#t~post11.base_1| v_cstrstr_~find.base_2)) InVars {cstrstr_~find.offset=v_cstrstr_~find.offset_2, cstrstr_~find.base=v_cstrstr_~find.base_2} OutVars{cstrstr_#t~post11.base=|v_cstrstr_#t~post11.base_1|, cstrstr_#t~post11.offset=|v_cstrstr_#t~post11.offset_1|, cstrstr_~find.offset=v_cstrstr_~find.offset_2, cstrstr_~find.base=v_cstrstr_~find.base_2} AuxVars[] AssignedVars[cstrstr_#t~post11.base, cstrstr_#t~post11.offset] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [769] [769] L566'-->L566'': Formula: (and (= v_cstrstr_~find.base_3 |v_cstrstr_#t~post11.base_2|) (= v_cstrstr_~find.offset_3 (+ |v_cstrstr_#t~post11.offset_2| 1))) InVars {cstrstr_#t~post11.base=|v_cstrstr_#t~post11.base_2|, cstrstr_#t~post11.offset=|v_cstrstr_#t~post11.offset_2|} OutVars{cstrstr_#t~post11.base=|v_cstrstr_#t~post11.base_2|, cstrstr_#t~post11.offset=|v_cstrstr_#t~post11.offset_2|, cstrstr_~find.offset=v_cstrstr_~find.offset_3, cstrstr_~find.base=v_cstrstr_~find.base_3} AuxVars[] AssignedVars[cstrstr_~find.base, cstrstr_~find.offset] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [771] [771] L566''-->L566''': Formula: (and (= |v_cstrstr_#t~mem12_1| (select (select |v_#memory_int_part_locs_0_locs_0_5| |v_cstrstr_#t~post11.base_3|) |v_cstrstr_#t~post11.offset_3|)) (<= 0 |v_cstrstr_#t~post11.offset_3|) (= (select |v_#valid_33| |v_cstrstr_#t~post11.base_3|) 1) (<= (+ |v_cstrstr_#t~post11.offset_3| 1) (select |v_#length_23| |v_cstrstr_#t~post11.base_3|))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, #length=|v_#length_23|, cstrstr_#t~post11.base=|v_cstrstr_#t~post11.base_3|, cstrstr_#t~post11.offset=|v_cstrstr_#t~post11.offset_3|, #valid=|v_#valid_33|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, cstrstr_#t~post11.base=|v_cstrstr_#t~post11.base_3|, #valid=|v_#valid_33|, #length=|v_#length_23|, cstrstr_#t~post11.offset=|v_cstrstr_#t~post11.offset_3|, cstrstr_#t~mem12=|v_cstrstr_#t~mem12_1|} AuxVars[] AssignedVars[cstrstr_#t~mem12] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [777] [777] L566'''-->L566'''': Formula: (= v_cstrstr_~c~6_2 |v_cstrstr_#t~mem12_2|) InVars {cstrstr_#t~mem12=|v_cstrstr_#t~mem12_2|} OutVars{cstrstr_~c~6=v_cstrstr_~c~6_2, cstrstr_#t~mem12=|v_cstrstr_#t~mem12_2|} AuxVars[] AssignedVars[cstrstr_~c~6] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [779] [779] L566''''-->L566''''': Formula: (not (= 0 v_cstrstr_~c~6_3)) InVars {cstrstr_~c~6=v_cstrstr_~c~6_3} OutVars{cstrstr_~c~6=v_cstrstr_~c~6_3} AuxVars[] AssignedVars[] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [783] [783] L566'''''-->L566'''''': Formula: true InVars {} OutVars{cstrstr_#t~post11.base=|v_cstrstr_#t~post11.base_6|, cstrstr_#t~post11.offset=|v_cstrstr_#t~post11.offset_5|} AuxVars[] AssignedVars[cstrstr_#t~post11.base, cstrstr_#t~post11.offset] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [787] [787] L566''''''-->L567: Formula: true InVars {} OutVars{cstrstr_#t~mem12=|v_cstrstr_#t~mem12_3|} AuxVars[] AssignedVars[cstrstr_#t~mem12] [2018-01-28 23:36:56,535 INFO L84 mationBacktranslator]: Skipped ATE [793] [793] L567-->cstrlenENTRY: Formula: (and (= |v_cstrlen_#in~str.baseInParam_1| v_cstrstr_~find.base_6) (= |v_cstrlen_#in~str.offsetInParam_1| v_cstrstr_~find.offset_6)) InVars {cstrstr_~find.offset=v_cstrstr_~find.offset_6, cstrstr_~find.base=v_cstrstr_~find.base_6} OutVars{cstrlen_#in~str.base=|v_cstrlen_#in~str.baseInParam_1|, cstrlen_#in~str.offset=|v_cstrlen_#in~str.offsetInParam_1|} AuxVars[] AssignedVars[cstrlen_#in~str.base, cstrlen_#in~str.offset] [2018-01-28 23:36:56,536 INFO L84 mationBacktranslator]: Skipped ATE [799] [799] cstrlenENTRY-->L543: Formula: (and (= v_cstrlen_~str.offset_1 |v_cstrlen_#in~str.offset_1|) (= v_cstrlen_~str.base_1 |v_cstrlen_#in~str.base_1|)) InVars {cstrlen_#in~str.base=|v_cstrlen_#in~str.base_1|, cstrlen_#in~str.offset=|v_cstrlen_#in~str.offset_1|} OutVars{cstrlen_~str.offset=v_cstrlen_~str.offset_1, cstrlen_#in~str.base=|v_cstrlen_#in~str.base_1|, cstrlen_~str.base=v_cstrlen_~str.base_1, cstrlen_#in~str.offset=|v_cstrlen_#in~str.offset_1|} AuxVars[] AssignedVars[cstrlen_~str.offset, cstrlen_~str.base] [2018-01-28 23:36:56,536 INFO L84 mationBacktranslator]: Skipped ATE [805] [805] L543-->L544: Formula: true InVars {} OutVars{cstrlen_~s~2.offset=v_cstrlen_~s~2.offset_1, cstrlen_~s~2.base=v_cstrlen_~s~2.base_1} AuxVars[] AssignedVars[cstrlen_~s~2.offset, cstrlen_~s~2.base] [2018-01-28 23:36:56,536 INFO L84 mationBacktranslator]: Skipped ATE [811] [811] L544-->L544''''''''': Formula: (and (= v_cstrlen_~s~2.offset_2 v_cstrlen_~str.offset_2) (= v_cstrlen_~s~2.base_2 v_cstrlen_~str.base_2)) InVars {cstrlen_~str.offset=v_cstrlen_~str.offset_2, cstrlen_~str.base=v_cstrlen_~str.base_2} OutVars{cstrlen_~s~2.base=v_cstrlen_~s~2.base_2, cstrlen_~str.offset=v_cstrlen_~str.offset_2, cstrlen_~str.base=v_cstrlen_~str.base_2, cstrlen_~s~2.offset=v_cstrlen_~s~2.offset_2} AuxVars[] AssignedVars[cstrlen_~s~2.offset, cstrlen_~s~2.base] [2018-01-28 23:36:56,536 INFO L84 mationBacktranslator]: Skipped ATE [819] [819] L544'''''''''-->L544': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:36:56,536 INFO L84 mationBacktranslator]: Skipped ATE [835] [835] L544'-->cstrlenErr1RequiresViolation: Formula: (or (not (<= 0 v_cstrlen_~s~2.offset_4)) (not (<= (+ v_cstrlen_~s~2.offset_4 1) (select |v_#length_2| v_cstrlen_~s~2.base_5)))) InVars {#length=|v_#length_2|, cstrlen_~s~2.base=v_cstrlen_~s~2.base_5, cstrlen_~s~2.offset=v_cstrlen_~s~2.offset_4} OutVars{#length=|v_#length_2|, cstrlen_~s~2.base=v_cstrlen_~s~2.base_5, cstrlen_~s~2.offset=v_cstrlen_~s~2.offset_4} AuxVars[] AssignedVars[] [2018-01-28 23:36:56,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:36:56 BasicIcfg [2018-01-28 23:36:56,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:36:56,541 INFO L168 Benchmark]: Toolchain (without parser) took 43920.54 ms. Allocated memory was 299.9 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 259.9 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 371.6 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:56,542 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:36:56,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.28 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 248.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:56,542 INFO L168 Benchmark]: Boogie Preprocessor took 50.52 ms. Allocated memory is still 299.9 MB. Free memory was 248.0 MB in the beginning and 246.0 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:36:56,542 INFO L168 Benchmark]: RCFGBuilder took 483.02 ms. Allocated memory is still 299.9 MB. Free memory was 246.0 MB in the beginning and 215.2 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:56,542 INFO L168 Benchmark]: IcfgTransformer took 40804.74 ms. Allocated memory was 299.9 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 215.2 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 58.5 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:56,543 INFO L168 Benchmark]: TraceAbstraction took 2326.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 268.4 MB). Peak memory consumption was 268.4 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:56,544 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.21 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 246.28 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 248.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.52 ms. Allocated memory is still 299.9 MB. Free memory was 248.0 MB in the beginning and 246.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 483.02 ms. Allocated memory is still 299.9 MB. Free memory was 246.0 MB in the beginning and 215.2 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 5.3 GB. * IcfgTransformer took 40804.74 ms. Allocated memory was 299.9 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 215.2 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 58.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2326.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 268.4 MB). Peak memory consumption was 268.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 139 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2036 LocStat_NO_SUPPORTING_DISEQUALITIES : 1137 LocStat_NO_DISJUNCTIONS : -278 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 184 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 189 TransStat_NO_SUPPORTING_DISEQUALITIES : 24 TransStat_NO_DISJUNCTIONS : 190 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.138240 RENAME_VARIABLES(MILLISECONDS) : 0.007760 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.780646 PROJECTAWAY(MILLISECONDS) : 0.676134 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.062158 DISJOIN(MILLISECONDS) : 0.220366 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.015601 ADD_EQUALITY(MILLISECONDS) : 0.016131 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008105 #CONJOIN_DISJUNCTIVE : 3278 #RENAME_VARIABLES : 7377 #UNFREEZE : 0 #CONJOIN : 4508 #PROJECTAWAY : 4301 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 1431 #RENAME_VARIABLES_DISJUNCTIVE : 7223 #ADD_EQUALITY : 191 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 22 * 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] : 10 * 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 6 procedures, 150 locations, 21 error locations. UNSAFE Result, 2.2s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1107 SDtfs, 414 SDslu, 2412 SDs, 0 SdLazy, 1049 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 15962 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_cstrstr-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-36-56-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-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-36-56-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-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-36-56-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-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-36-56-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-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-36-56-553.csv Received shutdown request...