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_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 23:35:34,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:35:34,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:35:34,055 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:35:34,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:35:34,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:35:34,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:35:34,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:35:34,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:35:34,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:35:34,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:35:34,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:35:34,064 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:35:34,065 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:35:34,066 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:35:34,069 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:35:34,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:35:34,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:35:34,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:35:34,076 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:35:34,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:35:34,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:35:34,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:35:34,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:35:34,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:35:34,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:35:34,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:35:34,083 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:35:34,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:35:34,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:35:34,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:35:34,085 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:35:34,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:35:34,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:35:34,095 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:35:34,095 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:35:34,095 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:35:34,096 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:35:34,096 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:35:34,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:35:34,096 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:35:34,096 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:35:34,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:35:34,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:35:34,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:35:34,097 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:35:34,097 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:35:34,097 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:35:34,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:35:34,097 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:35:34,098 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:35:34,098 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:35:34,098 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:35:34,098 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:35:34,098 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:35:34,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:35:34,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:35:34,099 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:35:34,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:35:34,099 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:35:34,099 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:35:34,099 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:35:34,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:35:34,099 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:35:34,100 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:35:34,100 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:35:34,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:35:34,142 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:35:34,146 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:35:34,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:35:34,147 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:35:34,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-28 23:35:34,320 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:35:34,324 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:35:34,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:35:34,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:35:34,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:35:34,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78375287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34, skipping insertion in model container [2018-01-28 23:35:34,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,381 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:35:34,419 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:35:34,531 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:35:34,552 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:35:34,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34 WrapperNode [2018-01-28 23:35:34,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:35:34,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:35:34,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:35:34,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:35:34,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:35:34,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:35:34,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:35:34,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:35:34,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34" (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:35:34,638 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:35:34,639 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:35:34,639 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-01-28 23:35:34,639 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:35:34,639 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:35:34,639 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:35:34,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:35:34,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:35:34,639 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:35:34,639 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 23:35:34,640 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-01-28 23:35:34,640 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:35:34,640 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:35:34,640 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:35:34,811 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:35:34,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:34 BoogieIcfgContainer [2018-01-28 23:35:34,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:35:34,812 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:35:34,812 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:35:34,813 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:35:34,815 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:34" (1/1) ... [2018-01-28 23:35:34,822 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:35:34,822 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:35:34,823 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:35:34,876 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:35:34,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:35:42,108 INFO L311 AbstractInterpreter]: Visited 63 different actions 426 times. Merged at 37 different actions 232 times. Never widened. Found 26 fixpoints after 4 different actions. Largest state had 30 variables. [2018-01-28 23:35:42,111 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:35:42,121 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 2 [2018-01-28 23:35:42,121 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:35:42,121 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:35:42,121 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_cstrnlen_~cp~2.base_3) v_cstrnlen_~cp~2.offset_3), at (SUMMARY for call #t~mem2 := read~int(~cp~2.base, ~cp~2.offset, 1); srcloc: L544''')) ((select |v_#memory_int_5| v_main_~nondetString1~4.base_2), at (SUMMARY for call write~int(0, ~nondetString1~4.base, ~nondetString1~4.offset + (~length1~4 - 1) * 1, 1); srcloc: L558)) [2018-01-28 23:35:42,125 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:35:42,125 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:35:42,125 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:35:42,126 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:35:42,126 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:35:42,126 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:35:42,126 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:35:42,126 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:35:42,127 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:35:42,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:35:42 BasicIcfg [2018-01-28 23:35:42,142 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:35:42,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:35:42,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:35:42,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:35:42,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:35:34" (1/4) ... [2018-01-28 23:35:42,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244f84fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:35:42, skipping insertion in model container [2018-01-28 23:35:42,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:34" (2/4) ... [2018-01-28 23:35:42,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244f84fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:35:42, skipping insertion in model container [2018-01-28 23:35:42,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:34" (3/4) ... [2018-01-28 23:35:42,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244f84fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:35:42, skipping insertion in model container [2018-01-28 23:35:42,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:35:42" (4/4) ... [2018-01-28 23:35:42,149 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:35:42,228 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:35:42,236 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-28 23:35:42,276 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:35:42,276 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:35:42,276 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:35:42,276 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:35:42,277 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:35:42,277 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:35:42,277 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:35:42,277 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:35:42,278 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:35:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-28 23:35:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-28 23:35:42,295 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:42,296 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:42,296 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:42,299 INFO L82 PathProgramCache]: Analyzing trace with hash 288227188, now seen corresponding path program 1 times [2018-01-28 23:35:42,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:42,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:42,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:42,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:42,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:42,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:42,453 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:35:42,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:42,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:35:42,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:35:42,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:35:42,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:35:42,465 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-28 23:35:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:42,530 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-01-28 23:35:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:35:42,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-28 23:35:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:42,544 INFO L225 Difference]: With dead ends: 68 [2018-01-28 23:35:42,544 INFO L226 Difference]: Without dead ends: 52 [2018-01-28 23:35:42,547 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:35:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-28 23:35:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-28 23:35:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-28 23:35:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-28 23:35:42,588 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-01-28 23:35:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:42,588 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-28 23:35:42,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:35:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-28 23:35:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-28 23:35:42,589 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:42,589 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:42,590 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash 288227190, now seen corresponding path program 1 times [2018-01-28 23:35:42,590 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:42,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:42,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:42,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:42,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:42,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:42,699 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:35:42,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:42,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:35:42,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:35:42,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:35:42,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:35:42,702 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-28 23:35:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:42,772 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-28 23:35:42,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:35:42,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-28 23:35:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:42,774 INFO L225 Difference]: With dead ends: 52 [2018-01-28 23:35:42,774 INFO L226 Difference]: Without dead ends: 51 [2018-01-28 23:35:42,775 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:35:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-28 23:35:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-28 23:35:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-28 23:35:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-28 23:35:42,781 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-28 23:35:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:42,782 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-28 23:35:42,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:35:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-28 23:35:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 23:35:42,783 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:42,783 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:42,783 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:42,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1250042976, now seen corresponding path program 1 times [2018-01-28 23:35:42,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:42,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:42,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:42,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:42,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:42,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:42,865 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:35:42,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:42,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:35:42,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:35:42,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:35:42,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:35:42,867 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-28 23:35:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:42,975 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-28 23:35:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 23:35:42,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 23:35:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:42,977 INFO L225 Difference]: With dead ends: 51 [2018-01-28 23:35:42,977 INFO L226 Difference]: Without dead ends: 40 [2018-01-28 23:35:42,978 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:35:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-28 23:35:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-28 23:35:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-28 23:35:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-01-28 23:35:42,983 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 19 [2018-01-28 23:35:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:42,984 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-01-28 23:35:42,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:35:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-01-28 23:35:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 23:35:42,985 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:42,985 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:35:42,985 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:42,985 INFO L82 PathProgramCache]: Analyzing trace with hash -958628845, now seen corresponding path program 1 times [2018-01-28 23:35:42,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:42,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:42,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:42,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:42,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:42,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:43,055 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:35:43,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:43,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:35:43,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:35:43,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:35:43,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:35:43,056 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-01-28 23:35:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:43,116 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-28 23:35:43,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:35:43,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-28 23:35:43,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:43,117 INFO L225 Difference]: With dead ends: 51 [2018-01-28 23:35:43,117 INFO L226 Difference]: Without dead ends: 50 [2018-01-28 23:35:43,117 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:35:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-28 23:35:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-01-28 23:35:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-28 23:35:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-01-28 23:35:43,123 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2018-01-28 23:35:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:43,123 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-01-28 23:35:43,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:35:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-01-28 23:35:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 23:35:43,124 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:43,125 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:35:43,125 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash -958628843, now seen corresponding path program 1 times [2018-01-28 23:35:43,125 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:43,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:43,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:43,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:43,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:43,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:43,252 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:35:43,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:43,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 23:35:43,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 23:35:43,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 23:35:43,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 23:35:43,253 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 9 states. [2018-01-28 23:35:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:43,342 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-28 23:35:43,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:35:43,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-28 23:35:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:43,343 INFO L225 Difference]: With dead ends: 51 [2018-01-28 23:35:43,343 INFO L226 Difference]: Without dead ends: 50 [2018-01-28 23:35:43,344 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-28 23:35:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-28 23:35:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-01-28 23:35:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-28 23:35:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-28 23:35:43,349 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 22 [2018-01-28 23:35:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:43,350 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-28 23:35:43,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 23:35:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-28 23:35:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 23:35:43,351 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:43,351 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:43,352 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:43,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1879015571, now seen corresponding path program 1 times [2018-01-28 23:35:43,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:43,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:43,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:43,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:43,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:43,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:35:43,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:43,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:35:43,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 23:35:43,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 23:35:43,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 23:35:43,406 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-01-28 23:35:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:43,428 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-28 23:35:43,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 23:35:43,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-28 23:35:43,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:43,429 INFO L225 Difference]: With dead ends: 61 [2018-01-28 23:35:43,429 INFO L226 Difference]: Without dead ends: 44 [2018-01-28 23:35:43,430 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:35:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-28 23:35:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-28 23:35:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-28 23:35:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-01-28 23:35:43,438 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 34 [2018-01-28 23:35:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:43,438 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-01-28 23:35:43,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 23:35:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-01-28 23:35:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 23:35:43,439 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:43,440 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:43,440 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1511237317, now seen corresponding path program 1 times [2018-01-28 23:35:43,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:43,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:43,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:43,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:43,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:43,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-28 23:35:43,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:43,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:35:43,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:35:43,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:35:43,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:35:43,529 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 7 states. [2018-01-28 23:35:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:43,602 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-01-28 23:35:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:35:43,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-28 23:35:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:43,604 INFO L225 Difference]: With dead ends: 44 [2018-01-28 23:35:43,604 INFO L226 Difference]: Without dead ends: 43 [2018-01-28 23:35:43,604 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:35:43,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-28 23:35:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-28 23:35:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-28 23:35:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-28 23:35:43,610 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 36 [2018-01-28 23:35:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:43,610 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-28 23:35:43,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:35:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-28 23:35:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 23:35:43,611 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:43,611 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:43,612 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1511237319, now seen corresponding path program 1 times [2018-01-28 23:35:43,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:43,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:43,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:43,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:43,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:35:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:35:43,679 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:35:43,683 INFO L84 mationBacktranslator]: Skipped ATE [253] [253] 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:35:43,683 INFO L84 mationBacktranslator]: Skipped ATE [259] [259] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:35:43,683 INFO L84 mationBacktranslator]: Skipped ATE [265] [265] mainENTRY-->L549: 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:35:43,684 INFO L84 mationBacktranslator]: Skipped ATE [269] [269] L549-->L549': Formula: (= v_main_~length1~4_4 |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_4} AuxVars[] AssignedVars[main_~length1~4] [2018-01-28 23:35:43,684 INFO L84 mationBacktranslator]: Skipped ATE [273] [273] L549'-->L550: Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_3|} AuxVars[] AssignedVars[main_#t~nondet4] [2018-01-28 23:35:43,684 INFO L84 mationBacktranslator]: Skipped ATE [275] [275] L550-->L550': 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:35:43,684 INFO L84 mationBacktranslator]: Skipped ATE [277] [277] L550'-->L550'': Formula: (= v_main_~n~4_3 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_2|, main_~n~4=v_main_~n~4_3} AuxVars[] AssignedVars[main_~n~4] [2018-01-28 23:35:43,684 INFO L84 mationBacktranslator]: Skipped ATE [279] [279] L550''-->L551: Formula: true InVars {} OutVars{main_#t~nondet5=|v_main_#t~nondet5_3|} AuxVars[] AssignedVars[main_#t~nondet5] [2018-01-28 23:35:43,684 INFO L84 mationBacktranslator]: Skipped ATE [283] [283] L551-->L551'': Formula: (not (< v_main_~length1~4_7 1)) InVars {main_~length1~4=v_main_~length1~4_7} OutVars{main_~length1~4=v_main_~length1~4_7} AuxVars[] AssignedVars[] [2018-01-28 23:35:43,684 INFO L84 mationBacktranslator]: Skipped ATE [289] [289] L551''-->L554': Formula: (not (< v_main_~n~4_1 1)) InVars {main_~n~4=v_main_~n~4_1} OutVars{main_~n~4=v_main_~n~4_1} AuxVars[] AssignedVars[] [2018-01-28 23:35:43,685 INFO L84 mationBacktranslator]: Skipped ATE [293] [293] L554'-->L557: Formula: (and (not (= 0 |v_main_#t~malloc6.base_1|)) (= |v_#valid_9| (store |v_#valid_10| |v_main_#t~malloc6.base_1| 1)) (= |v_main_#t~malloc6.offset_1| 0) (= 0 (select |v_#valid_10| |v_main_#t~malloc6.base_1|)) (= (store |v_#length_6| |v_main_#t~malloc6.base_1| v_main_~length1~4_1) |v_#length_5|)) InVars {#length=|v_#length_6|, main_~length1~4=v_main_~length1~4_1, #valid=|v_#valid_10|} OutVars{#length=|v_#length_5|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~length1~4=v_main_~length1~4_1, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] [2018-01-28 23:35:43,685 INFO L84 mationBacktranslator]: Skipped ATE [295] [295] L557-->L558: Formula: (and (= v_main_~nondetString1~4.base_1 |v_main_#t~malloc6.base_2|) (= v_main_~nondetString1~4.offset_1 |v_main_#t~malloc6.offset_2|)) InVars {main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, main_#t~malloc6.base=|v_main_#t~malloc6.base_2|} OutVars{main_#t~malloc6.base=|v_main_#t~malloc6.base_2|, main_~nondetString1~4.offset=v_main_~nondetString1~4.offset_1, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, main_~nondetString1~4.base=v_main_~nondetString1~4.base_1} AuxVars[] AssignedVars[main_~nondetString1~4.base, main_~nondetString1~4.offset] [2018-01-28 23:35:43,685 INFO L84 mationBacktranslator]: Skipped ATE [297] [297] L558-->L558': Formula: (let ((.cse0 (+ v_main_~length1~4_2 v_main_~nondetString1~4.offset_2))) (and (= 1 (select |v_#valid_11| v_main_~nondetString1~4.base_2)) (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|) (<= 1 .cse0) (<= .cse0 (select |v_#length_7| v_main_~nondetString1~4.base_2)))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_1|, main_~length1~4=v_main_~length1~4_2, main_~nondetString1~4.base=v_main_~nondetString1~4.base_2, #valid=|v_#valid_11|, #length=|v_#length_7|, main_~nondetString1~4.offset=v_main_~nondetString1~4.offset_2} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_2|, main_~length1~4=v_main_~length1~4_2, main_~nondetString1~4.base=v_main_~nondetString1~4.base_2, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, main_~nondetString1~4.offset=v_main_~nondetString1~4.offset_2} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:35:43,685 INFO L84 mationBacktranslator]: Skipped ATE [305] [305] L558'-->cstrnlenENTRY: Formula: (and (= |v_cstrnlen_#in~str.offsetInParam_1| v_main_~nondetString1~4.offset_5) (= |v_cstrnlen_#in~maxlenInParam_1| v_main_~n~4_6) (= |v_cstrnlen_#in~str.baseInParam_1| v_main_~nondetString1~4.base_6)) InVars {main_~nondetString1~4.offset=v_main_~nondetString1~4.offset_5, main_~nondetString1~4.base=v_main_~nondetString1~4.base_6, main_~n~4=v_main_~n~4_6} OutVars{cstrnlen_#in~str.offset=|v_cstrnlen_#in~str.offsetInParam_1|, cstrnlen_#in~maxlen=|v_cstrnlen_#in~maxlenInParam_1|, cstrnlen_#in~str.base=|v_cstrnlen_#in~str.baseInParam_1|} AuxVars[] AssignedVars[cstrnlen_#in~str.offset, cstrnlen_#in~maxlen, cstrnlen_#in~str.base] [2018-01-28 23:35:43,685 INFO L84 mationBacktranslator]: Skipped ATE [309] [309] cstrnlenENTRY-->L540: Formula: (and (= v_cstrnlen_~str.base_1 |v_cstrnlen_#in~str.base_1|) (= v_cstrnlen_~str.offset_1 |v_cstrnlen_#in~str.offset_1|)) InVars {cstrnlen_#in~str.base=|v_cstrnlen_#in~str.base_1|, cstrnlen_#in~str.offset=|v_cstrnlen_#in~str.offset_1|} OutVars{cstrnlen_~str.base=v_cstrnlen_~str.base_1, cstrnlen_#in~str.offset=|v_cstrnlen_#in~str.offset_1|, cstrnlen_#in~str.base=|v_cstrnlen_#in~str.base_1|, cstrnlen_~str.offset=v_cstrnlen_~str.offset_1} AuxVars[] AssignedVars[cstrnlen_~str.base, cstrnlen_~str.offset] [2018-01-28 23:35:43,685 INFO L84 mationBacktranslator]: Skipped ATE [313] [313] L540-->L543: Formula: (= v_cstrnlen_~maxlen_1 |v_cstrnlen_#in~maxlen_1|) InVars {cstrnlen_#in~maxlen=|v_cstrnlen_#in~maxlen_1|} OutVars{cstrnlen_~maxlen=v_cstrnlen_~maxlen_1, cstrnlen_#in~maxlen=|v_cstrnlen_#in~maxlen_1|} AuxVars[] AssignedVars[cstrnlen_~maxlen] [2018-01-28 23:35:43,686 INFO L84 mationBacktranslator]: Skipped ATE [317] [317] L543-->L544: Formula: true InVars {} OutVars{cstrnlen_~cp~2.base=v_cstrnlen_~cp~2.base_1, cstrnlen_~cp~2.offset=v_cstrnlen_~cp~2.offset_1} AuxVars[] AssignedVars[cstrnlen_~cp~2.base, cstrnlen_~cp~2.offset] [2018-01-28 23:35:43,686 INFO L84 mationBacktranslator]: Skipped ATE [321] [321] L544-->L544'''''''''''''''''': Formula: (and (= v_cstrnlen_~cp~2.offset_2 v_cstrnlen_~str.offset_2) (= v_cstrnlen_~cp~2.base_2 v_cstrnlen_~str.base_2)) InVars {cstrnlen_~str.base=v_cstrnlen_~str.base_2, cstrnlen_~str.offset=v_cstrnlen_~str.offset_2} OutVars{cstrnlen_~cp~2.base=v_cstrnlen_~cp~2.base_2, cstrnlen_~str.base=v_cstrnlen_~str.base_2, cstrnlen_~cp~2.offset=v_cstrnlen_~cp~2.offset_2, cstrnlen_~str.offset=v_cstrnlen_~str.offset_2} AuxVars[] AssignedVars[cstrnlen_~cp~2.base, cstrnlen_~cp~2.offset] [2018-01-28 23:35:43,686 INFO L84 mationBacktranslator]: Skipped ATE [327] [327] L544''''''''''''''''''-->L544': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:35:43,686 INFO L84 mationBacktranslator]: Skipped ATE [331] [331] L544'-->L544'': Formula: (let ((.cse0 (= 0 (mod v_cstrnlen_~maxlen_2 4294967296)))) (or (and (not .cse0) |v_cstrnlen_#t~short3_1|) (and (not |v_cstrnlen_#t~short3_1|) .cse0))) InVars {cstrnlen_~maxlen=v_cstrnlen_~maxlen_2} OutVars{cstrnlen_#t~short3=|v_cstrnlen_#t~short3_1|, cstrnlen_~maxlen=v_cstrnlen_~maxlen_2} AuxVars[] AssignedVars[cstrnlen_#t~short3] [2018-01-28 23:35:43,686 INFO L84 mationBacktranslator]: Skipped ATE [335] [335] L544''-->L544''': Formula: |v_cstrnlen_#t~short3_2| InVars {cstrnlen_#t~short3=|v_cstrnlen_#t~short3_2|} OutVars{cstrnlen_#t~short3=|v_cstrnlen_#t~short3_2|} AuxVars[] AssignedVars[] [2018-01-28 23:35:43,686 INFO L84 mationBacktranslator]: Skipped ATE [341] [341] L544'''-->L544'''': Formula: (and (= (select |v_#valid_3| v_cstrnlen_~cp~2.base_3) 1) (<= 0 v_cstrnlen_~cp~2.offset_3) (<= (+ v_cstrnlen_~cp~2.offset_3 1) (select |v_#length_1| v_cstrnlen_~cp~2.base_3)) (= (select (select |v_#memory_int_part_locs_0_locs_0_3| v_cstrnlen_~cp~2.base_3) v_cstrnlen_~cp~2.offset_3) |v_cstrnlen_#t~mem2_1|)) InVars {cstrnlen_~cp~2.base=v_cstrnlen_~cp~2.base_3, #memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, #length=|v_#length_1|, cstrnlen_~cp~2.offset=v_cstrnlen_~cp~2.offset_3, #valid=|v_#valid_3|} OutVars{cstrnlen_~cp~2.base=v_cstrnlen_~cp~2.base_3, #memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, #valid=|v_#valid_3|, #length=|v_#length_1|, cstrnlen_#t~mem2=|v_cstrnlen_#t~mem2_1|, cstrnlen_~cp~2.offset=v_cstrnlen_~cp~2.offset_3} AuxVars[] AssignedVars[cstrnlen_#t~mem2] [2018-01-28 23:35:43,686 INFO L84 mationBacktranslator]: Skipped ATE [351] [351] L544''''-->L544'''''': Formula: (let ((.cse0 (= 0 |v_cstrnlen_#t~mem2_2|))) (or (and |v_cstrnlen_#t~short3_3| (not .cse0)) (and (not |v_cstrnlen_#t~short3_3|) .cse0))) InVars {cstrnlen_#t~mem2=|v_cstrnlen_#t~mem2_2|} OutVars{cstrnlen_#t~mem2=|v_cstrnlen_#t~mem2_2|, cstrnlen_#t~short3=|v_cstrnlen_#t~short3_3|} AuxVars[] AssignedVars[cstrnlen_#t~short3] [2018-01-28 23:35:43,687 INFO L84 mationBacktranslator]: Skipped ATE [349] [349] L544''''''-->L544'''''''''': Formula: |v_cstrnlen_#t~short3_7| InVars {cstrnlen_#t~short3=|v_cstrnlen_#t~short3_7|} OutVars{cstrnlen_#t~short3=|v_cstrnlen_#t~short3_7|} AuxVars[] AssignedVars[] [2018-01-28 23:35:43,687 INFO L84 mationBacktranslator]: Skipped ATE [355] [355] L544''''''''''-->L544''''''''''': Formula: true InVars {} OutVars{cstrnlen_#t~mem2=|v_cstrnlen_#t~mem2_4|} AuxVars[] AssignedVars[cstrnlen_#t~mem2] [2018-01-28 23:35:43,687 INFO L84 mationBacktranslator]: Skipped ATE [359] [359] L544'''''''''''-->L544'''''''''''': Formula: true InVars {} OutVars{cstrnlen_#t~short3=|v_cstrnlen_#t~short3_8|} AuxVars[] AssignedVars[cstrnlen_#t~short3] [2018-01-28 23:35:43,687 INFO L84 mationBacktranslator]: Skipped ATE [361] [361] L544''''''''''''-->L544''''''''''''': Formula: (and (= |v_cstrnlen_#t~post0.offset_1| v_cstrnlen_~cp~2.offset_5) (= |v_cstrnlen_#t~post0.base_1| v_cstrnlen_~cp~2.base_6)) InVars {cstrnlen_~cp~2.base=v_cstrnlen_~cp~2.base_6, cstrnlen_~cp~2.offset=v_cstrnlen_~cp~2.offset_5} OutVars{cstrnlen_~cp~2.base=v_cstrnlen_~cp~2.base_6, cstrnlen_#t~post0.base=|v_cstrnlen_#t~post0.base_1|, cstrnlen_#t~post0.offset=|v_cstrnlen_#t~post0.offset_1|, cstrnlen_~cp~2.offset=v_cstrnlen_~cp~2.offset_5} AuxVars[] AssignedVars[cstrnlen_#t~post0.base, cstrnlen_#t~post0.offset] [2018-01-28 23:35:43,687 INFO L84 mationBacktranslator]: Skipped ATE [363] [363] L544'''''''''''''-->L544'''''''''''''': Formula: (and (= v_cstrnlen_~cp~2.offset_6 (+ |v_cstrnlen_#t~post0.offset_2| 1)) (= v_cstrnlen_~cp~2.base_7 |v_cstrnlen_#t~post0.base_2|)) InVars {cstrnlen_#t~post0.base=|v_cstrnlen_#t~post0.base_2|, cstrnlen_#t~post0.offset=|v_cstrnlen_#t~post0.offset_2|} OutVars{cstrnlen_~cp~2.base=v_cstrnlen_~cp~2.base_7, cstrnlen_#t~post0.base=|v_cstrnlen_#t~post0.base_2|, cstrnlen_#t~post0.offset=|v_cstrnlen_#t~post0.offset_2|, cstrnlen_~cp~2.offset=v_cstrnlen_~cp~2.offset_6} AuxVars[] AssignedVars[cstrnlen_~cp~2.base, cstrnlen_~cp~2.offset] [2018-01-28 23:35:43,687 INFO L84 mationBacktranslator]: Skipped ATE [365] [365] L544''''''''''''''-->L544''''''''''''''': Formula: true InVars {} OutVars{cstrnlen_#t~post0.base=|v_cstrnlen_#t~post0.base_3|, cstrnlen_#t~post0.offset=|v_cstrnlen_#t~post0.offset_3|} AuxVars[] AssignedVars[cstrnlen_#t~post0.base, cstrnlen_#t~post0.offset] [2018-01-28 23:35:43,688 INFO L84 mationBacktranslator]: Skipped ATE [367] [367] L544'''''''''''''''-->L544'''''''''''''''': Formula: (= |v_cstrnlen_#t~post1_1| v_cstrnlen_~maxlen_3) InVars {cstrnlen_~maxlen=v_cstrnlen_~maxlen_3} OutVars{cstrnlen_~maxlen=v_cstrnlen_~maxlen_3, cstrnlen_#t~post1=|v_cstrnlen_#t~post1_1|} AuxVars[] AssignedVars[cstrnlen_#t~post1] [2018-01-28 23:35:43,688 INFO L84 mationBacktranslator]: Skipped ATE [369] [369] L544''''''''''''''''-->L544''''''''''''''''': Formula: (= v_cstrnlen_~maxlen_4 (+ |v_cstrnlen_#t~post1_2| (- 1))) InVars {cstrnlen_#t~post1=|v_cstrnlen_#t~post1_2|} OutVars{cstrnlen_~maxlen=v_cstrnlen_~maxlen_4, cstrnlen_#t~post1=|v_cstrnlen_#t~post1_2|} AuxVars[] AssignedVars[cstrnlen_~maxlen] [2018-01-28 23:35:43,688 INFO L84 mationBacktranslator]: Skipped ATE [371] [371] L544'''''''''''''''''-->L544'''''''''''''''''': Formula: true InVars {} OutVars{cstrnlen_#t~post1=|v_cstrnlen_#t~post1_3|} AuxVars[] AssignedVars[cstrnlen_#t~post1] [2018-01-28 23:35:43,688 INFO L84 mationBacktranslator]: Skipped ATE [327] [327] L544''''''''''''''''''-->L544': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:35:43,688 INFO L84 mationBacktranslator]: Skipped ATE [331] [331] L544'-->L544'': Formula: (let ((.cse0 (= 0 (mod v_cstrnlen_~maxlen_2 4294967296)))) (or (and (not .cse0) |v_cstrnlen_#t~short3_1|) (and (not |v_cstrnlen_#t~short3_1|) .cse0))) InVars {cstrnlen_~maxlen=v_cstrnlen_~maxlen_2} OutVars{cstrnlen_#t~short3=|v_cstrnlen_#t~short3_1|, cstrnlen_~maxlen=v_cstrnlen_~maxlen_2} AuxVars[] AssignedVars[cstrnlen_#t~short3] [2018-01-28 23:35:43,688 INFO L84 mationBacktranslator]: Skipped ATE [335] [335] L544''-->L544''': Formula: |v_cstrnlen_#t~short3_2| InVars {cstrnlen_#t~short3=|v_cstrnlen_#t~short3_2|} OutVars{cstrnlen_#t~short3=|v_cstrnlen_#t~short3_2|} AuxVars[] AssignedVars[] [2018-01-28 23:35:43,688 INFO L84 mationBacktranslator]: Skipped ATE [345] [345] L544'''-->cstrnlenErr1RequiresViolation: Formula: (or (not (<= (+ v_cstrnlen_~cp~2.offset_4 1) (select |v_#length_2| v_cstrnlen_~cp~2.base_5))) (not (<= 0 v_cstrnlen_~cp~2.offset_4))) InVars {cstrnlen_~cp~2.base=v_cstrnlen_~cp~2.base_5, #length=|v_#length_2|, cstrnlen_~cp~2.offset=v_cstrnlen_~cp~2.offset_4} OutVars{cstrnlen_~cp~2.base=v_cstrnlen_~cp~2.base_5, #length=|v_#length_2|, cstrnlen_~cp~2.offset=v_cstrnlen_~cp~2.offset_4} AuxVars[] AssignedVars[] [2018-01-28 23:35:43,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:35:43 BasicIcfg [2018-01-28 23:35:43,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:35:43,696 INFO L168 Benchmark]: Toolchain (without parser) took 9375.00 ms. Allocated memory was 297.3 MB in the beginning and 984.1 MB in the end (delta: 686.8 MB). Free memory was 256.3 MB in the beginning and 800.1 MB in the end (delta: -543.7 MB). Peak memory consumption was 143.1 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:43,696 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 297.3 MB. Free memory is still 262.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:35:43,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.54 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 246.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:43,697 INFO L168 Benchmark]: Boogie Preprocessor took 27.51 ms. Allocated memory is still 297.3 MB. Free memory was 246.3 MB in the beginning and 244.4 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:35:43,697 INFO L168 Benchmark]: RCFGBuilder took 223.25 ms. Allocated memory is still 297.3 MB. Free memory was 244.4 MB in the beginning and 227.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:43,698 INFO L168 Benchmark]: IcfgTransformer took 7329.59 ms. Allocated memory was 297.3 MB in the beginning and 790.6 MB in the end (delta: 493.4 MB). Free memory was 227.8 MB in the beginning and 511.8 MB in the end (delta: -284.0 MB). Peak memory consumption was 209.4 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:43,698 INFO L168 Benchmark]: TraceAbstraction took 1552.25 ms. Allocated memory was 790.6 MB in the beginning and 984.1 MB in the end (delta: 193.5 MB). Free memory was 511.8 MB in the beginning and 800.1 MB in the end (delta: -288.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:35:43,700 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.13 ms. Allocated memory is still 297.3 MB. Free memory is still 262.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.54 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 246.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.51 ms. Allocated memory is still 297.3 MB. Free memory was 246.3 MB in the beginning and 244.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 223.25 ms. Allocated memory is still 297.3 MB. Free memory was 244.4 MB in the beginning and 227.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * IcfgTransformer took 7329.59 ms. Allocated memory was 297.3 MB in the beginning and 790.6 MB in the end (delta: 493.4 MB). Free memory was 227.8 MB in the beginning and 511.8 MB in the end (delta: -284.0 MB). Peak memory consumption was 209.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1552.25 ms. Allocated memory was 790.6 MB in the beginning and 984.1 MB in the end (delta: 193.5 MB). Free memory was 511.8 MB in the beginning and 800.1 MB in the end (delta: -288.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 53 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 516 LocStat_NO_SUPPORTING_DISEQUALITIES : 110 LocStat_NO_DISJUNCTIONS : -106 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 72 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 83 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 75 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.775326 RENAME_VARIABLES(MILLISECONDS) : 0.126506 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.842638 PROJECTAWAY(MILLISECONDS) : 0.066065 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.160250 DISJOIN(MILLISECONDS) : 0.133166 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.143209 ADD_EQUALITY(MILLISECONDS) : 0.022247 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008603 #CONJOIN_DISJUNCTIVE : 598 #RENAME_VARIABLES : 1318 #UNFREEZE : 0 #CONJOIN : 832 #PROJECTAWAY : 785 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 144 #RENAME_VARIABLES_DISJUNCTIVE : 1280 #ADD_EQUALITY : 84 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * 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] : 2 * 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, 56 locations, 5 error locations. UNSAFE Result, 1.4s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 310 SDtfs, 246 SDslu, 541 SDs, 0 SdLazy, 209 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred 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, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 11759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 7/7 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_cstrnlen-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-35-43-710.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-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-35-43-710.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-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-35-43-710.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-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-35-43-710.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-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-35-43-710.csv Received shutdown request...