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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:47:52,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:47:52,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:47:52,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:47:52,251 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:47:52,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:47:52,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:47:52,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:47:52,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:47:52,256 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:47:52,257 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:47:52,257 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:47:52,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:47:52,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:47:52,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:47:52,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:47:52,263 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:47:52,265 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:47:52,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:47:52,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:47:52,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:47:52,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:47:52,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:47:52,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:47:52,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:47:52,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:47:52,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:47:52,272 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:47:52,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:47:52,272 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:47:52,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:47:52,273 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:47:52,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:47:52,282 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:47:52,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:47:52,283 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:47:52,283 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:47:52,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:47:52,283 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:47:52,283 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:47:52,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:47:52,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:47:52,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:47:52,283 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:47:52,284 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:47:52,284 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:47:52,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:47:52,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:47:52,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:47:52,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:47:52,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:47:52,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:47:52,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:47:52,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:47:52,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:47:52,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:47:52,318 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:47:52,320 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:47:52,321 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:47:52,322 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:47:52,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:47:52,430 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:47:52,431 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:47:52,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:47:52,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:47:52,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:47:52,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:47:52" (1/1) ... [2018-02-02 09:47:52,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad95545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52, skipping insertion in model container [2018-02-02 09:47:52,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:47:52" (1/1) ... [2018-02-02 09:47:52,448 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:47:52,478 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:47:52,577 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:47:52,595 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:47:52,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52 WrapperNode [2018-02-02 09:47:52,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:47:52,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:47:52,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:47:52,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:47:52,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52" (1/1) ... [2018-02-02 09:47:52,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52" (1/1) ... [2018-02-02 09:47:52,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52" (1/1) ... [2018-02-02 09:47:52,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52" (1/1) ... [2018-02-02 09:47:52,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52" (1/1) ... [2018-02-02 09:47:52,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52" (1/1) ... [2018-02-02 09:47:52,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52" (1/1) ... [2018-02-02 09:47:52,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:47:52,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:47:52,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:47:52,629 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:47:52,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52" (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-02 09:47:52,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:47:52,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:47:52,667 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-02 09:47:52,667 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:47:52,667 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:47:52,667 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:47:52,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:47:52,668 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:47:52,668 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:47:52,668 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:47:52,668 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-02 09:47:52,668 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:47:52,668 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:47:52,668 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:47:52,876 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:47:52,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:47:52 BoogieIcfgContainer [2018-02-02 09:47:52,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:47:52,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:47:52,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:47:52,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:47:52,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:47:52" (1/3) ... [2018-02-02 09:47:52,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e357135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:47:52, skipping insertion in model container [2018-02-02 09:47:52,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:52" (2/3) ... [2018-02-02 09:47:52,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e357135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:47:52, skipping insertion in model container [2018-02-02 09:47:52,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:47:52" (3/3) ... [2018-02-02 09:47:52,882 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:47:52,888 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:47:52,893 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 09:47:52,925 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:47:52,926 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:47:52,926 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:47:52,926 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:47:52,926 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:47:52,926 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:47:52,926 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:47:52,926 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:47:52,927 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:47:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-02-02 09:47:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:47:52,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:52,942 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:52,942 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029996, now seen corresponding path program 1 times [2018-02-02 09:47:52,997 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:53,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:53,152 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-02 09:47:53,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:53,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:47:53,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:53,155 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-02 09:47:53,155 INFO L182 omatonBuilderFactory]: Interpolants [64#true, 65#false, 66#(= 1 (select |#valid| |main_#t~malloc13.base|)), 67#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 09:47:53,155 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-02 09:47:53,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:47:53,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:47:53,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:47:53,170 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-02-02 09:47:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:53,326 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-02 09:47:53,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:47:53,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:47:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:53,338 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:47:53,338 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 09:47:53,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:47:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 09:47:53,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 09:47:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 09:47:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-02-02 09:47:53,366 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-02-02 09:47:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:53,366 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-02-02 09:47:53,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:47:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-02-02 09:47:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:47:53,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:53,367 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:53,367 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:53,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029997, now seen corresponding path program 1 times [2018-02-02 09:47:53,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:53,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:53,457 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-02 09:47:53,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:53,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:47:53,458 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:53,458 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-02 09:47:53,458 INFO L182 omatonBuilderFactory]: Interpolants [192#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 187#true, 188#false, 189#(<= 1 main_~length1~0), 190#(and (= main_~length1~0 (select |#length| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= 1 main_~length1~0) (= 0 |main_#t~malloc13.offset|)), 191#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-02 09:47:53,458 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-02 09:47:53,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:47:53,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:47:53,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:47:53,461 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-02-02 09:47:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:53,540 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-02-02 09:47:53,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:47:53,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 09:47:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:53,541 INFO L225 Difference]: With dead ends: 56 [2018-02-02 09:47:53,541 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 09:47:53,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:47:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 09:47:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 09:47:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 09:47:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-02 09:47:53,547 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-02-02 09:47:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:53,548 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-02 09:47:53,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:47:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-02 09:47:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:47:53,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:53,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:53,549 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -684644977, now seen corresponding path program 1 times [2018-02-02 09:47:53,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:53,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:53,583 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-02 09:47:53,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:53,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:47:53,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:53,583 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-02 09:47:53,584 INFO L182 omatonBuilderFactory]: Interpolants [307#true, 308#false, 309#(= 1 (select |#valid| |main_#t~malloc14.base|)), 310#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-02 09:47:53,584 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-02 09:47:53,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:47:53,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:47:53,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:47:53,584 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-02-02 09:47:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:53,643 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-02-02 09:47:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:47:53,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:47:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:53,645 INFO L225 Difference]: With dead ends: 55 [2018-02-02 09:47:53,645 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 09:47:53,645 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-02 09:47:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 09:47:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 09:47:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 09:47:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-02-02 09:47:53,649 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-02-02 09:47:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:53,650 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-02-02 09:47:53,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:47:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-02-02 09:47:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:47:53,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:53,650 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:53,651 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:53,651 INFO L82 PathProgramCache]: Analyzing trace with hash -684644976, now seen corresponding path program 1 times [2018-02-02 09:47:53,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:53,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:53,709 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-02 09:47:53,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:53,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:47:53,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:53,710 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-02 09:47:53,710 INFO L182 omatonBuilderFactory]: Interpolants [423#true, 424#false, 425#(<= 1 main_~length2~0), 426#(and (= 0 |main_#t~malloc14.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc14.base|))), 427#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 09:47:53,710 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-02 09:47:53,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:47:53,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:47:53,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:47:53,710 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-02-02 09:47:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:53,742 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-02 09:47:53,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:47:53,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:47:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:53,744 INFO L225 Difference]: With dead ends: 54 [2018-02-02 09:47:53,744 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 09:47:53,744 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-02 09:47:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 09:47:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 09:47:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 09:47:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-02-02 09:47:53,748 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-02-02 09:47:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:53,748 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-02-02 09:47:53,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:47:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-02-02 09:47:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:47:53,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:53,749 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-02 09:47:53,750 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash 518960417, now seen corresponding path program 1 times [2018-02-02 09:47:53,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:53,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:53,793 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-02 09:47:53,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:53,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:47:53,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:53,794 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-02 09:47:53,794 INFO L182 omatonBuilderFactory]: Interpolants [538#true, 539#false, 540#(= 1 (select |#valid| main_~nondetString1~0.base)), 541#(= 1 (select |#valid| |cstrncmp_#in~s1.base|)), 542#(= 1 (select |#valid| cstrncmp_~s1.base))] [2018-02-02 09:47:53,794 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-02 09:47:53,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:47:53,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:47:53,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:47:53,795 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-02-02 09:47:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:53,843 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-02-02 09:47:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:47:53,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 09:47:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:53,844 INFO L225 Difference]: With dead ends: 51 [2018-02-02 09:47:53,844 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 09:47:53,844 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-02 09:47:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 09:47:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 09:47:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 09:47:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-02 09:47:53,847 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-02-02 09:47:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:53,847 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-02 09:47:53,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:47:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-02 09:47:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:47:53,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:53,848 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-02 09:47:53,848 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:53,848 INFO L82 PathProgramCache]: Analyzing trace with hash 518960418, now seen corresponding path program 1 times [2018-02-02 09:47:53,848 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:53,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:53,934 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-02 09:47:53,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:53,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:47:53,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:53,935 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-02 09:47:53,935 INFO L182 omatonBuilderFactory]: Interpolants [647#true, 648#false, 649#(<= 1 main_~length1~0), 650#(and (<= 1 main_~length1~0) (= 0 |main_#t~malloc13.offset|)), 651#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 652#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 653#(and (<= 1 (select |#length| |cstrncmp_#in~s1.base|)) (= 0 |cstrncmp_#in~s1.offset|)), 654#(and (= cstrncmp_~s1.offset 0) (<= 1 (select |#length| cstrncmp_~s1.base)))] [2018-02-02 09:47:53,935 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-02 09:47:53,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:47:53,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:47:53,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:47:53,936 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-02-02 09:47:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:54,077 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-02 09:47:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:47:54,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 09:47:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:54,080 INFO L225 Difference]: With dead ends: 74 [2018-02-02 09:47:54,080 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 09:47:54,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:47:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 09:47:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-02-02 09:47:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 09:47:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-02-02 09:47:54,089 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-02-02 09:47:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:54,089 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-02-02 09:47:54,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:47:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-02-02 09:47:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:47:54,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:54,090 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:54,090 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096233, now seen corresponding path program 1 times [2018-02-02 09:47:54,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:54,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:54,145 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-02 09:47:54,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:54,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:47:54,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:54,146 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-02 09:47:54,146 INFO L182 omatonBuilderFactory]: Interpolants [800#(= 1 (select |#valid| main_~nondetString2~0.base)), 801#(= 1 (select |#valid| |cstrncmp_#in~s2.base|)), 802#(= 1 (select |#valid| cstrncmp_~s2.base)), 798#true, 799#false] [2018-02-02 09:47:54,146 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-02 09:47:54,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:47:54,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:47:54,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:47:54,147 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-02-02 09:47:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:54,178 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-02-02 09:47:54,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:47:54,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 09:47:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:54,180 INFO L225 Difference]: With dead ends: 59 [2018-02-02 09:47:54,180 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 09:47:54,180 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-02 09:47:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 09:47:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 09:47:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 09:47:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-02-02 09:47:54,183 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-02-02 09:47:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:54,183 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-02-02 09:47:54,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:47:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-02-02 09:47:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:47:54,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:54,184 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:54,184 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096232, now seen corresponding path program 1 times [2018-02-02 09:47:54,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:54,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:54,260 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-02 09:47:54,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:54,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:47:54,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:54,261 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-02 09:47:54,261 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 929#(and (<= 1 (select |#length| |cstrncmp_#in~s2.base|)) (= 0 |cstrncmp_#in~s2.offset|)), 930#(and (= cstrncmp_~s2.offset 0) (<= 1 (select |#length| cstrncmp_~s2.base))), 923#true, 924#false, 925#(<= 1 main_~length2~0), 926#(and (= 0 |main_#t~malloc14.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc14.base|))), 927#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 09:47:54,261 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-02 09:47:54,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:47:54,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:47:54,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:47:54,262 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-02-02 09:47:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:54,346 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-02-02 09:47:54,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:47:54,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 09:47:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:54,347 INFO L225 Difference]: With dead ends: 68 [2018-02-02 09:47:54,347 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 09:47:54,348 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-02 09:47:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 09:47:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-02-02 09:47:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 09:47:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-02-02 09:47:54,351 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-02-02 09:47:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:54,351 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-02-02 09:47:54,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:47:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-02-02 09:47:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:47:54,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:54,352 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:54,352 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2118091962, now seen corresponding path program 1 times [2018-02-02 09:47:54,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:54,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:54,421 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-02 09:47:54,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:54,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:47:54,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:54,422 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-02 09:47:54,422 INFO L182 omatonBuilderFactory]: Interpolants [1064#true, 1065#false, 1066#(= |#valid| |old(#valid)|), 1067#(and (= (select |#valid| |main_#t~malloc13.base|) 1) (= |old(#valid)| (store |#valid| |main_#t~malloc13.base| 0))), 1068#(and (not (= |main_#t~malloc13.base| |main_#t~malloc14.base|)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc13.base| (select (store |#valid| |main_#t~malloc13.base| 0) |main_#t~malloc13.base|)) |main_#t~malloc14.base| 0))), 1069#(= |old(#valid)| (store |#valid| |main_#t~malloc14.base| (select (store |#valid| |main_#t~malloc14.base| 0) |main_#t~malloc14.base|)))] [2018-02-02 09:47:54,422 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-02 09:47:54,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:47:54,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:47:54,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:47:54,423 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2018-02-02 09:47:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:54,611 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-02-02 09:47:54,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:47:54,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 09:47:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:54,613 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:47:54,613 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 09:47:54,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:47:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 09:47:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 09:47:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 09:47:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-02 09:47:54,616 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-02-02 09:47:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:54,617 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-02 09:47:54,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:47:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-02 09:47:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:47:54,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:54,617 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:54,618 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 487859445, now seen corresponding path program 1 times [2018-02-02 09:47:54,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:54,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:54,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:54,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:47:54,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:54,644 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-02 09:47:54,644 INFO L182 omatonBuilderFactory]: Interpolants [1180#true, 1181#false, 1182#(not |cstrncmp_#t~short3|)] [2018-02-02 09:47:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:54,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:47:54,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:47:54,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:47:54,645 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-02-02 09:47:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:54,650 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-02 09:47:54,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:47:54,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-02 09:47:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:54,651 INFO L225 Difference]: With dead ends: 48 [2018-02-02 09:47:54,651 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 09:47:54,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:47:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 09:47:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 09:47:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 09:47:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-02 09:47:54,655 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-02-02 09:47:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:54,655 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-02 09:47:54,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:47:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-02 09:47:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:47:54,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:54,656 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:54,656 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:54,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1854244690, now seen corresponding path program 1 times [2018-02-02 09:47:54,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:54,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:54,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:54,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:47:54,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:54,679 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-02 09:47:54,679 INFO L182 omatonBuilderFactory]: Interpolants [1280#|cstrncmp_#t~short5|, 1278#true, 1279#false] [2018-02-02 09:47:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:54,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:47:54,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:47:54,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:47:54,679 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-02-02 09:47:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:54,683 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-02 09:47:54,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:47:54,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-02-02 09:47:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:54,687 INFO L225 Difference]: With dead ends: 48 [2018-02-02 09:47:54,687 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 09:47:54,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:47:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 09:47:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 09:47:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 09:47:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-02-02 09:47:54,689 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-02-02 09:47:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:54,689 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-02-02 09:47:54,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:47:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-02-02 09:47:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:47:54,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:54,690 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:54,690 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2022484201, now seen corresponding path program 1 times [2018-02-02 09:47:54,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:54,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:54,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:54,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:47:54,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:54,880 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-02 09:47:54,880 INFO L182 omatonBuilderFactory]: Interpolants [1376#true, 1377#false, 1378#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1379#(and (= (select |#valid| |main_#t~malloc13.base|) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= 0 |main_#t~malloc13.offset|)), 1380#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1381#(and (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1382#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1383#(and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1384#(= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|)), 1385#(= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset)), 1386#(= 0 |cstrncmp_#t~mem4|), 1387#|cstrncmp_#t~short5|] [2018-02-02 09:47:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:54,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:47:54,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:47:54,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:47:54,881 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-02-02 09:47:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:55,036 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-02-02 09:47:55,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:47:55,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-02 09:47:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:55,036 INFO L225 Difference]: With dead ends: 69 [2018-02-02 09:47:55,036 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 09:47:55,037 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:47:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 09:47:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 09:47:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 09:47:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-02-02 09:47:55,039 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-02-02 09:47:55,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:55,039 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-02-02 09:47:55,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:47:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-02-02 09:47:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:47:55,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:55,040 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:55,040 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:55,040 INFO L82 PathProgramCache]: Analyzing trace with hash -349255061, now seen corresponding path program 1 times [2018-02-02 09:47:55,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:55,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:55,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:55,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:47:55,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:55,261 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-02 09:47:55,261 INFO L182 omatonBuilderFactory]: Interpolants [1518#true, 1519#false, 1520#(<= 1 main_~length1~0), 1521#(and (= (select |#valid| |main_#t~malloc13.base|) 1) (<= 1 main_~length1~0) (= 0 |main_#t~malloc13.offset|)), 1522#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (= (select |#valid| main_~nondetString1~0.base) 1)) (<= 1 main_~length1~0)), 1523#(and (<= 1 main_~length1~0) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base |main_#t~malloc14.base|))) (= main_~nondetString1~0.offset 0)), 1524#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1525#(and (= 0 main_~nondetString1~0.offset) (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 2 (select |#length| main_~nondetString1~0.base)))), 1526#(and (or (<= 2 (select |#length| |cstrncmp_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|))) (= 0 |cstrncmp_#in~s1.offset|)), 1527#(and (or (<= 2 (select |#length| cstrncmp_~s1.base)) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset))) (= cstrncmp_~s1.offset 0)), 1528#(and (= cstrncmp_~s1.offset 0) (or (<= 2 (select |#length| cstrncmp_~s1.base)) (= 0 |cstrncmp_#t~mem4|))), 1529#(and (or (<= 2 (select |#length| cstrncmp_~s1.base)) |cstrncmp_#t~short5|) (= cstrncmp_~s1.offset 0)), 1530#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))] [2018-02-02 09:47:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:55,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:47:55,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:47:55,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:47:55,262 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 13 states. [2018-02-02 09:47:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:55,506 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-02-02 09:47:55,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:47:55,506 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-02 09:47:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:55,507 INFO L225 Difference]: With dead ends: 66 [2018-02-02 09:47:55,507 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 09:47:55,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:47:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 09:47:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-02-02 09:47:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 09:47:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-02 09:47:55,509 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 33 [2018-02-02 09:47:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:55,510 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-02 09:47:55,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:47:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-02 09:47:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:47:55,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:55,511 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:55,511 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2057994991, now seen corresponding path program 1 times [2018-02-02 09:47:55,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:55,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:55,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:55,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:47:55,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:55,691 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-02 09:47:55,692 INFO L182 omatonBuilderFactory]: Interpolants [1673#true, 1674#false, 1675#(<= 1 main_~length2~0), 1676#(and (= 0 |main_#t~malloc14.offset|) (<= 1 main_~length2~0)), 1677#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0)), 1678#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (select |#length| main_~nondetString2~0.base)))), 1679#(and (or (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) |cstrncmp_#in~s2.offset|)) (<= 2 (select |#length| |cstrncmp_#in~s2.base|))) (= 0 |cstrncmp_#in~s2.offset|)), 1680#(and (or (<= 2 (select |#length| cstrncmp_~s2.base)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset))) (= cstrncmp_~s2.offset 0)), 1681#(and (or (<= 2 (select |#length| cstrncmp_~s2.base)) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem1|))) (= cstrncmp_~s2.offset 0)), 1682#(and (= cstrncmp_~s2.offset 0) (or (<= 2 (select |#length| cstrncmp_~s2.base)) (and (= |cstrncmp_#t~mem2| (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem1|)))), 1683#(and (or (<= 2 (select |#length| cstrncmp_~s2.base)) (not |cstrncmp_#t~short3|) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)))) (= cstrncmp_~s2.offset 0)), 1684#(and (= cstrncmp_~s2.offset 0) (or (<= 2 (select |#length| cstrncmp_~s2.base)) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset))))), 1685#(and (= cstrncmp_~s2.offset 0) (or (<= 2 (select |#length| cstrncmp_~s2.base)) (and (= |cstrncmp_#t~mem4| (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset))))), 1686#(and (= cstrncmp_~s2.offset 0) (or (<= 2 (select |#length| cstrncmp_~s2.base)) |cstrncmp_#t~short5|)), 1687#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset))] [2018-02-02 09:47:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:55,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:47:55,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:47:55,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:47:55,693 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 15 states. [2018-02-02 09:47:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:55,927 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-02 09:47:55,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:47:55,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-02 09:47:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:55,927 INFO L225 Difference]: With dead ends: 64 [2018-02-02 09:47:55,927 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 09:47:55,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:47:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 09:47:55,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-02-02 09:47:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 09:47:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-02-02 09:47:55,929 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 34 [2018-02-02 09:47:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:55,929 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-02-02 09:47:55,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:47:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-02-02 09:47:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:47:55,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:55,930 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:55,930 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:55,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1216715776, now seen corresponding path program 2 times [2018-02-02 09:47:55,931 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:55,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:56,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:56,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:47:56,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:56,234 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-02 09:47:56,234 INFO L182 omatonBuilderFactory]: Interpolants [1830#true, 1831#false, 1832#(and (= main_~length1~0 (select |#length| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (= 0 |main_#t~malloc13.offset|)), 1833#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 1834#(and (= 0 main_~nondetString1~0.offset) (or (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2))) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 1835#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 1836#(and (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset)), 1837#(and (= 0 |cstrncmp_#in~s1.offset|) (or (<= (select |#length| |cstrncmp_#in~s1.base|) 1) (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) 1)) (<= 3 (select |#length| |cstrncmp_#in~s1.base|)))), 1838#(and (or (= 0 (select (select |#memory_int| cstrncmp_~s1.base) 1)) (<= (select |#length| cstrncmp_~s1.base) 1) (<= 3 (select |#length| cstrncmp_~s1.base))) (= cstrncmp_~s1.offset 0)), 1839#(or (and (<= 1 cstrncmp_~s1.offset) (or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (<= (select |#length| cstrncmp_~s1.base) cstrncmp_~s1.offset))) (and (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset)) (= 1 cstrncmp_~s1.offset))), 1840#(or (and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base))) (and (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset)) (= 1 cstrncmp_~s1.offset))), 1841#(or (and (= 0 |cstrncmp_#t~mem4|) (= 1 cstrncmp_~s1.offset)) (and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)))), 1842#(or (and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base))) (and |cstrncmp_#t~short5| (= 1 cstrncmp_~s1.offset))), 1843#(and (<= 2 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))] [2018-02-02 09:47:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:56,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:47:56,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:47:56,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:47:56,235 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 14 states. [2018-02-02 09:47:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:56,615 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-02-02 09:47:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:47:56,615 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 09:47:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:56,616 INFO L225 Difference]: With dead ends: 77 [2018-02-02 09:47:56,616 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 09:47:56,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:47:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 09:47:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2018-02-02 09:47:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 09:47:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-02-02 09:47:56,618 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 44 [2018-02-02 09:47:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:56,618 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-02-02 09:47:56,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:47:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-02-02 09:47:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:47:56,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:56,618 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:56,619 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:56,619 INFO L82 PathProgramCache]: Analyzing trace with hash -936516614, now seen corresponding path program 2 times [2018-02-02 09:47:56,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:56,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:56,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:56,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:47:56,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:56,998 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-02 09:47:56,998 INFO L182 omatonBuilderFactory]: Interpolants [2016#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 2017#(and (or (<= 3 (select |#length| |cstrncmp_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) 1)) (<= (select |#length| |cstrncmp_#in~s2.base|) 1)) (= 0 |cstrncmp_#in~s2.offset|)), 2018#(and (or (<= 3 (select |#length| cstrncmp_~s2.base)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) 1)) (<= (select |#length| cstrncmp_~s2.base) 1)) (= cstrncmp_~s2.offset 0)), 2019#(and (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (select |#length| cstrncmp_~s2.base) cstrncmp_~s2.offset) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= 1 cstrncmp_~s2.offset))) (<= 1 cstrncmp_~s2.offset)), 2020#(and (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (select |#length| cstrncmp_~s2.base) cstrncmp_~s2.offset) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem1|) (= 1 cstrncmp_~s2.offset))) (<= 1 cstrncmp_~s2.offset)), 2021#(and (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (and (= |cstrncmp_#t~mem2| (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem1|) (= 1 cstrncmp_~s2.offset))) (<= 1 cstrncmp_~s2.offset)), 2022#(and (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (and (or (not |cstrncmp_#t~short3|) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)))) (= 1 cstrncmp_~s2.offset))) (<= 1 cstrncmp_~s2.offset)), 2023#(and (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= 1 cstrncmp_~s2.offset))) (<= 1 cstrncmp_~s2.offset)), 2024#(and (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (and (= |cstrncmp_#t~mem4| (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= 1 cstrncmp_~s2.offset))) (<= 1 cstrncmp_~s2.offset)), 2025#(and (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (and |cstrncmp_#t~short5| (= 1 cstrncmp_~s2.offset))) (<= 1 cstrncmp_~s2.offset)), 2026#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 2012#true, 2013#false, 2014#(and (= 0 |main_#t~malloc14.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc14.base|))), 2015#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))))] [2018-02-02 09:47:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:56,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:47:56,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:47:56,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:47:56,998 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 15 states. [2018-02-02 09:47:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:57,379 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-02 09:47:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:47:57,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 09:47:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:57,380 INFO L225 Difference]: With dead ends: 75 [2018-02-02 09:47:57,380 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 09:47:57,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:47:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 09:47:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-02-02 09:47:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 09:47:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-02-02 09:47:57,382 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 45 [2018-02-02 09:47:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:57,382 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-02-02 09:47:57,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:47:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-02-02 09:47:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 09:47:57,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:57,383 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:57,383 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash -606639285, now seen corresponding path program 3 times [2018-02-02 09:47:57,384 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:57,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:47:57,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:57,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:47:57,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:57,572 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-02 09:47:57,572 INFO L182 omatonBuilderFactory]: Interpolants [2193#true, 2194#false, 2195#(and (= main_~length1~0 (select |#length| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (= 0 |main_#t~malloc13.offset|)), 2196#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2197#(and (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 2198#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2199#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 2200#(= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ (select |#length| |cstrncmp_#in~s1.base|) (- 1)))), 2201#(= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ (select |#length| cstrncmp_~s1.base) (- 1)))), 2202#(or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (<= (select |#length| cstrncmp_~s1.base) cstrncmp_~s1.offset) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset))), 2203#(or (and (<= 0 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base))) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset))), 2204#(or (and (<= 0 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base))) (= 0 |cstrncmp_#t~mem4|)), 2205#(or (and (<= 0 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base))) |cstrncmp_#t~short5|), 2206#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))] [2018-02-02 09:47:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:47:57,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:47:57,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:47:57,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:47:57,573 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 14 states. [2018-02-02 09:47:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:57,827 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-02-02 09:47:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:47:57,827 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 09:47:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:57,828 INFO L225 Difference]: With dead ends: 66 [2018-02-02 09:47:57,828 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 09:47:57,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:47:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 09:47:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-02-02 09:47:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 09:47:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-02-02 09:47:57,830 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 55 [2018-02-02 09:47:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:57,830 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-02-02 09:47:57,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:47:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-02-02 09:47:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 09:47:57,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:57,831 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:57,831 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 09:47:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1625948657, now seen corresponding path program 3 times [2018-02-02 09:47:57,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:57,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:47:58,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:58,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:47:58,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:58,032 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-02 09:47:58,032 INFO L182 omatonBuilderFactory]: Interpolants [2368#(and (<= 0 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (and (= |cstrncmp_#t~mem2| (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem1|)))), 2369#(and (<= 0 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (not |cstrncmp_#t~short3|) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset))))), 2370#(and (<= 0 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset))))), 2371#(and (<= 0 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (and (= |cstrncmp_#t~mem4| (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset))))), 2372#(and (<= 0 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) |cstrncmp_#t~short5|)), 2373#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 2359#true, 2360#false, 2361#(and (= 0 |main_#t~malloc14.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc14.base|))), 2362#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2363#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1)))))), 2364#(= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ (select |#length| |cstrncmp_#in~s2.base|) (- 1)))), 2365#(= 0 (select (select |#memory_int| cstrncmp_~s2.base) (+ (select |#length| cstrncmp_~s2.base) (- 1)))), 2366#(or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (select |#length| cstrncmp_~s2.base) cstrncmp_~s2.offset) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset))), 2367#(or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (select |#length| cstrncmp_~s2.base) cstrncmp_~s2.offset) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem1|)))] [2018-02-02 09:47:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:47:58,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:47:58,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:47:58,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:47:58,033 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 15 states. [2018-02-02 09:47:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:58,540 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-02 09:47:58,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:47:58,541 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-02 09:47:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:58,541 INFO L225 Difference]: With dead ends: 62 [2018-02-02 09:47:58,541 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:47:58,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:47:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:47:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:47:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:47:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:47:58,542 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-02-02 09:47:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:58,542 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:47:58,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:47:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:47:58,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:47:58,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:47:58 BoogieIcfgContainer [2018-02-02 09:47:58,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:47:58,546 INFO L168 Benchmark]: Toolchain (without parser) took 6115.86 ms. Allocated memory was 395.8 MB in the beginning and 717.8 MB in the end (delta: 321.9 MB). Free memory was 352.5 MB in the beginning and 422.7 MB in the end (delta: -70.2 MB). Peak memory consumption was 251.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:58,547 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 395.8 MB. Free memory is still 359.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:47:58,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.68 ms. Allocated memory is still 395.8 MB. Free memory was 352.5 MB in the beginning and 342.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:58,547 INFO L168 Benchmark]: Boogie Preprocessor took 28.00 ms. Allocated memory is still 395.8 MB. Free memory was 342.0 MB in the beginning and 340.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:58,547 INFO L168 Benchmark]: RCFGBuilder took 247.89 ms. Allocated memory is still 395.8 MB. Free memory was 340.6 MB in the beginning and 318.0 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:58,547 INFO L168 Benchmark]: TraceAbstraction took 5667.79 ms. Allocated memory was 395.8 MB in the beginning and 717.8 MB in the end (delta: 321.9 MB). Free memory was 318.0 MB in the beginning and 422.7 MB in the end (delta: -104.7 MB). Peak memory consumption was 217.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:58,548 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.10 ms. Allocated memory is still 395.8 MB. Free memory is still 359.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.68 ms. Allocated memory is still 395.8 MB. Free memory was 352.5 MB in the beginning and 342.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.00 ms. Allocated memory is still 395.8 MB. Free memory was 342.0 MB in the beginning and 340.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 247.89 ms. Allocated memory is still 395.8 MB. Free memory was 340.6 MB in the beginning and 318.0 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5667.79 ms. Allocated memory was 395.8 MB in the beginning and 717.8 MB in the end (delta: 321.9 MB). Free memory was 318.0 MB in the beginning and 422.7 MB in the end (delta: -104.7 MB). Peak memory consumption was 217.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: 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 - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 15 error locations. SAFE Result, 5.6s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 727 SDtfs, 940 SDslu, 2185 SDs, 0 SdLazy, 1964 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 33/153 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, 18 MinimizatonAttempts, 38 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 194244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 33/153 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/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-47-58-552.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-47-58-552.csv Received shutdown request...