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/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:49:51,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:49:51,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:49:51,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:49:51,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:49:51,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:49:51,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:49:51,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:49:51,313 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:49:51,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:49:51,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:49:51,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:49:51,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:49:51,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:49:51,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:49:51,319 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:49:51,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:49:51,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:49:51,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:49:51,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:49:51,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:49:51,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:49:51,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:49:51,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:49:51,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:49:51,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:49:51,328 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:49:51,329 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:49:51,329 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:49:51,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:49:51,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:49:51,330 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 01:49:51,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:49:51,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:49:51,341 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:49:51,341 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:49:51,341 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:49:51,341 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:49:51,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:49:51,341 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:49:51,342 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:49:51,342 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:49:51,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:49:51,342 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:49:51,342 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:49:51,342 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:49:51,342 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:49:51,343 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:49:51,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:49:51,343 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:49:51,343 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:49:51,343 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:49:51,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:49:51,343 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:49:51,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:49:51,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:49:51,381 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:49:51,384 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:49:51,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:49:51,386 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:49:51,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:49:51,542 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:49:51,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:49:51,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:49:51,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:49:51,551 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:49:51,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:49:51" (1/1) ... [2018-02-04 01:49:51,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4762d03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51, skipping insertion in model container [2018-02-04 01:49:51,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:49:51" (1/1) ... [2018-02-04 01:49:51,571 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:49:51,601 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:49:51,692 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:49:51,704 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:49:51,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51 WrapperNode [2018-02-04 01:49:51,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:49:51,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:49:51,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:49:51,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:49:51,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 01:49:51,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 01:49:51,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 01:49:51,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 01:49:51,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 01:49:51,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 01:49:51,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 01:49:51,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:49:51,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:49:51,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:49:51,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:49:51,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 01:49:51,772 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:49:51,772 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:49:51,772 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-02-04 01:49:51,772 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:49:51,773 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:49:51,900 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:49:51,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:49:51 BoogieIcfgContainer [2018-02-04 01:49:51,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:49:51,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:49:51,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:49:51,903 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:49:51,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:49:51" (1/3) ... [2018-02-04 01:49:51,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480b1e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:49:51, skipping insertion in model container [2018-02-04 01:49:51,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (2/3) ... [2018-02-04 01:49:51,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480b1e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:49:51, skipping insertion in model container [2018-02-04 01:49:51,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:49:51" (3/3) ... [2018-02-04 01:49:51,905 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:49:51,911 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:49:51,915 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 01:49:51,944 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:49:51,944 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:49:51,944 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:49:51,944 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:49:51,945 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:49:51,945 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:49:51,945 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:49:51,945 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:49:51,945 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:49:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-02-04 01:49:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:49:51,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:51,971 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:51,971 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501255, now seen corresponding path program 1 times [2018-02-04 01:49:52,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:52,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:52,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:49:52,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,143 INFO L182 omatonBuilderFactory]: Interpolants [50#true, 51#false, 52#(= (select |#valid| |main_#t~malloc6.base|) 1), 53#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 01:49:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:49:52,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:49:52,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:49:52,159 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2018-02-04 01:49:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:52,227 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-02-04 01:49:52,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:49:52,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:49:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:52,315 INFO L225 Difference]: With dead ends: 46 [2018-02-04 01:49:52,315 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 01:49:52,316 INFO L554 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-02-04 01:49:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 01:49:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 01:49:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 01:49:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 01:49:52,341 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2018-02-04 01:49:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:52,342 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 01:49:52,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:49:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 01:49:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:49:52,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:52,342 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:52,342 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501254, now seen corresponding path program 1 times [2018-02-04 01:49:52,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:52,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:52,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:49:52,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,448 INFO L182 omatonBuilderFactory]: Interpolants [145#true, 146#false, 147#(<= 1 main_~length1~0), 148#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc6.base|) 1)), 149#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 150#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 01:49:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:49:52,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:49:52,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:49:52,450 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-02-04 01:49:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:52,508 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-04 01:49:52,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:49:52,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 01:49:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:52,509 INFO L225 Difference]: With dead ends: 42 [2018-02-04 01:49:52,509 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 01:49:52,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:49:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 01:49:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 01:49:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 01:49:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 01:49:52,514 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-02-04 01:49:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:52,514 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 01:49:52,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:49:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 01:49:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:49:52,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:52,515 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:52,515 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:52,515 INFO L82 PathProgramCache]: Analyzing trace with hash -76898612, now seen corresponding path program 1 times [2018-02-04 01:49:52,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:52,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:52,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:49:52,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,546 INFO L182 omatonBuilderFactory]: Interpolants [240#(= 1 (select |#valid| main_~nondetString2~0.base)), 237#true, 238#false, 239#(= 1 (select |#valid| |main_#t~malloc7.base|))] [2018-02-04 01:49:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:49:52,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:49:52,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:49:52,546 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2018-02-04 01:49:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:52,597 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-02-04 01:49:52,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:49:52,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 01:49:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:52,598 INFO L225 Difference]: With dead ends: 41 [2018-02-04 01:49:52,598 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 01:49:52,598 INFO L554 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-02-04 01:49:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 01:49:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 01:49:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:49:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 01:49:52,602 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-02-04 01:49:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:52,602 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 01:49:52,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:49:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 01:49:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:49:52,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:52,603 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:52,603 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash -76898611, now seen corresponding path program 1 times [2018-02-04 01:49:52,604 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:52,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:52,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:49:52,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,667 INFO L182 omatonBuilderFactory]: Interpolants [325#true, 326#false, 327#(<= 1 main_~length2~0), 328#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 329#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 01:49:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:49:52,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:49:52,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:49:52,668 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-02-04 01:49:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:52,693 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-02-04 01:49:52,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:49:52,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 01:49:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:52,693 INFO L225 Difference]: With dead ends: 40 [2018-02-04 01:49:52,694 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 01:49:52,694 INFO L554 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-02-04 01:49:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 01:49:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 01:49:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 01:49:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-02-04 01:49:52,696 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2018-02-04 01:49:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:52,696 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-02-04 01:49:52,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:49:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-02-04 01:49:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:49:52,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:52,696 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:52,697 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:52,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085779, now seen corresponding path program 1 times [2018-02-04 01:49:52,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:52,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:52,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:49:52,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,737 INFO L182 omatonBuilderFactory]: Interpolants [416#(= 1 (select |#valid| cstrpbrk_~s1.base)), 417#(= 1 (select |#valid| |cstrpbrk_#t~post0.base|)), 412#true, 413#false, 414#(= 1 (select |#valid| main_~nondetString1~0.base)), 415#(= 1 (select |#valid| |cstrpbrk_#in~s1.base|))] [2018-02-04 01:49:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:49:52,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:49:52,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:49:52,737 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-02-04 01:49:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:52,781 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-02-04 01:49:52,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:49:52,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 01:49:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:52,782 INFO L225 Difference]: With dead ends: 39 [2018-02-04 01:49:52,782 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 01:49:52,783 INFO L554 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-02-04 01:49:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 01:49:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 01:49:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 01:49:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-02-04 01:49:52,785 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 19 [2018-02-04 01:49:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:52,785 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-02-04 01:49:52,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:49:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-02-04 01:49:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:49:52,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:52,786 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:52,786 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085778, now seen corresponding path program 1 times [2018-02-04 01:49:52,786 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:52,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:52,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:49:52,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,885 INFO L182 omatonBuilderFactory]: Interpolants [500#true, 501#false, 502#(<= 1 main_~length1~0), 503#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0)), 504#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 505#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 506#(and (= 0 |cstrpbrk_#in~s1.offset|) (<= 1 (select |#length| |cstrpbrk_#in~s1.base|))), 507#(and (<= 1 (select |#length| cstrpbrk_~s1.base)) (= 0 cstrpbrk_~s1.offset)), 508#(and (= |cstrpbrk_#t~post0.offset| 0) (<= 1 (select |#length| |cstrpbrk_#t~post0.base|)))] [2018-02-04 01:49:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:52,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:49:52,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:49:52,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:49:52,889 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-02-04 01:49:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:52,991 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-02-04 01:49:52,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:49:52,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 01:49:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:52,992 INFO L225 Difference]: With dead ends: 44 [2018-02-04 01:49:52,992 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 01:49:52,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:49:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 01:49:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-02-04 01:49:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 01:49:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 01:49:52,995 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-02-04 01:49:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:52,995 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 01:49:52,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:49:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 01:49:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:49:52,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:52,996 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:52,999 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash -551391085, now seen corresponding path program 1 times [2018-02-04 01:49:52,999 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:53,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:53,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-02-04 01:49:53,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:53,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:49:53,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:53,056 INFO L182 omatonBuilderFactory]: Interpolants [608#(= 1 (select |#valid| |cstrpbrk_#in~s2.base|)), 609#(= 1 (select |#valid| cstrpbrk_~s2.base)), 610#(= 1 (select |#valid| cstrpbrk_~scanp~0.base)), 611#(= 1 (select |#valid| |cstrpbrk_#t~post2.base|)), 605#true, 606#false, 607#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-04 01:49:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:53,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:49:53,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:49:53,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:49:53,057 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-02-04 01:49:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:53,139 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-04 01:49:53,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:49:53,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 01:49:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:53,142 INFO L225 Difference]: With dead ends: 46 [2018-02-04 01:49:53,143 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 01:49:53,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-02-04 01:49:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 01:49:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-02-04 01:49:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:49:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 01:49:53,146 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2018-02-04 01:49:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:53,146 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 01:49:53,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:49:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 01:49:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:49:53,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:53,147 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:53,147 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash -551391084, now seen corresponding path program 1 times [2018-02-04 01:49:53,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:53,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:53,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:53,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:49:53,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:53,275 INFO L182 omatonBuilderFactory]: Interpolants [705#true, 706#false, 707#(<= 1 main_~length2~0), 708#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 709#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 710#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 711#(and (<= 1 (select |#length| |cstrpbrk_#in~s2.base|)) (= 0 |cstrpbrk_#in~s2.offset|)), 712#(and (<= 1 (select |#length| cstrpbrk_~s2.base)) (= 0 cstrpbrk_~s2.offset)), 713#(and (<= 1 (select |#length| cstrpbrk_~scanp~0.base)) (= 0 cstrpbrk_~scanp~0.offset)), 714#(and (= |cstrpbrk_#t~post2.offset| 0) (<= 1 (select |#length| |cstrpbrk_#t~post2.base|)))] [2018-02-04 01:49:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:53,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:49:53,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:49:53,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:49:53,276 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-02-04 01:49:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:53,383 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-02-04 01:49:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:49:53,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 01:49:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:53,384 INFO L225 Difference]: With dead ends: 45 [2018-02-04 01:49:53,384 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 01:49:53,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:49:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 01:49:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-02-04 01:49:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 01:49:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 01:49:53,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2018-02-04 01:49:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:53,386 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 01:49:53,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:49:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 01:49:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:49:53,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:53,387 INFO L351 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] [2018-02-04 01:49:53,387 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:53,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1601452084, now seen corresponding path program 1 times [2018-02-04 01:49:53,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:53,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:53,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:53,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 01:49:53,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:53,570 INFO L182 omatonBuilderFactory]: Interpolants [811#true, 812#false, 813#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 814#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc6.base|) 1)), 815#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 816#(and (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 817#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 818#(and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 819#(= 0 (select (select |#memory_int| |cstrpbrk_#in~s1.base|) |cstrpbrk_#in~s1.offset|)), 820#(= 0 (select (select |#memory_int| cstrpbrk_~s1.base) cstrpbrk_~s1.offset)), 821#(= 0 (select (select |#memory_int| |cstrpbrk_#t~post0.base|) |cstrpbrk_#t~post0.offset|)), 822#(= 0 |cstrpbrk_#t~mem1|), 823#(= 0 cstrpbrk_~c~0)] [2018-02-04 01:49:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:53,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:49:53,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:49:53,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:49:53,571 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-02-04 01:49:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:53,824 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 01:49:53,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:49:53,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-04 01:49:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:53,825 INFO L225 Difference]: With dead ends: 69 [2018-02-04 01:49:53,825 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 01:49:53,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-02-04 01:49:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 01:49:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-02-04 01:49:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 01:49:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 01:49:53,828 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 28 [2018-02-04 01:49:53,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:53,828 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 01:49:53,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:49:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 01:49:53,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:49:53,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:53,829 INFO L351 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] [2018-02-04 01:49:53,829 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:53,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1820306802, now seen corresponding path program 1 times [2018-02-04 01:49:53,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:53,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:54,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:54,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:49:54,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:54,015 INFO L182 omatonBuilderFactory]: Interpolants [975#true, 976#false, 977#(<= 1 main_~length1~0), 978#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc6.base|) 1)), 979#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 980#(and (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 981#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 982#(and (= 0 main_~nondetString1~0.offset) (or (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (<= 2 (select |#length| main_~nondetString1~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 983#(and (= 0 |cstrpbrk_#in~s1.offset|) (or (<= 2 (select |#length| |cstrpbrk_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrpbrk_#in~s1.base|) |cstrpbrk_#in~s1.offset|)))), 984#(and (= 0 cstrpbrk_~s1.offset) (or (= 0 (select (select |#memory_int| cstrpbrk_~s1.base) cstrpbrk_~s1.offset)) (<= 2 (select |#length| cstrpbrk_~s1.base)))), 985#(and (= |cstrpbrk_#t~post0.offset| 0) (or (= 0 (select (select |#memory_int| |cstrpbrk_#t~post0.base|) |cstrpbrk_#t~post0.offset|)) (and (= |cstrpbrk_#t~post0.base| cstrpbrk_~s1.base) (<= (+ cstrpbrk_~s1.offset 1) (+ |cstrpbrk_#t~post0.offset| (select |#length| |cstrpbrk_#t~post0.base|))) (<= (+ |cstrpbrk_#t~post0.offset| 1) cstrpbrk_~s1.offset)))), 986#(or (and (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (<= 1 cstrpbrk_~s1.offset)) (= 0 |cstrpbrk_#t~mem1|)), 987#(or (and (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (<= 1 cstrpbrk_~s1.offset)) (= 0 cstrpbrk_~c~0)), 988#(and (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (<= 1 cstrpbrk_~s1.offset)), 989#(and (<= 1 |cstrpbrk_#t~post0.offset|) (<= (+ |cstrpbrk_#t~post0.offset| 1) (select |#length| |cstrpbrk_#t~post0.base|)))] [2018-02-04 01:49:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:54,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:49:54,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:49:54,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:49:54,016 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 15 states. [2018-02-04 01:49:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:54,385 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-02-04 01:49:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 01:49:54,385 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-02-04 01:49:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:54,386 INFO L225 Difference]: With dead ends: 79 [2018-02-04 01:49:54,386 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 01:49:54,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:49:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 01:49:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2018-02-04 01:49:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 01:49:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-04 01:49:54,390 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 28 [2018-02-04 01:49:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:54,390 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-04 01:49:54,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:49:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-04 01:49:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:49:54,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:54,391 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:54,392 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1820393708, now seen corresponding path program 1 times [2018-02-04 01:49:54,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:54,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:54,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:54,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 01:49:54,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:54,508 INFO L182 omatonBuilderFactory]: Interpolants [1168#false, 1169#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1170#(and (= 0 |main_#t~malloc7.offset|) (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1171#(and (= main_~nondetString2~0.offset 0) (= 1 (+ main_~nondetString2~0.offset main_~length2~0))), 1172#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1173#(= 0 (select (select |#memory_int| |cstrpbrk_#in~s2.base|) |cstrpbrk_#in~s2.offset|)), 1174#(= 0 (select (select |#memory_int| cstrpbrk_~s2.base) cstrpbrk_~s2.offset)), 1175#(= 0 (select (select |#memory_int| cstrpbrk_~scanp~0.base) cstrpbrk_~scanp~0.offset)), 1176#(= 0 (select (select |#memory_int| |cstrpbrk_#t~post2.base|) |cstrpbrk_#t~post2.offset|)), 1177#(= 0 |cstrpbrk_#t~mem3|), 1178#(= 0 cstrpbrk_~sc~0), 1167#true] [2018-02-04 01:49:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:54,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:49:54,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:49:54,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:49:54,509 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 12 states. [2018-02-04 01:49:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:54,711 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-02-04 01:49:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:49:54,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 01:49:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:54,712 INFO L225 Difference]: With dead ends: 135 [2018-02-04 01:49:54,713 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 01:49:54,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:49:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 01:49:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2018-02-04 01:49:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 01:49:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-02-04 01:49:54,718 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 28 [2018-02-04 01:49:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:54,719 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-02-04 01:49:54,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:49:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-02-04 01:49:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:49:54,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:54,719 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:54,719 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:54,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2051871762, now seen corresponding path program 1 times [2018-02-04 01:49:54,720 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:54,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:54,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:54,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:49:54,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:54,915 INFO L182 omatonBuilderFactory]: Interpolants [1440#true, 1441#false, 1442#(<= 1 main_~length2~0), 1443#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1444#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 1445#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 1446#(and (= 0 |cstrpbrk_#in~s2.offset|) (or (= 0 (select (select |#memory_int| |cstrpbrk_#in~s2.base|) |cstrpbrk_#in~s2.offset|)) (<= 2 (select |#length| |cstrpbrk_#in~s2.base|)))), 1447#(and (or (<= 2 (select |#length| cstrpbrk_~s2.base)) (= 0 (select (select |#memory_int| cstrpbrk_~s2.base) cstrpbrk_~s2.offset))) (= 0 cstrpbrk_~s2.offset)), 1448#(and (or (<= 2 (select |#length| cstrpbrk_~scanp~0.base)) (= 0 (select (select |#memory_int| cstrpbrk_~scanp~0.base) cstrpbrk_~scanp~0.offset))) (= 0 cstrpbrk_~scanp~0.offset)), 1449#(and (= |cstrpbrk_#t~post2.offset| 0) (<= (+ |cstrpbrk_#t~post2.offset| 1) cstrpbrk_~scanp~0.offset) (or (= 0 (select (select |#memory_int| |cstrpbrk_#t~post2.base|) |cstrpbrk_#t~post2.offset|)) (<= (+ cstrpbrk_~scanp~0.offset 1) (+ (select |#length| cstrpbrk_~scanp~0.base) |cstrpbrk_#t~post2.offset|)))), 1450#(and (or (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base)) (= 0 |cstrpbrk_#t~mem3|)) (<= 1 cstrpbrk_~scanp~0.offset)), 1451#(and (or (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base)) (= 0 cstrpbrk_~sc~0)) (<= 1 cstrpbrk_~scanp~0.offset)), 1452#(and (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base)) (<= 1 cstrpbrk_~scanp~0.offset)), 1453#(and (<= 1 |cstrpbrk_#t~post2.offset|) (<= (+ |cstrpbrk_#t~post2.offset| 1) (select |#length| |cstrpbrk_#t~post2.base|)))] [2018-02-04 01:49:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:54,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:49:54,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:49:54,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:49:54,916 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 14 states. [2018-02-04 01:49:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:55,304 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2018-02-04 01:49:55,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:49:55,305 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-02-04 01:49:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:55,306 INFO L225 Difference]: With dead ends: 135 [2018-02-04 01:49:55,306 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 01:49:55,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:49:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 01:49:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2018-02-04 01:49:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 01:49:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-02-04 01:49:55,312 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 28 [2018-02-04 01:49:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:55,312 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-02-04 01:49:55,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:49:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-02-04 01:49:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 01:49:55,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:55,314 INFO L351 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] [2018-02-04 01:49:55,314 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:55,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1662272263, now seen corresponding path program 1 times [2018-02-04 01:49:55,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:55,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:55,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:55,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:49:55,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:55,381 INFO L182 omatonBuilderFactory]: Interpolants [1728#(and (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1729#(and (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= (store (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |main_#t~malloc7.base| 0) |old(#valid)|)), 1730#(= |old(#valid)| (store |#valid| |main_#t~malloc7.base| (select (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc7.base|))), 1725#true, 1726#false, 1727#(= |#valid| |old(#valid)|)] [2018-02-04 01:49:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:55,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:49:55,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:49:55,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:49:55,382 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 6 states. [2018-02-04 01:49:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:55,433 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-04 01:49:55,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:49:55,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 01:49:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:55,434 INFO L225 Difference]: With dead ends: 113 [2018-02-04 01:49:55,434 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 01:49:55,434 INFO L554 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-02-04 01:49:55,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 01:49:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 01:49:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 01:49:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-02-04 01:49:55,436 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 30 [2018-02-04 01:49:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:55,436 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-02-04 01:49:55,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:49:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-02-04 01:49:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:49:55,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:55,437 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 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] [2018-02-04 01:49:55,437 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash -795993964, now seen corresponding path program 2 times [2018-02-04 01:49:55,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:55,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:55,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:55,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:49:55,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:55,642 INFO L182 omatonBuilderFactory]: Interpolants [1932#true, 1933#false, 1934#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1935#(and (= 0 main_~nondetString2~0.offset) (or (= main_~length2~0 (select |#length| main_~nondetString2~0.base)) (= 2 (+ main_~nondetString2~0.offset main_~length2~0)))), 1936#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 1937#(and (or (= 0 (select (select |#memory_int| |cstrpbrk_#in~s2.base|) 1)) (<= (select |#length| |cstrpbrk_#in~s2.base|) 1) (<= 3 (select |#length| |cstrpbrk_#in~s2.base|))) (= 0 |cstrpbrk_#in~s2.offset|)), 1938#(and (= 0 cstrpbrk_~s2.offset) (or (<= 3 (select |#length| cstrpbrk_~s2.base)) (= 0 (select (select |#memory_int| cstrpbrk_~s2.base) 1)) (<= (select |#length| cstrpbrk_~s2.base) 1))), 1939#(and (or (= 0 (select (select |#memory_int| cstrpbrk_~scanp~0.base) 1)) (<= (select |#length| cstrpbrk_~scanp~0.base) 1) (<= 3 (select |#length| cstrpbrk_~scanp~0.base))) (= 0 cstrpbrk_~scanp~0.offset)), 1940#(and (= |cstrpbrk_#t~post2.offset| 0) (<= (+ |cstrpbrk_#t~post2.offset| 1) cstrpbrk_~scanp~0.offset) (or (= 0 (select (select |#memory_int| cstrpbrk_~scanp~0.base) 1)) (<= (+ cstrpbrk_~scanp~0.offset 2) (+ (select |#length| cstrpbrk_~scanp~0.base) |cstrpbrk_#t~post2.offset|)) (<= (+ (select |#length| cstrpbrk_~scanp~0.base) |cstrpbrk_#t~post2.offset|) cstrpbrk_~scanp~0.offset)) (<= cstrpbrk_~scanp~0.offset (+ |cstrpbrk_#t~post2.offset| 1))), 1941#(and (or (= 0 (select (select |#memory_int| cstrpbrk_~scanp~0.base) 1)) (<= (+ cstrpbrk_~scanp~0.offset 2) (select |#length| cstrpbrk_~scanp~0.base)) (<= (select |#length| cstrpbrk_~scanp~0.base) cstrpbrk_~scanp~0.offset)) (<= cstrpbrk_~scanp~0.offset 1) (<= 1 cstrpbrk_~scanp~0.offset)), 1942#(and (or (= 0 (select (select |#memory_int| |cstrpbrk_#t~post2.base|) |cstrpbrk_#t~post2.offset|)) (and (<= 2 cstrpbrk_~scanp~0.offset) (or (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base)) (<= (select |#length| |cstrpbrk_#t~post2.base|) |cstrpbrk_#t~post2.offset|)))) (= 1 |cstrpbrk_#t~post2.offset|)), 1943#(or (and (<= 2 cstrpbrk_~scanp~0.offset) (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base))) (= 0 |cstrpbrk_#t~mem3|)), 1944#(or (and (<= 2 cstrpbrk_~scanp~0.offset) (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base))) (= 0 cstrpbrk_~sc~0)), 1945#(and (<= 2 cstrpbrk_~scanp~0.offset) (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base))), 1946#(and (<= 2 |cstrpbrk_#t~post2.offset|) (<= (+ |cstrpbrk_#t~post2.offset| 1) (select |#length| |cstrpbrk_#t~post2.base|)))] [2018-02-04 01:49:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:55,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:49:55,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:49:55,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:49:55,643 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 15 states. [2018-02-04 01:49:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:56,188 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-02-04 01:49:56,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 01:49:56,188 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-02-04 01:49:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:56,189 INFO L225 Difference]: With dead ends: 110 [2018-02-04 01:49:56,189 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 01:49:56,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:49:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 01:49:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2018-02-04 01:49:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 01:49:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-02-04 01:49:56,193 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 33 [2018-02-04 01:49:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:56,193 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-02-04 01:49:56,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:49:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-02-04 01:49:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 01:49:56,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:56,194 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:56,195 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash 184039152, now seen corresponding path program 2 times [2018-02-04 01:49:56,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:56,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:56,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:56,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:49:56,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:56,538 INFO L182 omatonBuilderFactory]: Interpolants [2181#true, 2182#false, 2183#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 2184#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 2185#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 2186#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2187#(and (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2188#(and (= 0 |cstrpbrk_#in~s1.offset|) (or (= 0 (select (select |#memory_int| |cstrpbrk_#in~s1.base|) 1)) (<= 3 (select |#length| |cstrpbrk_#in~s1.base|)) (<= (select |#length| |cstrpbrk_#in~s1.base|) 1))), 2189#(and (or (= 0 (select (select |#memory_int| cstrpbrk_~s1.base) 1)) (<= 3 (select |#length| cstrpbrk_~s1.base)) (<= (select |#length| cstrpbrk_~s1.base) 1)) (= 0 cstrpbrk_~s1.offset)), 2190#(and (= |cstrpbrk_#t~post0.offset| 0) (or (and (= |cstrpbrk_#t~post0.base| cstrpbrk_~s1.base) (= 0 (select (select |#memory_int| |cstrpbrk_#t~post0.base|) 1)) (<= cstrpbrk_~s1.offset (+ |cstrpbrk_#t~post0.offset| 1)) (<= (+ |cstrpbrk_#t~post0.offset| 1) cstrpbrk_~s1.offset)) (and (or (<= (+ cstrpbrk_~s1.offset 2) (+ |cstrpbrk_#t~post0.offset| (select |#length| |cstrpbrk_#t~post0.base|))) (<= (+ |cstrpbrk_#t~post0.offset| (select |#length| |cstrpbrk_#t~post0.base|)) cstrpbrk_~s1.offset)) (= |cstrpbrk_#t~post0.base| cstrpbrk_~s1.base) (<= (+ |cstrpbrk_#t~post0.offset| 1) cstrpbrk_~s1.offset)))), 2191#(or (and (= 0 (select (select |#memory_int| cstrpbrk_~s1.base) 1)) (<= 1 cstrpbrk_~s1.offset) (<= cstrpbrk_~s1.offset 1)) (and (or (<= (+ cstrpbrk_~s1.offset 2) (select |#length| cstrpbrk_~s1.base)) (<= (select |#length| cstrpbrk_~s1.base) cstrpbrk_~s1.offset)) (<= 1 cstrpbrk_~s1.offset))), 2192#(or (and (= 0 (select (select |#memory_int| |cstrpbrk_#t~post0.base|) |cstrpbrk_#t~post0.offset|)) (= 1 |cstrpbrk_#t~post0.offset|)) (and (<= 2 cstrpbrk_~s1.offset) (or (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (<= (select |#length| |cstrpbrk_#t~post0.base|) |cstrpbrk_#t~post0.offset|)))), 2193#(or (= 0 |cstrpbrk_#t~mem1|) (and (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (<= 2 cstrpbrk_~s1.offset))), 2194#(or (and (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (<= 2 cstrpbrk_~s1.offset)) (= 0 cstrpbrk_~c~0)), 2195#(and (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (<= 2 cstrpbrk_~s1.offset)), 2196#(and (<= (+ |cstrpbrk_#t~post0.offset| 1) (select |#length| |cstrpbrk_#t~post0.base|)) (<= 2 |cstrpbrk_#t~post0.offset|))] [2018-02-04 01:49:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:56,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:49:56,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:49:56,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:49:56,538 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 16 states. [2018-02-04 01:49:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:56,880 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-02-04 01:49:56,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:49:56,880 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-02-04 01:49:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:56,880 INFO L225 Difference]: With dead ends: 131 [2018-02-04 01:49:56,880 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 01:49:56,881 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:49:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 01:49:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2018-02-04 01:49:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 01:49:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-02-04 01:49:56,884 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 37 [2018-02-04 01:49:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:56,884 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-02-04 01:49:56,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:49:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-02-04 01:49:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 01:49:56,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:56,885 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:56,885 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:56,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1192420270, now seen corresponding path program 3 times [2018-02-04 01:49:56,886 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:56,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 01:49:57,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:57,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:49:57,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:57,041 INFO L182 omatonBuilderFactory]: Interpolants [2477#true, 2478#false, 2479#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 2480#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2481#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1)))))), 2482#(= 0 (select (select |#memory_int| |cstrpbrk_#in~s2.base|) (+ (select |#length| |cstrpbrk_#in~s2.base|) (- 1)))), 2483#(= 0 (select (select |#memory_int| cstrpbrk_~s2.base) (+ (select |#length| cstrpbrk_~s2.base) (- 1)))), 2484#(= 0 (select (select |#memory_int| cstrpbrk_~scanp~0.base) (+ (select |#length| cstrpbrk_~scanp~0.base) (- 1)))), 2485#(or (and (<= (+ |cstrpbrk_#t~post2.offset| 1) cstrpbrk_~scanp~0.offset) (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base))) (= 0 (select (select |#memory_int| |cstrpbrk_#t~post2.base|) |cstrpbrk_#t~post2.offset|)) (<= (select |#length| |cstrpbrk_#t~post2.base|) |cstrpbrk_#t~post2.offset|)), 2486#(or (and (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base)) (<= 1 cstrpbrk_~scanp~0.offset)) (= 0 |cstrpbrk_#t~mem3|)), 2487#(or (and (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base)) (<= 1 cstrpbrk_~scanp~0.offset)) (= 0 cstrpbrk_~sc~0)), 2488#(and (<= (+ cstrpbrk_~scanp~0.offset 1) (select |#length| cstrpbrk_~scanp~0.base)) (<= 1 cstrpbrk_~scanp~0.offset)), 2489#(and (<= 1 |cstrpbrk_#t~post2.offset|) (<= (+ |cstrpbrk_#t~post2.offset| 1) (select |#length| |cstrpbrk_#t~post2.base|)))] [2018-02-04 01:49:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 01:49:57,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:49:57,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:49:57,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:49:57,044 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 13 states. [2018-02-04 01:49:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:57,405 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-02-04 01:49:57,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:49:57,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-04 01:49:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:57,405 INFO L225 Difference]: With dead ends: 124 [2018-02-04 01:49:57,405 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 01:49:57,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:49:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 01:49:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 88. [2018-02-04 01:49:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 01:49:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-02-04 01:49:57,408 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 38 [2018-02-04 01:49:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:57,408 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-02-04 01:49:57,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:49:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-02-04 01:49:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 01:49:57,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:57,409 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:57,409 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:49:57,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1120961742, now seen corresponding path program 3 times [2018-02-04 01:49:57,410 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:57,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 01:49:57,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:57,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:49:57,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:57,601 INFO L182 omatonBuilderFactory]: Interpolants [2726#true, 2727#false, 2728#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 2729#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2730#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= main_~nondetString1~0.offset 0)), 2731#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2732#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 2733#(= 0 (select (select |#memory_int| |cstrpbrk_#in~s1.base|) (+ (select |#length| |cstrpbrk_#in~s1.base|) (- 1)))), 2734#(= 0 (select (select |#memory_int| cstrpbrk_~s1.base) (+ (select |#length| cstrpbrk_~s1.base) (- 1)))), 2735#(and (= |cstrpbrk_#t~post0.base| cstrpbrk_~s1.base) (= 0 (select (select |#memory_int| |cstrpbrk_#t~post0.base|) (+ (select |#length| |cstrpbrk_#t~post0.base|) (- 1))))), 2736#(and (or (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (= 0 (select (select |#memory_int| |cstrpbrk_#t~post0.base|) |cstrpbrk_#t~post0.offset|)) (<= (select |#length| |cstrpbrk_#t~post0.base|) |cstrpbrk_#t~post0.offset|)) (<= (+ |cstrpbrk_#t~post0.offset| 1) cstrpbrk_~s1.offset)), 2737#(and (or (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (= 0 |cstrpbrk_#t~mem1|)) (<= 1 cstrpbrk_~s1.offset)), 2738#(and (or (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (= 0 cstrpbrk_~c~0)) (<= 1 cstrpbrk_~s1.offset)), 2739#(and (<= (+ cstrpbrk_~s1.offset 1) (select |#length| cstrpbrk_~s1.base)) (<= 1 cstrpbrk_~s1.offset)), 2740#(and (<= 1 |cstrpbrk_#t~post0.offset|) (<= (+ |cstrpbrk_#t~post0.offset| 1) (select |#length| |cstrpbrk_#t~post0.base|)))] [2018-02-04 01:49:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 01:49:57,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:49:57,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:49:57,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:49:57,601 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 15 states. [2018-02-04 01:49:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:57,989 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-02-04 01:49:57,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:49:57,989 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-02-04 01:49:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:57,990 INFO L225 Difference]: With dead ends: 87 [2018-02-04 01:49:57,990 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:49:57,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-02-04 01:49:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:49:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:49:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:49:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:49:57,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-02-04 01:49:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:57,991 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:49:57,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:49:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:49:57,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:49:57,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:49:57 BoogieIcfgContainer [2018-02-04 01:49:57,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:49:57,995 INFO L168 Benchmark]: Toolchain (without parser) took 6451.92 ms. Allocated memory was 404.2 MB in the beginning and 733.0 MB in the end (delta: 328.7 MB). Free memory was 362.4 MB in the beginning and 486.0 MB in the end (delta: -123.5 MB). Peak memory consumption was 205.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:49:57,996 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:49:57,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.93 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:49:57,996 INFO L168 Benchmark]: Boogie Preprocessor took 26.52 ms. Allocated memory is still 404.2 MB. Free memory was 350.5 MB in the beginning and 349.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:49:57,996 INFO L168 Benchmark]: RCFGBuilder took 164.94 ms. Allocated memory is still 404.2 MB. Free memory was 349.2 MB in the beginning and 331.0 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:49:57,996 INFO L168 Benchmark]: TraceAbstraction took 6092.98 ms. Allocated memory was 404.2 MB in the beginning and 733.0 MB in the end (delta: 328.7 MB). Free memory was 329.7 MB in the beginning and 486.0 MB in the end (delta: -156.3 MB). Peak memory consumption was 172.5 MB. Max. memory is 5.3 GB. [2018-02-04 01:49:57,997 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.19 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.93 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.52 ms. Allocated memory is still 404.2 MB. Free memory was 350.5 MB in the beginning and 349.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 164.94 ms. Allocated memory is still 404.2 MB. Free memory was 349.2 MB in the beginning and 331.0 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6092.98 ms. Allocated memory was 404.2 MB in the beginning and 733.0 MB in the end (delta: 328.7 MB). Free memory was 329.7 MB in the beginning and 486.0 MB in the end (delta: -156.3 MB). Peak memory consumption was 172.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 9 error locations. SAFE Result, 6.0s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 548 SDtfs, 861 SDslu, 2390 SDs, 0 SdLazy, 2058 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 24/91 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, 17 MinimizatonAttempts, 135 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 112017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 24/91 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-49-58-002.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-49-58-002.csv Received shutdown request...