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_cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:48:30,038 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:48:30,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:48:30,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:48:30,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:48:30,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:48:30,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:48:30,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:48:30,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:48:30,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:48:30,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:48:30,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:48:30,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:48:30,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:48:30,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:48:30,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:48:30,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:48:30,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:48:30,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:48:30,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:48:30,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:48:30,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:48:30,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:48:30,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:48:30,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:48:30,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:48:30,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:48:30,071 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:48:30,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:48:30,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:48:30,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:48:30,072 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:48:30,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:48:30,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:48:30,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:48:30,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:48:30,082 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:48:30,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:48:30,082 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:48:30,083 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:48:30,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:48:30,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:48:30,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:48:30,083 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:48:30,083 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:48:30,083 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:48:30,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:48:30,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:48:30,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:48:30,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:48:30,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:48:30,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:48:30,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:48:30,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:48:30,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:48:30,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:48:30,118 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:48:30,120 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:48:30,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:48:30,121 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:48:30,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:48:30,245 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:48:30,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:48:30,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:48:30,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:48:30,251 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:48:30,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:48:30" (1/1) ... [2018-02-04 01:48:30,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b1b581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30, skipping insertion in model container [2018-02-04 01:48:30,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:48:30" (1/1) ... [2018-02-04 01:48:30,263 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:48:30,290 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:48:30,377 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:48:30,390 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:48:30,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30 WrapperNode [2018-02-04 01:48:30,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:48:30,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:48:30,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:48:30,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:48:30,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30" (1/1) ... [2018-02-04 01:48:30,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30" (1/1) ... [2018-02-04 01:48:30,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30" (1/1) ... [2018-02-04 01:48:30,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30" (1/1) ... [2018-02-04 01:48:30,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30" (1/1) ... [2018-02-04 01:48:30,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30" (1/1) ... [2018-02-04 01:48:30,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30" (1/1) ... [2018-02-04 01:48:30,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:48:30,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:48:30,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:48:30,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:48:30,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30" (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:48:30,451 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:48:30,451 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:48:30,452 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 01:48:30,452 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:48:30,452 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:48:30,550 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:48:30,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:48:30 BoogieIcfgContainer [2018-02-04 01:48:30,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:48:30,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:48:30,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:48:30,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:48:30,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:48:30" (1/3) ... [2018-02-04 01:48:30,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8db16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:48:30, skipping insertion in model container [2018-02-04 01:48:30,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:30" (2/3) ... [2018-02-04 01:48:30,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8db16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:48:30, skipping insertion in model container [2018-02-04 01:48:30,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:48:30" (3/3) ... [2018-02-04 01:48:30,555 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:48:30,561 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:48:30,565 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 01:48:30,594 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:48:30,594 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:48:30,594 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:48:30,594 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:48:30,595 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:48:30,595 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:48:30,595 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:48:30,595 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:48:30,595 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:48:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-04 01:48:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 01:48:30,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:30,611 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:30,611 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:48:30,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434931, now seen corresponding path program 1 times [2018-02-04 01:48:30,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:30,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:30,739 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:48:30,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:30,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:48:30,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:30,742 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:48:30,742 INFO L182 omatonBuilderFactory]: Interpolants [34#true, 35#false, 36#(= 1 (select |#valid| |main_#t~malloc3.base|)), 37#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 01:48:30,742 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:48:30,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:48:30,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:48:30,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:48:30,759 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-02-04 01:48:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:30,816 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 01:48:30,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:48:30,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 01:48:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:30,824 INFO L225 Difference]: With dead ends: 30 [2018-02-04 01:48:30,824 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 01:48:30,825 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:48:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 01:48:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-04 01:48:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 01:48:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 01:48:30,901 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2018-02-04 01:48:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:30,901 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 01:48:30,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:48:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 01:48:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 01:48:30,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:30,902 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:30,902 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:48:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434932, now seen corresponding path program 1 times [2018-02-04 01:48:30,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:30,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:30,980 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:48:30,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:30,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:48:30,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:30,981 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:48:30,981 INFO L182 omatonBuilderFactory]: Interpolants [97#true, 98#false, 99#(<= 1 main_~length1~0), 100#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 101#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 01:48:30,981 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:48:30,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:48:30,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:48:30,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:48:30,982 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-04 01:48:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:31,009 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-04 01:48:31,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:48:31,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 01:48:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:31,009 INFO L225 Difference]: With dead ends: 26 [2018-02-04 01:48:31,010 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 01:48:31,010 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:48:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 01:48:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 01:48:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 01:48:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 01:48:31,013 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-04 01:48:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:31,014 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 01:48:31,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:48:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 01:48:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:48:31,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:31,014 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:31,014 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:48:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900249, now seen corresponding path program 1 times [2018-02-04 01:48:31,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:31,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:31,070 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:48:31,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:31,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:48:31,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:31,070 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:48:31,070 INFO L182 omatonBuilderFactory]: Interpolants [160#(= 1 (select |#valid| cstrlen_~s~0.base)), 156#true, 157#false, 158#(= 1 (select |#valid| main_~nondetString1~0.base)), 159#(= 1 (select |#valid| |cstrlen_#in~str.base|))] [2018-02-04 01:48:31,070 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:48:31,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:48:31,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:48:31,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:48:31,071 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-04 01:48:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:31,111 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-04 01:48:31,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:48:31,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 01:48:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:31,113 INFO L225 Difference]: With dead ends: 25 [2018-02-04 01:48:31,113 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 01:48:31,113 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 01:48:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 01:48:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 01:48:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 01:48:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 01:48:31,116 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-02-04 01:48:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:31,116 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 01:48:31,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:48:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 01:48:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:48:31,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:31,117 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:31,117 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:48:31,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900248, now seen corresponding path program 1 times [2018-02-04 01:48:31,118 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:31,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:31,238 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:48:31,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:31,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:48:31,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:31,239 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:48:31,239 INFO L182 omatonBuilderFactory]: Interpolants [213#true, 214#false, 215#(<= 1 main_~length1~0), 216#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 217#(and (= 0 main_~nondetString1~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0)), 218#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base))), 219#(and (= 0 |cstrlen_#in~str.offset|) (<= 1 (select |#length| |cstrlen_#in~str.base|))), 220#(and (= cstrlen_~s~0.offset 0) (<= 1 (select |#length| cstrlen_~s~0.base)))] [2018-02-04 01:48:31,239 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:48:31,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:48:31,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:48:31,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:48:31,240 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-02-04 01:48:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:31,308 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 01:48:31,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:48:31,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-04 01:48:31,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:31,311 INFO L225 Difference]: With dead ends: 32 [2018-02-04 01:48:31,311 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 01:48:31,312 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 01:48:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 01:48:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-02-04 01:48:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 01:48:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 01:48:31,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2018-02-04 01:48:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:31,315 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 01:48:31,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:48:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 01:48:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:48:31,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:31,316 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:31,316 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:48:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1301829867, now seen corresponding path program 1 times [2018-02-04 01:48:31,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:31,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:31,416 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:48:31,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:31,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:48:31,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:31,417 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:48:31,417 INFO L182 omatonBuilderFactory]: Interpolants [288#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 289#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 290#(= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|)), 291#(= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)), 292#(= |cstrlen_#t~mem1| 0), 284#true, 285#false, 286#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 287#(and (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|) (<= main_~length1~0 1))] [2018-02-04 01:48:31,417 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:48:31,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:48:31,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:48:31,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:48:31,418 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-02-04 01:48:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:31,491 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 01:48:31,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:48:31,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-04 01:48:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:31,491 INFO L225 Difference]: With dead ends: 43 [2018-02-04 01:48:31,491 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 01:48:31,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:48:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 01:48:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-04 01:48:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 01:48:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-02-04 01:48:31,495 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2018-02-04 01:48:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:31,495 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-02-04 01:48:31,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:48:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-02-04 01:48:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:48:31,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:31,496 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:31,496 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:48:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1559995305, now seen corresponding path program 1 times [2018-02-04 01:48:31,497 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:31,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:31,668 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:48:31,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:48:31,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:48:31,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:31,669 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:48:31,669 INFO L182 omatonBuilderFactory]: Interpolants [384#true, 385#false, 386#(<= 1 main_~length1~0), 387#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 388#(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)), 389#(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)), 390#(and (= 0 |cstrlen_#in~str.offset|) (or (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|)) (<= 2 (select |#length| |cstrlen_#in~str.base|)))), 391#(and (or (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (<= 2 (select |#length| cstrlen_~s~0.base))) (= cstrlen_~s~0.offset 0)), 392#(and (or (<= 2 (select |#length| cstrlen_~s~0.base)) (= |cstrlen_#t~mem1| 0)) (= cstrlen_~s~0.offset 0)), 393#(and (= cstrlen_~s~0.offset 0) (<= 2 (select |#length| cstrlen_~s~0.base))), 394#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base)))] [2018-02-04 01:48:31,669 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:48:31,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:48:31,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:48:31,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:48:31,669 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 11 states. [2018-02-04 01:48:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:31,818 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-02-04 01:48:31,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:48:31,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-02-04 01:48:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:31,819 INFO L225 Difference]: With dead ends: 50 [2018-02-04 01:48:31,819 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 01:48:31,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:48:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 01:48:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-02-04 01:48:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 01:48:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-02-04 01:48:31,824 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2018-02-04 01:48:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:31,830 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-02-04 01:48:31,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:48:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-02-04 01:48:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:48:31,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:31,831 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 01:48:31,832 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:48:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash -968711636, now seen corresponding path program 1 times [2018-02-04 01:48:31,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:31,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:31,889 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:48:31,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:31,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:48:31,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:31,890 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:48:31,890 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= |#valid| |old(#valid)|), 504#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))] [2018-02-04 01:48:31,890 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:48:31,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:48:31,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:48:31,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:48:31,891 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 4 states. [2018-02-04 01:48:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:31,924 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-02-04 01:48:31,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:48:31,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 01:48:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:31,924 INFO L225 Difference]: With dead ends: 41 [2018-02-04 01:48:31,925 INFO L226 Difference]: Without dead ends: 23 [2018-02-04 01:48:31,925 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:48:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-04 01:48:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-04 01:48:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-04 01:48:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-04 01:48:31,927 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2018-02-04 01:48:31,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:31,928 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-04 01:48:31,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:48:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-04 01:48:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:48:31,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:31,928 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:31,929 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:48:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1772753452, now seen corresponding path program 2 times [2018-02-04 01:48:31,929 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:31,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:32,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:48:32,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:48:32,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:32,104 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:48:32,105 INFO L182 omatonBuilderFactory]: Interpolants [576#(and (= 0 |cstrlen_#in~str.offset|) (or (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) 1)) (<= (select |#length| |cstrlen_#in~str.base|) 1) (<= 3 (select |#length| |cstrlen_#in~str.base|)))), 577#(and (or (<= 3 (select |#length| cstrlen_~s~0.base)) (<= (select |#length| cstrlen_~s~0.base) 1) (= 0 (select (select |#memory_int| cstrlen_~s~0.base) 1))) (= cstrlen_~s~0.offset 0)), 578#(and (<= 1 cstrlen_~s~0.offset) (or (<= (select |#length| cstrlen_~s~0.base) cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (and (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (= 1 cstrlen_~s~0.offset)))), 579#(and (<= 1 cstrlen_~s~0.offset) (or (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (and (= 1 cstrlen_~s~0.offset) (= |cstrlen_#t~mem1| 0)))), 580#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))), 581#(and (<= 2 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 571#true, 572#false, 573#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 574#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 575#(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))] [2018-02-04 01:48:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:32,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:48:32,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:48:32,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:48:32,106 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 11 states. [2018-02-04 01:48:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:32,246 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-02-04 01:48:32,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 01:48:32,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-04 01:48:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:32,246 INFO L225 Difference]: With dead ends: 29 [2018-02-04 01:48:32,246 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 01:48:32,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:48:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 01:48:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-02-04 01:48:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 01:48:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-02-04 01:48:32,249 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-02-04 01:48:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:32,249 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-02-04 01:48:32,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:48:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-02-04 01:48:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:48:32,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:32,249 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:32,249 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:48:32,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2069395665, now seen corresponding path program 3 times [2018-02-04 01:48:32,250 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:32,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 01:48:32,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:48:32,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:48:32,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:32,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:48:32,381 INFO L182 omatonBuilderFactory]: Interpolants [656#(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)), 657#(= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) (+ (select |#length| |cstrlen_#in~str.base|) (- 1)))), 658#(= 0 (select (select |#memory_int| cstrlen_~s~0.base) (+ (select |#length| cstrlen_~s~0.base) (- 1)))), 659#(or (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (<= (select |#length| cstrlen_~s~0.base) cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))), 660#(or (= |cstrlen_#t~mem1| 0) (and (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (<= 0 cstrlen_~s~0.offset))), 661#(and (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (<= 0 cstrlen_~s~0.offset)), 662#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 652#true, 653#false, 654#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 655#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0))] [2018-02-04 01:48:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 01:48:32,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:48:32,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:48:32,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:48:32,382 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-02-04 01:48:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:32,510 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-02-04 01:48:32,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:48:32,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-02-04 01:48:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:32,511 INFO L225 Difference]: With dead ends: 26 [2018-02-04 01:48:32,511 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:48:32,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:48:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:48:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:48:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:48:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:48:32,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-02-04 01:48:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:32,512 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:48:32,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:48:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:48:32,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:48:32,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:48:32 BoogieIcfgContainer [2018-02-04 01:48:32,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:48:32,515 INFO L168 Benchmark]: Toolchain (without parser) took 2269.70 ms. Allocated memory was 402.7 MB in the beginning and 628.1 MB in the end (delta: 225.4 MB). Free memory was 357.8 MB in the beginning and 433.7 MB in the end (delta: -75.9 MB). Peak memory consumption was 149.5 MB. Max. memory is 5.3 GB. [2018-02-04 01:48:32,516 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:48:32,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.54 ms. Allocated memory is still 402.7 MB. Free memory was 356.5 MB in the beginning and 347.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:48:32,516 INFO L168 Benchmark]: Boogie Preprocessor took 21.10 ms. Allocated memory is still 402.7 MB. Free memory was 347.2 MB in the beginning and 344.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:48:32,517 INFO L168 Benchmark]: RCFGBuilder took 133.89 ms. Allocated memory is still 402.7 MB. Free memory was 344.6 MB in the beginning and 329.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-02-04 01:48:32,517 INFO L168 Benchmark]: TraceAbstraction took 1963.81 ms. Allocated memory was 402.7 MB in the beginning and 628.1 MB in the end (delta: 225.4 MB). Free memory was 328.6 MB in the beginning and 433.7 MB in the end (delta: -105.1 MB). Peak memory consumption was 120.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:48:32,518 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.12 ms. Allocated memory is still 402.7 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.54 ms. Allocated memory is still 402.7 MB. Free memory was 356.5 MB in the beginning and 347.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.10 ms. Allocated memory is still 402.7 MB. Free memory was 347.2 MB in the beginning and 344.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 133.89 ms. Allocated memory is still 402.7 MB. Free memory was 344.6 MB in the beginning and 329.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1963.81 ms. Allocated memory was 402.7 MB in the beginning and 628.1 MB in the end (delta: 225.4 MB). Free memory was 328.6 MB in the beginning and 433.7 MB in the end (delta: -105.1 MB). Peak memory consumption was 120.3 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: 548]: 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, 31 locations, 5 error locations. SAFE Result, 1.9s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 182 SDslu, 471 SDs, 0 SdLazy, 452 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 6/30 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, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 18082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 6/30 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_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-48-32-524.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-48-32-524.csv Received shutdown request...