java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:49:59,548 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:49:59,549 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:49:59,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:49:59,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:49:59,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:49:59,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:49:59,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:49:59,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:49:59,567 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:49:59,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:49:59,568 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:49:59,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:49:59,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:49:59,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:49:59,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:49:59,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:49:59,575 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:49:59,576 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:49:59,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:49:59,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:49:59,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:49:59,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:49:59,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:49:59,580 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:49:59,581 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:49:59,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:49:59,582 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:49:59,582 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:49:59,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:49:59,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:49:59,583 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 01:49:59,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:49:59,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:49:59,593 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:49:59,594 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:49:59,594 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:49:59,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:49:59,594 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:49:59,594 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:49:59,594 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:49:59,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:49:59,594 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:49:59,594 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:49:59,595 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:49:59,595 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:49:59,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:49:59,595 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:49:59,595 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:49:59,595 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:49:59,595 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:49:59,595 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:49:59,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:49:59,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:49:59,596 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:49:59,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:49:59,632 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:49:59,635 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:49:59,636 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:49:59,637 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:49:59,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:49:59,757 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:49:59,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:49:59,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:49:59,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:49:59,763 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:49:59,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:49:59" (1/1) ... [2018-02-04 01:49:59,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5663edf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59, skipping insertion in model container [2018-02-04 01:49:59,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:49:59" (1/1) ... [2018-02-04 01:49:59,775 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:49:59,803 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:49:59,897 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:49:59,911 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:49:59,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59 WrapperNode [2018-02-04 01:49:59,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:49:59,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:49:59,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:49:59,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:49:59,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59" (1/1) ... [2018-02-04 01:49:59,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59" (1/1) ... [2018-02-04 01:49:59,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59" (1/1) ... [2018-02-04 01:49:59,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59" (1/1) ... [2018-02-04 01:49:59,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59" (1/1) ... [2018-02-04 01:49:59,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59" (1/1) ... [2018-02-04 01:49:59,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59" (1/1) ... [2018-02-04 01:49:59,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:49:59,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:49:59,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:49:59,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:49:59,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:49:59,986 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:49:59,986 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:49:59,986 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-02-04 01:49:59,986 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:49:59,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:50:00,138 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:50:00,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:50:00 BoogieIcfgContainer [2018-02-04 01:50:00,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:50:00,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:50:00,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:50:00,141 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:50:00,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:49:59" (1/3) ... [2018-02-04 01:50:00,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d97722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:50:00, skipping insertion in model container [2018-02-04 01:50:00,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:59" (2/3) ... [2018-02-04 01:50:00,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d97722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:50:00, skipping insertion in model container [2018-02-04 01:50:00,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:50:00" (3/3) ... [2018-02-04 01:50:00,143 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:50:00,149 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:50:00,153 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 01:50:00,185 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:50:00,185 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:50:00,185 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:50:00,185 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:50:00,185 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:50:00,185 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:50:00,186 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:50:00,186 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:50:00,186 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:50:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-02-04 01:50:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:50:00,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:00,203 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:00,204 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:00,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510132, now seen corresponding path program 1 times [2018-02-04 01:50:00,239 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:00,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:00,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:50:00,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,384 INFO L182 omatonBuilderFactory]: Interpolants [48#true, 49#false, 50#(= (select |#valid| |main_#t~malloc6.base|) 1), 51#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 01:50:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:50:00,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:50:00,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:50:00,399 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-02-04 01:50:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:00,547 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 01:50:00,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:50:00,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:50:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:00,558 INFO L225 Difference]: With dead ends: 44 [2018-02-04 01:50:00,558 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 01:50:00,560 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-04 01:50:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 01:50:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 01:50:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:50:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 01:50:00,592 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-02-04 01:50:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:00,593 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 01:50:00,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:50:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 01:50:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:50:00,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:00,594 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:00,594 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510131, now seen corresponding path program 1 times [2018-02-04 01:50:00,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:00,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:00,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:50:00,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,699 INFO L182 omatonBuilderFactory]: Interpolants [144#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 139#true, 140#false, 141#(<= 1 main_~length1~0), 142#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc6.base|) 1)), 143#(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-04 01:50:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:50:00,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:50:00,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:50:00,701 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-02-04 01:50:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:00,779 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 01:50:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:50:00,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 01:50:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:00,780 INFO L225 Difference]: With dead ends: 40 [2018-02-04 01:50:00,780 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 01:50:00,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:50:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 01:50:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 01:50:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 01:50:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 01:50:00,784 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-02-04 01:50:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:00,784 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 01:50:00,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:50:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 01:50:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:50:00,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:00,785 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:00,785 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695343, now seen corresponding path program 1 times [2018-02-04 01:50:00,786 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:00,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:00,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:50:00,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,813 INFO L182 omatonBuilderFactory]: Interpolants [227#true, 228#false, 229#(= 1 (select |#valid| |main_#t~malloc7.base|)), 230#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-04 01:50:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:50:00,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:50:00,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:50:00,815 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-02-04 01:50:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:00,854 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-04 01:50:00,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:50:00,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 01:50:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:00,855 INFO L225 Difference]: With dead ends: 39 [2018-02-04 01:50:00,855 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 01:50:00,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:50:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 01:50:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 01:50:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 01:50:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 01:50:00,859 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-02-04 01:50:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:00,859 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 01:50:00,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:50:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 01:50:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:50:00,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:00,860 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:00,860 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695344, now seen corresponding path program 1 times [2018-02-04 01:50:00,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:00,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:00,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:50:00,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,924 INFO L182 omatonBuilderFactory]: Interpolants [311#true, 312#false, 313#(<= 1 main_~length2~0), 314#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 315#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 01:50:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:50:00,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:50:00,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:50:00,925 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-02-04 01:50:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:00,955 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-04 01:50:00,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:50:00,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 01:50:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:00,956 INFO L225 Difference]: With dead ends: 38 [2018-02-04 01:50:00,956 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 01:50:00,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:50:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 01:50:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 01:50:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 01:50:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 01:50:00,959 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-04 01:50:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:00,959 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 01:50:00,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:50:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 01:50:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:50:00,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:00,959 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:00,959 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash -559562515, now seen corresponding path program 1 times [2018-02-04 01:50:00,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:00,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:00,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:50:00,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,994 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| main_~nondetString1~0.base)), 397#(= 1 (select |#valid| |cstrspn_#in~s1.base|)), 398#(= 1 (select |#valid| cstrspn_~p~0.base)), 399#(= 1 (select |#valid| |cstrspn_#t~post0.base|))] [2018-02-04 01:50:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:00,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:50:00,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:50:00,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:50:00,994 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-04 01:50:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:01,054 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-02-04 01:50:01,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:50:01,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 01:50:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:01,055 INFO L225 Difference]: With dead ends: 37 [2018-02-04 01:50:01,055 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 01:50:01,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:50:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 01:50:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 01:50:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 01:50:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-04 01:50:01,063 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-02-04 01:50:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:01,063 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-04 01:50:01,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:50:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-04 01:50:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:50:01,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:01,064 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:01,064 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:01,064 INFO L82 PathProgramCache]: Analyzing trace with hash -559562514, now seen corresponding path program 1 times [2018-02-04 01:50:01,065 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:01,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:01,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:50:01,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,182 INFO L182 omatonBuilderFactory]: Interpolants [480#(<= 1 main_~length1~0), 481#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0)), 482#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 483#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 484#(and (<= 1 (select |#length| |cstrspn_#in~s1.base|)) (= 0 |cstrspn_#in~s1.offset|)), 485#(and (= 0 cstrspn_~p~0.offset) (<= 1 (select |#length| cstrspn_~p~0.base))), 486#(and (= |cstrspn_#t~post0.offset| 0) (<= 1 (select |#length| |cstrspn_#t~post0.base|))), 478#true, 479#false] [2018-02-04 01:50:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:50:01,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:50:01,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:50:01,183 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-02-04 01:50:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:01,343 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 01:50:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:50:01,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-04 01:50:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:01,344 INFO L225 Difference]: With dead ends: 40 [2018-02-04 01:50:01,344 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 01:50:01,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:50:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 01:50:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-04 01:50:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 01:50:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 01:50:01,349 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-02-04 01:50:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:01,349 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 01:50:01,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:50:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 01:50:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:50:01,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:01,350 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] [2018-02-04 01:50:01,350 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:01,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796544, now seen corresponding path program 1 times [2018-02-04 01:50:01,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:01,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:01,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:50:01,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,438 INFO L182 omatonBuilderFactory]: Interpolants [576#true, 577#false, 578#(= 1 (select |#valid| main_~nondetString2~0.base)), 579#(= 1 (select |#valid| |cstrspn_#in~s2.base|)), 580#(= 1 (select |#valid| cstrspn_~s2.base)), 581#(= 1 (select |#valid| cstrspn_~spanp~0.base)), 582#(= 1 (select |#valid| |cstrspn_#t~post2.base|))] [2018-02-04 01:50:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:50:01,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:50:01,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:50:01,439 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 7 states. [2018-02-04 01:50:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:01,526 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-04 01:50:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:50:01,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 01:50:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:01,527 INFO L225 Difference]: With dead ends: 39 [2018-02-04 01:50:01,527 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 01:50:01,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:50:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 01:50:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-02-04 01:50:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 01:50:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 01:50:01,529 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2018-02-04 01:50:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:01,529 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 01:50:01,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:50:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 01:50:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:50:01,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:01,530 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] [2018-02-04 01:50:01,530 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:01,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796543, now seen corresponding path program 1 times [2018-02-04 01:50:01,530 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:01,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:01,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:50:01,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,639 INFO L182 omatonBuilderFactory]: Interpolants [672#(and (<= 1 (select |#length| |cstrspn_#in~s2.base|)) (= 0 |cstrspn_#in~s2.offset|)), 673#(and (= 0 cstrspn_~s2.offset) (<= 1 (select |#length| cstrspn_~s2.base))), 674#(and (= 0 cstrspn_~spanp~0.offset) (<= 1 (select |#length| cstrspn_~spanp~0.base))), 675#(and (= |cstrspn_#t~post2.offset| 0) (<= 1 (select |#length| |cstrspn_#t~post2.base|))), 666#true, 667#false, 668#(<= 1 main_~length2~0), 669#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 670#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 671#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 01:50:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:50:01,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:50:01,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:50:01,640 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-02-04 01:50:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:01,788 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-04 01:50:01,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:50:01,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-04 01:50:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:01,789 INFO L225 Difference]: With dead ends: 42 [2018-02-04 01:50:01,789 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 01:50:01,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:50:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 01:50:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-02-04 01:50:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 01:50:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 01:50:01,791 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 21 [2018-02-04 01:50:01,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:01,792 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 01:50:01,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:50:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 01:50:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:50:01,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:01,792 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:01,792 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1264210553, now seen corresponding path program 1 times [2018-02-04 01:50:01,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:01,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:01,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 01:50:01,989 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,990 INFO L182 omatonBuilderFactory]: Interpolants [768#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 769#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc6.base|) 1)), 770#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 771#(and (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 772#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 773#(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)), 774#(= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) |cstrspn_#in~s1.offset|)), 775#(= 0 (select (select |#memory_int| cstrspn_~p~0.base) cstrspn_~p~0.offset)), 776#(= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|)), 777#(= 0 |cstrspn_#t~mem1|), 778#(= 0 cstrspn_~c~0), 779#(not (= cstrspn_~c~0 cstrspn_~sc~0)), 766#true, 767#false] [2018-02-04 01:50:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:01,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:50:01,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:50:01,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:50:01,991 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 14 states. [2018-02-04 01:50:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:02,287 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-02-04 01:50:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:50:02,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-04 01:50:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:02,289 INFO L225 Difference]: With dead ends: 72 [2018-02-04 01:50:02,289 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 01:50:02,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:50:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 01:50:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-02-04 01:50:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 01:50:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 01:50:02,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 26 [2018-02-04 01:50:02,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:02,294 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 01:50:02,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:50:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 01:50:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:50:02,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:02,295 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:02,295 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1264212731, now seen corresponding path program 1 times [2018-02-04 01:50:02,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:02,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:02,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:02,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:50:02,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:02,516 INFO L182 omatonBuilderFactory]: Interpolants [936#true, 937#false, 938#(<= 1 main_~length2~0), 939#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0)), 940#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0)), 941#(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)))), 942#(and (or (<= 2 (select |#length| |cstrspn_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrspn_#in~s2.base|) |cstrspn_#in~s2.offset|))) (= 0 |cstrspn_#in~s2.offset|)), 943#(and (= 0 cstrspn_~s2.offset) (or (<= 2 (select |#length| cstrspn_~s2.base)) (= 0 (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)))), 944#(and (or (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) cstrspn_~spanp~0.offset)) (<= 2 (select |#length| cstrspn_~spanp~0.base))) (= 0 cstrspn_~spanp~0.offset)), 945#(and (= |cstrspn_#t~post2.offset| 0) (= |cstrspn_#t~post2.base| cstrspn_~spanp~0.base) (or (= 0 (select (select |#memory_int| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|)) (and (<= (+ cstrspn_~spanp~0.offset 1) (+ (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|)) (<= (+ |cstrspn_#t~post2.offset| 1) cstrspn_~spanp~0.offset)))), 946#(or (and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)) (= 0 |cstrspn_#t~mem3|)), 947#(or (and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)) (= 0 cstrspn_~sc~0)), 948#(and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)), 949#(and (<= 1 |cstrspn_#t~post2.offset|) (<= (+ |cstrspn_#t~post2.offset| 1) (select |#length| |cstrspn_#t~post2.base|)))] [2018-02-04 01:50:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:02,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:50:02,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:50:02,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:50:02,516 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 14 states. [2018-02-04 01:50:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:02,981 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-02-04 01:50:02,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:50:02,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-04 01:50:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:02,984 INFO L225 Difference]: With dead ends: 80 [2018-02-04 01:50:02,984 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 01:50:02,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:50:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 01:50:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-02-04 01:50:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 01:50:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-04 01:50:02,993 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 26 [2018-02-04 01:50:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:02,993 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-04 01:50:02,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:50:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-04 01:50:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:50:02,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:02,994 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:02,995 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash 446562103, now seen corresponding path program 1 times [2018-02-04 01:50:02,995 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:03,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:03,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:03,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:50:03,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:03,301 INFO L182 omatonBuilderFactory]: Interpolants [1124#true, 1125#false, 1126#(<= 1 main_~length1~0), 1127#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1128#(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)), 1129#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1130#(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)), 1131#(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)))), 1132#(and (or (= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) |cstrspn_#in~s1.offset|)) (<= 2 (select |#length| |cstrspn_#in~s1.base|))) (= 0 |cstrspn_#in~s1.offset|)), 1133#(and (= 0 cstrspn_~p~0.offset) (or (<= 2 (select |#length| cstrspn_~p~0.base)) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) cstrspn_~p~0.offset)))), 1134#(and (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (or (and (= |cstrspn_#t~post0.base| cstrspn_~p~0.base) (<= (+ cstrspn_~p~0.offset 1) (+ |cstrspn_#t~post0.offset| (select |#length| |cstrspn_#t~post0.base|)))) (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|))) (= |cstrspn_#t~post0.offset| 0)), 1135#(and (<= 1 cstrspn_~p~0.offset) (or (= 0 |cstrspn_#t~mem1|) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))), 1136#(and (<= 1 cstrspn_~p~0.offset) (or (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)) (= 0 cstrspn_~c~0))), 1137#(and (<= 1 cstrspn_~p~0.offset) (or (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)) (not (= cstrspn_~c~0 cstrspn_~sc~0)))), 1138#(and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))), 1139#(and (<= (+ |cstrspn_#t~post0.offset| 1) (select |#length| |cstrspn_#t~post0.base|)) (<= 1 |cstrspn_#t~post0.offset|))] [2018-02-04 01:50:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:03,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:50:03,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:50:03,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:50:03,302 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 16 states. [2018-02-04 01:50:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:03,707 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-02-04 01:50:03,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 01:50:03,707 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-02-04 01:50:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:03,708 INFO L225 Difference]: With dead ends: 92 [2018-02-04 01:50:03,708 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 01:50:03,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-02-04 01:50:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 01:50:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-02-04 01:50:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 01:50:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-02-04 01:50:03,711 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 26 [2018-02-04 01:50:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:03,712 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-02-04 01:50:03,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:50:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-02-04 01:50:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:50:03,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:03,712 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:03,712 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:03,713 INFO L82 PathProgramCache]: Analyzing trace with hash -53536959, now seen corresponding path program 2 times [2018-02-04 01:50:03,713 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:03,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:03,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:03,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:50:03,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:03,972 INFO L182 omatonBuilderFactory]: Interpolants [1345#true, 1346#false, 1347#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1348#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 1349#(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))))), 1350#(and (or (<= 3 (select |#length| |cstrspn_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrspn_#in~s2.base|) 1)) (<= (select |#length| |cstrspn_#in~s2.base|) 1)) (= 0 |cstrspn_#in~s2.offset|)), 1351#(and (= 0 cstrspn_~s2.offset) (or (<= 3 (select |#length| cstrspn_~s2.base)) (= 0 (select (select |#memory_int| cstrspn_~s2.base) 1)) (<= (select |#length| cstrspn_~s2.base) 1))), 1352#(and (= 0 cstrspn_~spanp~0.offset) (or (<= (select |#length| cstrspn_~spanp~0.base) 1) (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) 1)) (<= 3 (select |#length| cstrspn_~spanp~0.base)))), 1353#(and (= |cstrspn_#t~post2.offset| 0) (= |cstrspn_#t~post2.base| cstrspn_~spanp~0.base) (or (<= (+ cstrspn_~spanp~0.offset 2) (+ (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|)) (<= (+ (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|) cstrspn_~spanp~0.offset) (and (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) 1)) (<= cstrspn_~spanp~0.offset (+ |cstrspn_#t~post2.offset| 1)))) (<= (+ |cstrspn_#t~post2.offset| 1) cstrspn_~spanp~0.offset)), 1354#(and (or (<= (+ cstrspn_~spanp~0.offset 2) (select |#length| cstrspn_~spanp~0.base)) (<= (select |#length| cstrspn_~spanp~0.base) cstrspn_~spanp~0.offset) (and (<= cstrspn_~spanp~0.offset 1) (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) 1)))) (<= 1 cstrspn_~spanp~0.offset)), 1355#(and (or (<= (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|) (and (= 1 |cstrspn_#t~post2.offset|) (= 0 (select (select |#memory_int| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|))) (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base))) (<= 2 cstrspn_~spanp~0.offset)), 1356#(and (or (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (= 0 |cstrspn_#t~mem3|)) (<= 2 cstrspn_~spanp~0.offset)), 1357#(and (<= 2 cstrspn_~spanp~0.offset) (or (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (= 0 cstrspn_~sc~0))), 1358#(and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 2 cstrspn_~spanp~0.offset)), 1359#(and (<= 2 |cstrspn_#t~post2.offset|) (<= (+ |cstrspn_#t~post2.offset| 1) (select |#length| |cstrspn_#t~post2.base|)))] [2018-02-04 01:50:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:03,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:50:03,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:50:03,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:50:03,973 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 15 states. [2018-02-04 01:50:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:04,364 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-02-04 01:50:04,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:50:04,364 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2018-02-04 01:50:04,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:04,365 INFO L225 Difference]: With dead ends: 132 [2018-02-04 01:50:04,366 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 01:50:04,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:50:04,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 01:50:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2018-02-04 01:50:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 01:50:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2018-02-04 01:50:04,371 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 31 [2018-02-04 01:50:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:04,371 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2018-02-04 01:50:04,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:50:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2018-02-04 01:50:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:50:04,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:04,372 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:04,372 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1129910615, now seen corresponding path program 1 times [2018-02-04 01:50:04,373 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:04,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:04,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:04,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:50:04,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:04,472 INFO L182 omatonBuilderFactory]: Interpolants [1620#true, 1621#false, 1622#(= |#valid| |old(#valid)|), 1623#(and (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1624#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.base |main_#t~malloc6.base|) (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|)), 1625#(and (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= (store (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |main_#t~malloc7.base| 0) |old(#valid)|)), 1626#(= (store |#valid| |main_#t~malloc7.base| 0) |old(#valid)|)] [2018-02-04 01:50:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:04,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:50:04,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:50:04,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:50:04,473 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 7 states. [2018-02-04 01:50:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:04,547 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2018-02-04 01:50:04,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:50:04,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 01:50:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:04,548 INFO L225 Difference]: With dead ends: 101 [2018-02-04 01:50:04,548 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 01:50:04,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:50:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 01:50:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-04 01:50:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 01:50:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-02-04 01:50:04,551 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 32 [2018-02-04 01:50:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:04,551 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-02-04 01:50:04,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:50:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-02-04 01:50:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 01:50:04,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:04,552 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:04,552 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:04,552 INFO L82 PathProgramCache]: Analyzing trace with hash -373803070, now seen corresponding path program 2 times [2018-02-04 01:50:04,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:04,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:04,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:04,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 01:50:04,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:04,822 INFO L182 omatonBuilderFactory]: Interpolants [1824#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 1825#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= main_~nondetString1~0.offset 0)), 1826#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1827#(and (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1828#(and (or (<= (select |#length| |cstrspn_#in~s1.base|) 1) (<= 3 (select |#length| |cstrspn_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) 1))) (= 0 |cstrspn_#in~s1.offset|)), 1829#(and (= 0 cstrspn_~p~0.offset) (or (<= (select |#length| cstrspn_~p~0.base) 1) (<= 3 (select |#length| cstrspn_~p~0.base)) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) 1)))), 1830#(and (or (and (= |cstrspn_#t~post0.base| cstrspn_~p~0.base) (<= (+ |cstrspn_#t~post0.offset| (select |#length| |cstrspn_#t~post0.base|)) cstrspn_~p~0.offset)) (and (<= cstrspn_~p~0.offset (+ |cstrspn_#t~post0.offset| 1)) (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) 1)) (= |cstrspn_#t~post0.base| cstrspn_~p~0.base)) (and (<= (+ cstrspn_~p~0.offset 2) (+ |cstrspn_#t~post0.offset| (select |#length| |cstrspn_#t~post0.base|))) (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (= |cstrspn_#t~post0.base| cstrspn_~p~0.base))) (= |cstrspn_#t~post0.offset| 0)), 1831#(or (<= (select |#length| cstrspn_~p~0.base) cstrspn_~p~0.offset) (and (<= 1 cstrspn_~p~0.offset) (<= cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) 1))) (and (<= (+ cstrspn_~p~0.offset 2) (select |#length| cstrspn_~p~0.base)) (<= 1 cstrspn_~p~0.offset))), 1832#(or (and (= 1 |cstrspn_#t~post0.offset|) (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|))) (<= (select |#length| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|) (and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))), 1833#(or (and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (= 0 |cstrspn_#t~mem1|)), 1834#(or (and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (= 0 cstrspn_~c~0)), 1835#(or (and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= cstrspn_~c~0 cstrspn_~sc~0))), 1836#(and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))), 1837#(and (<= 2 |cstrspn_#t~post0.offset|) (<= (+ |cstrspn_#t~post0.offset| 1) (select |#length| |cstrspn_#t~post0.base|))), 1821#true, 1822#false, 1823#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1))] [2018-02-04 01:50:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:04,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 01:50:04,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 01:50:04,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-04 01:50:04,823 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 17 states. [2018-02-04 01:50:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:05,293 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 01:50:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 01:50:05,293 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-02-04 01:50:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:05,294 INFO L225 Difference]: With dead ends: 112 [2018-02-04 01:50:05,294 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 01:50:05,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-04 01:50:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 01:50:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-02-04 01:50:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 01:50:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2018-02-04 01:50:05,298 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 34 [2018-02-04 01:50:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:05,298 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2018-02-04 01:50:05,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 01:50:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2018-02-04 01:50:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 01:50:05,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:05,300 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:05,300 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1516443323, now seen corresponding path program 3 times [2018-02-04 01:50:05,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:05,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 01:50:05,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:05,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:50:05,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:05,486 INFO L182 omatonBuilderFactory]: Interpolants [2089#true, 2090#false, 2091#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 2092#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2093#(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)))))), 2094#(= 0 (select (select |#memory_int| |cstrspn_#in~s2.base|) (+ (select |#length| |cstrspn_#in~s2.base|) (- 1)))), 2095#(= 0 (select (select |#memory_int| cstrspn_~s2.base) (+ (select |#length| cstrspn_~s2.base) (- 1)))), 2096#(= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) (+ (select |#length| cstrspn_~spanp~0.base) (- 1)))), 2097#(and (= |cstrspn_#t~post2.base| cstrspn_~spanp~0.base) (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) (+ (select |#length| |cstrspn_#t~post2.base|) (- 1))))), 2098#(or (= 0 (select (select |#memory_int| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|)) (and (or (<= (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|) (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base))) (<= (+ |cstrspn_#t~post2.offset| 1) cstrspn_~spanp~0.offset))), 2099#(or (and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)) (= 0 |cstrspn_#t~mem3|)), 2100#(or (and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)) (= 0 cstrspn_~sc~0)), 2101#(and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)), 2102#(and (<= 1 |cstrspn_#t~post2.offset|) (<= (+ |cstrspn_#t~post2.offset| 1) (select |#length| |cstrspn_#t~post2.base|)))] [2018-02-04 01:50:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 01:50:05,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:50:05,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:50:05,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:50:05,486 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 14 states. [2018-02-04 01:50:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:05,803 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-02-04 01:50:05,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:50:05,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-02-04 01:50:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:05,804 INFO L225 Difference]: With dead ends: 108 [2018-02-04 01:50:05,804 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 01:50:05,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:50:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 01:50:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 43. [2018-02-04 01:50:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 01:50:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 01:50:05,807 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2018-02-04 01:50:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:05,807 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 01:50:05,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:50:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 01:50:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 01:50:05,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:05,808 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:05,808 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:05,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2017637709, now seen corresponding path program 3 times [2018-02-04 01:50:05,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:05,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:50:06,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:06,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 01:50:06,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:06,198 INFO L182 omatonBuilderFactory]: Interpolants [2276#true, 2277#false, 2278#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 2279#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2280#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= main_~nondetString1~0.offset 0)), 2281#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2282#(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)), 2283#(= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) (+ (select |#length| |cstrspn_#in~s1.base|) (- 1)))), 2284#(= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1)))), 2285#(and (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) (+ (select |#length| |cstrspn_#t~post0.base|) (- 1)))) (= |cstrspn_#t~post0.base| cstrspn_~p~0.base)), 2286#(and (= cstrspn_~s2.base cstrspn_~spanp~0.base) (= cstrspn_~s2.offset cstrspn_~spanp~0.offset) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1))))), 2287#(and (= |cstrspn_#t~post2.base| cstrspn_~s2.base) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1)))) (= |cstrspn_#t~post2.offset| cstrspn_~s2.offset)), 2288#(and (= |cstrspn_#t~mem3| (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1))))), 2289#(and (= cstrspn_~sc~0 (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1))))), 2290#(not (= (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1))) (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset))), 2291#(or (<= (select |#length| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|) (and (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|) (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)))), 2292#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= |cstrspn_#t~mem1| (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)))), 2293#(or (not (= cstrspn_~c~0 (select (select |#memory_int| cstrspn_~spanp~0.base) cstrspn_~spanp~0.offset))) (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))), 2294#(or (not (= cstrspn_~c~0 (select (select |#memory_int| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|))) (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))), 2295#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= cstrspn_~c~0 |cstrspn_#t~mem3|))), 2296#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= cstrspn_~c~0 cstrspn_~sc~0))), 2297#(and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))), 2298#(and (<= (+ |cstrspn_#t~post0.offset| 1) (select |#length| |cstrspn_#t~post0.base|)) (<= 1 |cstrspn_#t~post0.offset|))] [2018-02-04 01:50:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:50:06,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 01:50:06,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 01:50:06,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:50:06,199 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 23 states. [2018-02-04 01:50:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:06,984 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-04 01:50:06,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 01:50:06,984 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-02-04 01:50:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:06,984 INFO L225 Difference]: With dead ends: 81 [2018-02-04 01:50:06,984 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 01:50:06,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=2106, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 01:50:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 01:50:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2018-02-04 01:50:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 01:50:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 01:50:06,986 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 42 [2018-02-04 01:50:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:06,986 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 01:50:06,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 01:50:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 01:50:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 01:50:06,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:06,987 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:06,987 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 01:50:06,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1167544427, now seen corresponding path program 1 times [2018-02-04 01:50:06,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:06,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 01:50:07,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:07,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:50:07,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:07,245 INFO L182 omatonBuilderFactory]: Interpolants [2496#(and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))), 2497#(and (<= (+ |cstrspn_#t~post0.offset| 1) (select |#length| |cstrspn_#t~post0.base|)) (<= 1 |cstrspn_#t~post0.offset|)), 2482#true, 2483#false, 2484#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 2485#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2486#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= main_~nondetString1~0.offset 0)), 2487#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2488#(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)), 2489#(= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) (+ (select |#length| |cstrspn_#in~s1.base|) (- 1)))), 2490#(= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1)))), 2491#(and (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) (+ (select |#length| |cstrspn_#t~post0.base|) (- 1)))) (= |cstrspn_#t~post0.base| cstrspn_~p~0.base)), 2492#(or (and (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (or (<= (select |#length| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))) (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|))), 2493#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (= 0 |cstrspn_#t~mem1|)), 2494#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (= 0 cstrspn_~c~0)), 2495#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= cstrspn_~c~0 cstrspn_~sc~0)))] [2018-02-04 01:50:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 01:50:07,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:50:07,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:50:07,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:50:07,246 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 16 states. [2018-02-04 01:50:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:07,578 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-04 01:50:07,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:50:07,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-02-04 01:50:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:07,578 INFO L225 Difference]: With dead ends: 53 [2018-02-04 01:50:07,578 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:50:07,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:50:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:50:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:50:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:50:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:50:07,579 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-02-04 01:50:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:07,579 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:50:07,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:50:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:50:07,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:50:07,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:50:07 BoogieIcfgContainer [2018-02-04 01:50:07,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:50:07,583 INFO L168 Benchmark]: Toolchain (without parser) took 7824.87 ms. Allocated memory was 381.7 MB in the beginning and 759.7 MB in the end (delta: 378.0 MB). Free memory was 338.4 MB in the beginning and 605.2 MB in the end (delta: -266.8 MB). Peak memory consumption was 111.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:50:07,583 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 381.7 MB. Free memory is still 345.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:50:07,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.07 ms. Allocated memory is still 381.7 MB. Free memory was 338.4 MB in the beginning and 327.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:50:07,584 INFO L168 Benchmark]: Boogie Preprocessor took 28.45 ms. Allocated memory is still 381.7 MB. Free memory was 327.8 MB in the beginning and 326.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:50:07,584 INFO L168 Benchmark]: RCFGBuilder took 192.49 ms. Allocated memory is still 381.7 MB. Free memory was 326.5 MB in the beginning and 307.9 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:50:07,584 INFO L168 Benchmark]: TraceAbstraction took 7443.34 ms. Allocated memory was 381.7 MB in the beginning and 759.7 MB in the end (delta: 378.0 MB). Free memory was 306.6 MB in the beginning and 605.2 MB in the end (delta: -298.6 MB). Peak memory consumption was 79.5 MB. Max. memory is 5.3 GB. [2018-02-04 01:50:07,585 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 381.7 MB. Free memory is still 345.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.07 ms. Allocated memory is still 381.7 MB. Free memory was 338.4 MB in the beginning and 327.8 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.45 ms. Allocated memory is still 381.7 MB. Free memory was 327.8 MB in the beginning and 326.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 192.49 ms. Allocated memory is still 381.7 MB. Free memory was 326.5 MB in the beginning and 307.9 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7443.34 ms. Allocated memory was 381.7 MB in the beginning and 759.7 MB in the end (delta: 378.0 MB). Free memory was 306.6 MB in the beginning and 605.2 MB in the end (delta: -298.6 MB). Peak memory consumption was 79.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: 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 - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. SAFE Result, 7.4s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 482 SDtfs, 821 SDslu, 2189 SDs, 0 SdLazy, 2544 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 27/123 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 129 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 121415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 27/123 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-50-07-589.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-50-07-589.csv Received shutdown request...