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/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:58:42,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:58:42,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:58:42,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:58:42,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:58:42,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:58:42,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:58:42,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:58:42,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:58:42,388 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:58:42,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:58:42,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:58:42,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:58:42,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:58:42,391 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:58:42,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:58:42,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:58:42,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:58:42,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:58:42,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:58:42,399 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:58:42,399 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:58:42,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:58:42,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:58:42,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:58:42,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:58:42,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:58:42,403 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:58:42,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:58:42,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:58:42,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:58:42,404 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 14:58:42,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:58:42,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:58:42,415 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:58:42,415 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:58:42,415 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:58:42,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:58:42,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:58:42,416 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:58:42,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:58:42,416 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:58:42,416 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:58:42,416 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:58:42,417 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:58:42,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:58:42,417 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:58:42,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:58:42,417 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:58:42,417 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:58:42,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:58:42,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:58:42,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:58:42,418 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:58:42,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:58:42,457 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:58:42,460 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:58:42,461 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:58:42,462 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:58:42,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:42,600 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:58:42,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:58:42,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:42,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:58:42,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:58:42,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:42" (1/1) ... [2018-02-04 14:58:42,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76617904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42, skipping insertion in model container [2018-02-04 14:58:42,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:42" (1/1) ... [2018-02-04 14:58:42,628 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:42,653 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:42,741 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:42,752 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:42,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42 WrapperNode [2018-02-04 14:58:42,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:42,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:58:42,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:58:42,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:58:42,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42" (1/1) ... [2018-02-04 14:58:42,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42" (1/1) ... [2018-02-04 14:58:42,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42" (1/1) ... [2018-02-04 14:58:42,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42" (1/1) ... [2018-02-04 14:58:42,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42" (1/1) ... [2018-02-04 14:58:42,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42" (1/1) ... [2018-02-04 14:58:42,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42" (1/1) ... [2018-02-04 14:58:42,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:58:42,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:58:42,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:58:42,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:58:42,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42" (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 14:58:42,820 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:58:42,820 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:58:42,820 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 14:58:42,820 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:58:42,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:58:42,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:58:42,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:58:42,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:58:42,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:58:42,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:58:42,821 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 14:58:42,821 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:58:42,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:58:42,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:58:42,918 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:58:42,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:42 BoogieIcfgContainer [2018-02-04 14:58:42,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:58:42,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:58:42,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:58:42,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:58:42,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:58:42" (1/3) ... [2018-02-04 14:58:42,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3359c60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:42, skipping insertion in model container [2018-02-04 14:58:42,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:42" (2/3) ... [2018-02-04 14:58:42,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3359c60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:42, skipping insertion in model container [2018-02-04 14:58:42,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:42" (3/3) ... [2018-02-04 14:58:42,923 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:42,928 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:58:42,933 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 14:58:42,966 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:58:42,966 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:58:42,966 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:58:42,967 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:58:42,967 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:58:42,967 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:58:42,967 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:58:42,967 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:58:42,968 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:58:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-04 14:58:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 14:58:42,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:42,988 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:42,988 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-02-04 14:58:43,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:43,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:43,162 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 14:58:43,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:43,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:43,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:43,166 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 14:58:43,166 INFO L182 omatonBuilderFactory]: Interpolants [33#true, 34#false, 35#(= 1 (select |#valid| |main_#t~malloc3.base|)), 36#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 14:58:43,166 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 14:58:43,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:58:43,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:58:43,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:58:43,180 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-02-04 14:58:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:43,250 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-04 14:58:43,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:58:43,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 14:58:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:43,296 INFO L225 Difference]: With dead ends: 29 [2018-02-04 14:58:43,296 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 14:58:43,298 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 14:58:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 14:58:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 14:58:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 14:58:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 14:58:43,321 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-04 14:58:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:43,321 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 14:58:43,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:58:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 14:58:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 14:58:43,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:43,322 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:43,322 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-02-04 14:58:43,323 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:43,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:43,385 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 14:58:43,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:43,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:58:43,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:43,385 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 14:58:43,385 INFO L182 omatonBuilderFactory]: Interpolants [96#(<= 1 main_~length1~0), 97#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 98#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 94#true, 95#false] [2018-02-04 14:58:43,385 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 14:58:43,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:58:43,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:58:43,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:43,387 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-04 14:58:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:43,408 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-04 14:58:43,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:58:43,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 14:58:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:43,409 INFO L225 Difference]: With dead ends: 25 [2018-02-04 14:58:43,409 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 14:58:43,410 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 14:58:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 14:58:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 14:58:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 14:58:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 14:58:43,412 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-02-04 14:58:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:43,412 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 14:58:43,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:58:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 14:58:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 14:58:43,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:43,413 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:43,413 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:43,413 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-02-04 14:58:43,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:43,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:43,462 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 14:58:43,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:43,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:58:43,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:43,462 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 14:58:43,463 INFO L182 omatonBuilderFactory]: Interpolants [151#true, 152#false, 153#(= 1 (select |#valid| main_~nondetString1~0.base)), 154#(= 1 (select |#valid| |cstrlen_#in~s.base|)), 155#(= 1 (select |#valid| cstrlen_~p~0.base))] [2018-02-04 14:58:43,463 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 14:58:43,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:58:43,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:58:43,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:43,464 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-02-04 14:58:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:43,517 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-02-04 14:58:43,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:58:43,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 14:58:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:43,518 INFO L225 Difference]: With dead ends: 24 [2018-02-04 14:58:43,518 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 14:58:43,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 14:58:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 14:58:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 14:58:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-04 14:58:43,521 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-02-04 14:58:43,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:43,521 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-04 14:58:43,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:58:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-04 14:58:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 14:58:43,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:43,522 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:43,522 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:43,522 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-02-04 14:58:43,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:43,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:43,607 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 14:58:43,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:43,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:58:43,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:43,607 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 14:58:43,608 INFO L182 omatonBuilderFactory]: Interpolants [208#(<= 1 main_~length1~0), 209#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 210#(and (= 0 main_~nondetString1~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0)), 211#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base))), 212#(and (<= 1 (select |#length| |cstrlen_#in~s.base|)) (= 0 |cstrlen_#in~s.offset|)), 213#(and (<= 1 (select |#length| cstrlen_~p~0.base)) (= cstrlen_~p~0.offset 0)), 206#true, 207#false] [2018-02-04 14:58:43,608 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 14:58:43,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:58:43,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:58:43,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:58:43,609 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-02-04 14:58:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:43,714 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-02-04 14:58:43,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:58:43,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-04 14:58:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:43,716 INFO L225 Difference]: With dead ends: 30 [2018-02-04 14:58:43,716 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 14:58:43,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:58:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 14:58:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-02-04 14:58:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 14:58:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 14:58:43,718 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-02-04 14:58:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:43,719 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 14:58:43,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:58:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 14:58:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 14:58:43,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:43,719 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:43,719 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:43,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-02-04 14:58:43,720 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:43,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:43,844 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 14:58:43,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:43,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:58:43,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:43,844 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 14:58:43,845 INFO L182 omatonBuilderFactory]: Interpolants [274#true, 275#false, 276#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 277#(and (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|) (<= main_~length1~0 1)), 278#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 279#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 280#(= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) |cstrlen_#in~s.offset|)), 281#(= 0 (select (select |#memory_int| cstrlen_~p~0.base) cstrlen_~p~0.offset)), 282#(= |cstrlen_#t~mem0| 0)] [2018-02-04 14:58:43,845 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 14:58:43,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:58:43,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:58:43,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:43,846 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-02-04 14:58:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:43,918 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-04 14:58:43,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:58:43,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 14:58:43,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:43,919 INFO L225 Difference]: With dead ends: 42 [2018-02-04 14:58:43,919 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 14:58:43,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:58:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 14:58:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-04 14:58:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 14:58:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-02-04 14:58:43,922 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-02-04 14:58:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:43,922 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-02-04 14:58:43,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:58:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-02-04 14:58:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 14:58:43,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:43,922 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:43,922 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-02-04 14:58:43,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:43,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:44,043 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 14:58:44,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:44,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 14:58:44,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:44,044 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 14:58:44,044 INFO L182 omatonBuilderFactory]: Interpolants [372#true, 373#false, 374#(<= 1 main_~length1~0), 375#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 376#(and (<= 1 main_~length1~0) (or (= (+ main_~nondetString1~0.offset main_~length1~0) 1) (= main_~length1~0 (select |#length| main_~nondetString1~0.base))) (= main_~nondetString1~0.offset 0)), 377#(and (or (<= 2 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset))) (= main_~nondetString1~0.offset 0)), 378#(and (= 0 |cstrlen_#in~s.offset|) (or (= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) |cstrlen_#in~s.offset|)) (<= 2 (select |#length| |cstrlen_#in~s.base|)))), 379#(and (or (<= 2 (select |#length| cstrlen_~p~0.base)) (= 0 (select (select |#memory_int| cstrlen_~p~0.base) cstrlen_~p~0.offset))) (= cstrlen_~p~0.offset 0)), 380#(and (or (<= 2 (select |#length| cstrlen_~p~0.base)) (= |cstrlen_#t~mem0| 0)) (= cstrlen_~p~0.offset 0)), 381#(and (<= 1 cstrlen_~p~0.offset) (<= (+ cstrlen_~p~0.offset 1) (select |#length| cstrlen_~p~0.base)))] [2018-02-04 14:58:44,044 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 14:58:44,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:58:44,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:58:44,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:58:44,045 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 10 states. [2018-02-04 14:58:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:44,212 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-02-04 14:58:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:58:44,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-02-04 14:58:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:44,213 INFO L225 Difference]: With dead ends: 47 [2018-02-04 14:58:44,213 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 14:58:44,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:58:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 14:58:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-02-04 14:58:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 14:58:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-02-04 14:58:44,216 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-02-04 14:58:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:44,216 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-02-04 14:58:44,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:58:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-02-04 14:58:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:58:44,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:44,217 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:44,217 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:44,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-02-04 14:58:44,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:44,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:44,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:44,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 14:58:44,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:44,373 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 14:58:44,373 INFO L182 omatonBuilderFactory]: Interpolants [481#true, 482#false, 483#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 484#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 485#(and (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= main_~nondetString1~0.offset 0)), 486#(and (or (<= 3 (select |#length| |cstrlen_#in~s.base|)) (= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) 1)) (<= (select |#length| |cstrlen_#in~s.base|) 1)) (= 0 |cstrlen_#in~s.offset|)), 487#(and (or (<= 3 (select |#length| cstrlen_~p~0.base)) (= 0 (select (select |#memory_int| cstrlen_~p~0.base) 1)) (<= (select |#length| cstrlen_~p~0.base) 1)) (= cstrlen_~p~0.offset 0)), 488#(and (<= 1 cstrlen_~p~0.offset) (or (<= (+ cstrlen_~p~0.offset 2) (select |#length| cstrlen_~p~0.base)) (<= (select |#length| cstrlen_~p~0.base) cstrlen_~p~0.offset) (and (= 0 (select (select |#memory_int| cstrlen_~p~0.base) cstrlen_~p~0.offset)) (= 1 cstrlen_~p~0.offset)))), 489#(and (or (and (= |cstrlen_#t~mem0| 0) (= 1 cstrlen_~p~0.offset)) (<= (+ cstrlen_~p~0.offset 2) (select |#length| cstrlen_~p~0.base))) (<= 1 cstrlen_~p~0.offset)), 490#(and (<= (+ cstrlen_~p~0.offset 1) (select |#length| cstrlen_~p~0.base)) (<= 2 cstrlen_~p~0.offset))] [2018-02-04 14:58:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:44,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:58:44,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:58:44,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:58:44,374 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 10 states. [2018-02-04 14:58:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:44,560 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-02-04 14:58:44,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:58:44,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-02-04 14:58:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:44,561 INFO L225 Difference]: With dead ends: 53 [2018-02-04 14:58:44,561 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 14:58:44,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-04 14:58:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 14:58:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-02-04 14:58:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 14:58:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-02-04 14:58:44,565 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-02-04 14:58:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:44,566 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-02-04 14:58:44,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:58:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-02-04 14:58:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 14:58:44,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:44,567 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] [2018-02-04 14:58:44,567 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-02-04 14:58:44,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:44,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:44,648 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 14:58:44,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:44,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:44,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:44,648 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 14:58:44,648 INFO L182 omatonBuilderFactory]: Interpolants [601#true, 602#false, 603#(= |#valid| |old(#valid)|), 604#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))] [2018-02-04 14:58:44,648 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 14:58:44,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:58:44,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:58:44,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:58:44,649 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-02-04 14:58:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:44,680 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-02-04 14:58:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:58:44,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 14:58:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:44,681 INFO L225 Difference]: With dead ends: 42 [2018-02-04 14:58:44,681 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 14:58:44,681 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 14:58:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 14:58:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 14:58:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 14:58:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-02-04 14:58:44,683 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-02-04 14:58:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:44,683 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-02-04 14:58:44,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:58:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-02-04 14:58:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:58:44,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:44,684 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:44,684 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:44,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1680759059, now seen corresponding path program 3 times [2018-02-04 14:58:44,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:44,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 14:58:44,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:44,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 14:58:44,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:44,811 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 14:58:44,811 INFO L182 omatonBuilderFactory]: Interpolants [673#true, 674#false, 675#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 676#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 677#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 678#(= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) (+ (select |#length| |cstrlen_#in~s.base|) (- 1)))), 679#(= 0 (select (select |#memory_int| cstrlen_~p~0.base) (+ (select |#length| cstrlen_~p~0.base) (- 1)))), 680#(or (= 0 (select (select |#memory_int| cstrlen_~p~0.base) cstrlen_~p~0.offset)) (<= (+ cstrlen_~p~0.offset 2) (select |#length| cstrlen_~p~0.base)) (<= (select |#length| cstrlen_~p~0.base) cstrlen_~p~0.offset)), 681#(or (= |cstrlen_#t~mem0| 0) (and (<= 0 cstrlen_~p~0.offset) (<= (+ cstrlen_~p~0.offset 2) (select |#length| cstrlen_~p~0.base)))), 682#(and (<= 1 cstrlen_~p~0.offset) (<= (+ cstrlen_~p~0.offset 1) (select |#length| cstrlen_~p~0.base)))] [2018-02-04 14:58:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 14:58:44,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:58:44,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:58:44,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:58:44,812 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 10 states. [2018-02-04 14:58:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:44,886 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-02-04 14:58:44,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:58:44,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 14:58:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:44,886 INFO L225 Difference]: With dead ends: 23 [2018-02-04 14:58:44,886 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:58:44,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:58:44,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:58:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:58:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:58:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:58:44,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-02-04 14:58:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:44,888 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:58:44,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:58:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:58:44,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:58:44,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:58:44 BoogieIcfgContainer [2018-02-04 14:58:44,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:58:44,892 INFO L168 Benchmark]: Toolchain (without parser) took 2291.96 ms. Allocated memory was 410.0 MB in the beginning and 635.4 MB in the end (delta: 225.4 MB). Free memory was 364.0 MB in the beginning and 449.2 MB in the end (delta: -85.1 MB). Peak memory consumption was 140.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:44,894 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 410.0 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:58:44,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.98 ms. Allocated memory is still 410.0 MB. Free memory was 364.0 MB in the beginning and 353.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 14:58:44,894 INFO L168 Benchmark]: Boogie Preprocessor took 22.38 ms. Allocated memory is still 410.0 MB. Free memory was 353.5 MB in the beginning and 350.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:44,894 INFO L168 Benchmark]: RCFGBuilder took 138.79 ms. Allocated memory is still 410.0 MB. Free memory was 350.8 MB in the beginning and 336.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:44,894 INFO L168 Benchmark]: TraceAbstraction took 1972.77 ms. Allocated memory was 410.0 MB in the beginning and 635.4 MB in the end (delta: 225.4 MB). Free memory was 336.3 MB in the beginning and 449.2 MB in the end (delta: -112.9 MB). Peak memory consumption was 112.5 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:44,895 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.20 ms. Allocated memory is still 410.0 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.98 ms. Allocated memory is still 410.0 MB. Free memory was 364.0 MB in the beginning and 353.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 22.38 ms. Allocated memory is still 410.0 MB. Free memory was 353.5 MB in the beginning and 350.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 138.79 ms. Allocated memory is still 410.0 MB. Free memory was 350.8 MB in the beginning and 336.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1972.77 ms. Allocated memory was 410.0 MB in the beginning and 635.4 MB in the end (delta: 225.4 MB). Free memory was 336.3 MB in the beginning and 449.2 MB in the end (delta: -112.9 MB). Peak memory consumption was 112.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: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 1.9s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 203 SDslu, 480 SDs, 0 SdLazy, 474 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 5/26 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, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 15120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 5/26 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/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-58-44-901.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-58-44-901.csv Received shutdown request...