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/rec_strlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:51:38,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:51:38,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:51:38,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:51:38,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:51:38,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:51:38,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:51:38,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:51:38,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:51:38,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:51:38,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:51:38,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:51:38,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:51:38,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:51:38,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:51:38,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:51:38,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:51:38,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:51:38,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:51:38,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:51:38,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:51:38,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:51:38,327 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:51:38,328 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:51:38,329 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:51:38,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:51:38,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:51:38,330 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:51:38,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:51:38,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:51:38,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:51:38,331 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:51:38,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:51:38,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:51:38,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:51:38,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:51:38,342 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:51:38,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:51:38,342 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:51:38,343 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:51:38,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:51:38,343 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:51:38,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:51:38,343 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:51:38,343 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:51:38,344 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:51:38,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:51:38,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:51:38,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:51:38,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:51:38,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:51:38,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:51:38,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:51:38,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:51:38,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:51:38,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:51:38,382 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:51:38,385 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:51:38,386 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:51:38,386 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:51:38,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:51:38,524 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:51:38,525 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:51:38,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:51:38,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:51:38,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:51:38,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:51:38" (1/1) ... [2018-02-04 01:51:38,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4750ff22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38, skipping insertion in model container [2018-02-04 01:51:38,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:51:38" (1/1) ... [2018-02-04 01:51:38,548 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:51:38,575 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:51:38,655 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:51:38,665 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:51:38,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38 WrapperNode [2018-02-04 01:51:38,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:51:38,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:51:38,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:51:38,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:51:38,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38" (1/1) ... [2018-02-04 01:51:38,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38" (1/1) ... [2018-02-04 01:51:38,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38" (1/1) ... [2018-02-04 01:51:38,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38" (1/1) ... [2018-02-04 01:51:38,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38" (1/1) ... [2018-02-04 01:51:38,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38" (1/1) ... [2018-02-04 01:51:38,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38" (1/1) ... [2018-02-04 01:51:38,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:51:38,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:51:38,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:51:38,688 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:51:38,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38" (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:51:38,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:51:38,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:51:38,726 INFO L136 BoogieDeclarations]: Found implementation of procedure strlen_rec [2018-02-04 01:51:38,726 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:51:38,726 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:51:38,726 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:51:38,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:51:38,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:51:38,727 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:51:38,727 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:51:38,727 INFO L128 BoogieDeclarations]: Found specification of procedure strlen_rec [2018-02-04 01:51:38,727 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:51:38,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:51:38,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:51:38,823 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:51:38,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:51:38 BoogieIcfgContainer [2018-02-04 01:51:38,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:51:38,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:51:38,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:51:38,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:51:38,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:51:38" (1/3) ... [2018-02-04 01:51:38,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8f228a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:51:38, skipping insertion in model container [2018-02-04 01:51:38,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:51:38" (2/3) ... [2018-02-04 01:51:38,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8f228a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:51:38, skipping insertion in model container [2018-02-04 01:51:38,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:51:38" (3/3) ... [2018-02-04 01:51:38,829 INFO L107 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:51:38,836 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:51:38,841 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 01:51:38,879 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:51:38,879 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:51:38,879 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:51:38,880 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:51:38,880 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:51:38,880 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:51:38,880 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:51:38,880 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:51:38,881 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:51:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-04 01:51:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 01:51:38,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:38,906 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:51:38,906 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 01:51:38,917 INFO L82 PathProgramCache]: Analyzing trace with hash -407257815, now seen corresponding path program 1 times [2018-02-04 01:51:38,964 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:39,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:39,128 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:51:39,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:51:39,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:51:39,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:39,132 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:51:39,133 INFO L182 omatonBuilderFactory]: Interpolants [33#true, 34#false, 35#(<= 1 main_~length1~0), 36#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 37#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 01:51:39,133 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:51:39,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:51:39,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:51:39,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:51:39,148 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-02-04 01:51:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:39,200 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-02-04 01:51:39,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:51:39,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 01:51:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:39,251 INFO L225 Difference]: With dead ends: 29 [2018-02-04 01:51:39,251 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 01:51:39,252 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:51:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 01:51:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 01:51:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 01:51:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-02-04 01:51:39,277 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-02-04 01:51:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:39,277 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-02-04 01:51:39,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:51:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-02-04 01:51:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 01:51:39,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:39,278 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:51:39,278 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 01:51:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash -407257816, now seen corresponding path program 1 times [2018-02-04 01:51:39,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:39,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:39,341 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:51:39,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:51:39,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:51:39,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:39,342 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:51:39,343 INFO L182 omatonBuilderFactory]: Interpolants [96#false, 97#(= 1 (select |#valid| |main_#t~malloc3.base|)), 98#(= 1 (select |#valid| main_~nondetString1~0.base)), 95#true] [2018-02-04 01:51:39,343 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:51:39,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:51:39,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:51:39,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:51:39,344 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2018-02-04 01:51:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:39,365 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-02-04 01:51:39,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:51:39,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 01:51:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:39,366 INFO L225 Difference]: With dead ends: 25 [2018-02-04 01:51:39,366 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 01:51:39,366 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:51:39,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 01:51:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 01:51:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 01:51:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-02-04 01:51:39,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2018-02-04 01:51:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:39,369 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-02-04 01:51:39,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:51:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-02-04 01:51:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:51:39,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:39,369 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:51:39,369 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 01:51:39,369 INFO L82 PathProgramCache]: Analyzing trace with hash 665022209, now seen corresponding path program 1 times [2018-02-04 01:51:39,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:39,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:39,406 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:51:39,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:51:39,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:51:39,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:39,407 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:51:39,407 INFO L182 omatonBuilderFactory]: Interpolants [151#true, 152#false, 153#(= 1 (select |#valid| main_~nondetString1~0.base)), 154#(= 1 (select |#valid| |strlen_rec_#in~p.base|)), 155#(= 1 (select |#valid| strlen_rec_~p.base))] [2018-02-04 01:51:39,407 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:51:39,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:51:39,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:51:39,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:51:39,408 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-02-04 01:51:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:39,473 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-02-04 01:51:39,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:51:39,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 01:51:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:39,474 INFO L225 Difference]: With dead ends: 24 [2018-02-04 01:51:39,474 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 01:51:39,475 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:51:39,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 01:51:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 01:51:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 01:51:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-02-04 01:51:39,478 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2018-02-04 01:51:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:39,478 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-02-04 01:51:39,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:51:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-02-04 01:51:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:51:39,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:39,479 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:51:39,479 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 01:51:39,479 INFO L82 PathProgramCache]: Analyzing trace with hash 665022210, now seen corresponding path program 1 times [2018-02-04 01:51:39,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:39,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:39,564 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:51:39,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:51:39,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:51:39,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:39,565 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:51:39,565 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 (= 0 |strlen_rec_#in~p.offset|) (<= 1 (select |#length| |strlen_rec_#in~p.base|))), 213#(and (<= 1 (select |#length| strlen_rec_~p.base)) (= strlen_rec_~p.offset 0)), 206#true, 207#false] [2018-02-04 01:51:39,565 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:51:39,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:51:39,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:51:39,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:51:39,566 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-02-04 01:51:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:39,641 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-02-04 01:51:39,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:51:39,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-02-04 01:51:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:39,642 INFO L225 Difference]: With dead ends: 31 [2018-02-04 01:51:39,642 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 01:51:39,643 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:51:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 01:51:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 01:51:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 01:51:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 01:51:39,647 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2018-02-04 01:51:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:39,647 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 01:51:39,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:51:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 01:51:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 01:51:39,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:39,648 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:51:39,648 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 01:51:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1167971539, now seen corresponding path program 1 times [2018-02-04 01:51:39,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:39,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:39,755 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:51:39,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:51:39,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:51:39,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:39,755 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:51:39,755 INFO L182 omatonBuilderFactory]: Interpolants [288#(= |strlen_rec_#t~mem0| 0), 280#true, 281#false, 282#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 283#(and (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|) (<= main_~length1~0 1)), 284#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 285#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 286#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|)), 287#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))] [2018-02-04 01:51:39,755 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:51:39,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:51:39,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:51:39,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:51:39,756 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-02-04 01:51:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:39,821 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 01:51:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:51:39,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 01:51:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:39,822 INFO L225 Difference]: With dead ends: 45 [2018-02-04 01:51:39,822 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 01:51:39,822 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:51:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 01:51:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-02-04 01:51:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 01:51:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 01:51:39,828 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 17 [2018-02-04 01:51:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:39,828 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 01:51:39,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:51:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 01:51:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 01:51:39,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:39,829 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:51:39,829 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 01:51:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash -466906961, now seen corresponding path program 1 times [2018-02-04 01:51:39,830 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:39,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:39,986 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:51:39,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:39,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 01:51:39,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:39,987 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:51:39,987 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 |strlen_rec_#in~p.offset|) (or (<= 2 (select |#length| |strlen_rec_#in~p.base|)) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|)))), 391#(and (or (= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset)) (<= 2 (select |#length| strlen_rec_~p.base))) (= strlen_rec_~p.offset 0)), 392#(and (or (= |strlen_rec_#t~mem0| 0) (<= 2 (select |#length| strlen_rec_~p.base))) (= strlen_rec_~p.offset 0)), 393#(and (= strlen_rec_~p.offset 0) (<= 2 (select |#length| strlen_rec_~p.base))), 394#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|))), 395#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))] [2018-02-04 01:51:39,987 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:51:39,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:51:39,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:51:39,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:51:39,988 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 12 states. [2018-02-04 01:51:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:40,178 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 01:51:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:51:40,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-04 01:51:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:40,181 INFO L225 Difference]: With dead ends: 49 [2018-02-04 01:51:40,181 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 01:51:40,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:51:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 01:51:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-02-04 01:51:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 01:51:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 01:51:40,191 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-02-04 01:51:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:40,191 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 01:51:40,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:51:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 01:51:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:51:40,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:40,192 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:51:40,192 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 01:51:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash -847794598, now seen corresponding path program 2 times [2018-02-04 01:51:40,193 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:40,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:40,409 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:51:40,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:40,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:51:40,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:40,409 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:51:40,409 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (or (= 0 (select (select |#memory_int| strlen_rec_~p.base) 1)) (<= (select |#length| strlen_rec_~p.base) 1) (<= 3 (select |#length| strlen_rec_~p.base))) (= strlen_rec_~p.offset 0)), 513#(and (or (and (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 1)) (<= |strlen_rec_#in~p.offset| 1)) (<= (select |#length| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|))) (<= 1 |strlen_rec_#in~p.offset|)), 514#(and (or (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (and (= 1 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))) (<= (select |#length| strlen_rec_~p.base) strlen_rec_~p.offset)) (<= 1 strlen_rec_~p.offset)), 515#(and (<= 1 strlen_rec_~p.offset) (or (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (and (= 1 strlen_rec_~p.offset) (= |strlen_rec_#t~mem0| 0)))), 516#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 1 strlen_rec_~p.offset)), 517#(and (<= 2 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|))), 518#(and (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset)), 506#true, 507#false, 508#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 509#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 510#(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)), 511#(and (or (<= (select |#length| |strlen_rec_#in~p.base|) 1) (<= 3 (select |#length| |strlen_rec_#in~p.base|)) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 1))) (= 0 |strlen_rec_#in~p.offset|))] [2018-02-04 01:51:40,409 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:51:40,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:51:40,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:51:40,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:51:40,410 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 13 states. [2018-02-04 01:51:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:40,630 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-02-04 01:51:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:51:40,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-02-04 01:51:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:40,631 INFO L225 Difference]: With dead ends: 56 [2018-02-04 01:51:40,631 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 01:51:40,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:51:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 01:51:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-02-04 01:51:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 01:51:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 01:51:40,637 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 21 [2018-02-04 01:51:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:40,637 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 01:51:40,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:51:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 01:51:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:51:40,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:40,638 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] [2018-02-04 01:51:40,638 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 01:51:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1711563014, now seen corresponding path program 1 times [2018-02-04 01:51:40,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:40,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:40,697 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:51:40,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:51:40,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:51:40,697 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:40,698 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:51:40,698 INFO L182 omatonBuilderFactory]: Interpolants [645#true, 646#false, 647#(= |#valid| |old(#valid)|), 648#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))] [2018-02-04 01:51:40,698 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:51:40,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:51:40,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:51:40,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:51:40,699 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 4 states. [2018-02-04 01:51:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:40,729 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-04 01:51:40,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:51:40,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 01:51:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:40,730 INFO L225 Difference]: With dead ends: 53 [2018-02-04 01:51:40,730 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 01:51:40,731 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:51:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 01:51:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-02-04 01:51:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 01:51:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-02-04 01:51:40,733 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-02-04 01:51:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:40,733 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-02-04 01:51:40,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:51:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-02-04 01:51:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 01:51:40,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:40,734 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:51:40,734 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 01:51:40,734 INFO L82 PathProgramCache]: Analyzing trace with hash -757662075, now seen corresponding path program 3 times [2018-02-04 01:51:40,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:40,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 01:51:40,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:40,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 01:51:40,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:40,855 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:51:40,855 INFO L182 omatonBuilderFactory]: Interpolants [736#(= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) (- 1)))), 737#(or (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= (select |#length| strlen_rec_~p.base) strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))), 738#(or (= |strlen_rec_#t~mem0| 0) (and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset))), 739#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 0 strlen_rec_~p.offset)), 740#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|))), 741#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base))), 730#true, 731#false, 732#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 733#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 734#(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)), 735#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ (select |#length| |strlen_rec_#in~p.base|) (- 1))))] [2018-02-04 01:51:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 01:51:40,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:51:40,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:51:40,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:51:40,856 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 12 states. [2018-02-04 01:51:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:41,020 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-02-04 01:51:41,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:51:41,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-02-04 01:51:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:41,021 INFO L225 Difference]: With dead ends: 25 [2018-02-04 01:51:41,021 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:51:41,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:51:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:51:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:51:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:51:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:51:41,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-02-04 01:51:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:41,022 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:51:41,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:51:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:51:41,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:51:41,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:51:41 BoogieIcfgContainer [2018-02-04 01:51:41,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:51:41,026 INFO L168 Benchmark]: Toolchain (without parser) took 2501.64 ms. Allocated memory was 404.2 MB in the beginning and 657.5 MB in the end (delta: 253.2 MB). Free memory was 359.6 MB in the beginning and 604.0 MB in the end (delta: -244.4 MB). Peak memory consumption was 8.8 MB. Max. memory is 5.3 GB. [2018-02-04 01:51:41,027 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:51:41,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.74 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 349.0 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:51:41,027 INFO L168 Benchmark]: Boogie Preprocessor took 17.91 ms. Allocated memory is still 404.2 MB. Free memory was 349.0 MB in the beginning and 346.4 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:51:41,027 INFO L168 Benchmark]: RCFGBuilder took 135.71 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 331.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:51:41,028 INFO L168 Benchmark]: TraceAbstraction took 2201.45 ms. Allocated memory was 404.2 MB in the beginning and 657.5 MB in the end (delta: 253.2 MB). Free memory was 331.8 MB in the beginning and 604.0 MB in the end (delta: -272.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:51:41,028 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.14 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 143.74 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 349.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.91 ms. Allocated memory is still 404.2 MB. Free memory was 349.0 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 135.71 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 331.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2201.45 ms. Allocated memory was 404.2 MB in the beginning and 657.5 MB in the end (delta: 253.2 MB). Free memory was 331.8 MB in the beginning and 604.0 MB in the end (delta: -272.2 MB). There was no memory consumed. 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: 546]: 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 - 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 - 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, 2.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 192 SDtfs, 195 SDslu, 602 SDs, 0 SdLazy, 582 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 8/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, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 15640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 8/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/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-51-41-035.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-51-41-035.csv Received shutdown request...