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_cmemrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:59:50,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:59:50,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:59:50,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:59:50,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:59:50,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:59:50,064 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:59:50,065 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:59:50,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:59:50,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:59:50,067 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:59:50,067 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:59:50,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:59:50,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:59:50,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:59:50,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:59:50,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:59:50,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:59:50,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:59:50,076 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:59:50,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:59:50,078 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:59:50,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:59:50,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:59:50,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:59:50,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:59:50,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:59:50,081 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:59:50,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:59:50,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:59:50,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:59:50,082 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 14:59:50,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:59:50,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:59:50,093 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:59:50,093 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:59:50,093 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:59:50,093 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:59:50,094 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:59:50,094 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:59:50,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:59:50,094 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:59:50,094 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:59:50,094 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:59:50,095 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:59:50,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:59:50,095 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:59:50,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:59:50,095 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:59:50,095 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:59:50,096 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:59:50,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:59:50,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:59:50,096 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:59:50,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:59:50,140 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:59:50,144 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:59:50,145 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:59:50,146 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:59:50,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:59:50,282 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:59:50,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:59:50,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:59:50,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:59:50,290 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:59:50,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:59:50" (1/1) ... [2018-02-04 14:59:50,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3290021f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50, skipping insertion in model container [2018-02-04 14:59:50,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:59:50" (1/1) ... [2018-02-04 14:59:50,306 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:59:50,335 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:59:50,420 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:59:50,431 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:59:50,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50 WrapperNode [2018-02-04 14:59:50,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:59:50,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:59:50,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:59:50,436 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:59:50,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50" (1/1) ... [2018-02-04 14:59:50,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50" (1/1) ... [2018-02-04 14:59:50,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50" (1/1) ... [2018-02-04 14:59:50,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50" (1/1) ... [2018-02-04 14:59:50,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50" (1/1) ... [2018-02-04 14:59:50,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50" (1/1) ... [2018-02-04 14:59:50,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50" (1/1) ... [2018-02-04 14:59:50,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:59:50,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:59:50,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:59:50,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:59:50,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:59:50,498 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:59:50,498 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:59:50,499 INFO L136 BoogieDeclarations]: Found implementation of procedure cmemrchr [2018-02-04 14:59:50,499 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure cmemrchr [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:59:50,499 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:59:50,626 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:59:50,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:59:50 BoogieIcfgContainer [2018-02-04 14:59:50,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:59:50,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:59:50,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:59:50,630 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:59:50,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:59:50" (1/3) ... [2018-02-04 14:59:50,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5659b65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:59:50, skipping insertion in model container [2018-02-04 14:59:50,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:50" (2/3) ... [2018-02-04 14:59:50,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5659b65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:59:50, skipping insertion in model container [2018-02-04 14:59:50,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:59:50" (3/3) ... [2018-02-04 14:59:50,634 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:59:50,641 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:59:50,645 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 14:59:50,680 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:59:50,680 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:59:50,681 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:59:50,681 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:59:50,681 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:59:50,681 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:59:50,681 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:59:50,681 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:59:50,682 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:59:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-04 14:59:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:59:50,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:50,706 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:50,706 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:50,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1869622704, now seen corresponding path program 1 times [2018-02-04 14:59:50,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:50,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:50,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:50,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:59:50,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:50,943 INFO L182 omatonBuilderFactory]: Interpolants [34#true, 35#false, 36#(= 1 (select |#valid| |main_#t~malloc6.base|)), 37#(= 1 (select |#valid| main_~nondetArea~0.base)), 38#(= 1 (select |#valid| |cmemrchr_#in~s.base|)), 39#(= 1 (select |#valid| cmemrchr_~s.base)), 40#(= 1 (select |#valid| cmemrchr_~cp~0.base)), 41#(= 1 (select |#valid| |cmemrchr_#t~pre1.base|))] [2018-02-04 14:59:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:50,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:59:50,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:59:50,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:59:50,959 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 8 states. [2018-02-04 14:59:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:51,170 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-02-04 14:59:51,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:59:51,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 14:59:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:51,180 INFO L225 Difference]: With dead ends: 33 [2018-02-04 14:59:51,180 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 14:59:51,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:59:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 14:59:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-02-04 14:59:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 14:59:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-02-04 14:59:51,206 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2018-02-04 14:59:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:51,206 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-02-04 14:59:51,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:59:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-02-04 14:59:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:59:51,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:51,207 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:51,207 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:51,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1869622705, now seen corresponding path program 1 times [2018-02-04 14:59:51,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:51,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:51,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:51,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:59:51,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:51,415 INFO L182 omatonBuilderFactory]: Interpolants [112#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 113#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~n~0) (<= main_~n~0 1) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 114#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (<= main_~n~0 1) (= 0 main_~nondetArea~0.offset)), 115#(and (<= 1 |cmemrchr_#in~n|) (= 0 |cmemrchr_#in~s.offset|) (<= |cmemrchr_#in~n| 1) (<= |cmemrchr_#in~n| (select |#length| |cmemrchr_#in~s.base|))), 116#(and (< 0 (+ (div cmemrchr_~n 4294967296) 1)) (<= cmemrchr_~n 1) (= cmemrchr_~s.offset 0) (<= cmemrchr_~n (select |#length| cmemrchr_~s.base))), 117#(and (<= 1 cmemrchr_~cp~0.offset) (<= cmemrchr_~cp~0.offset (select |#length| cmemrchr_~cp~0.base))), 118#(and (<= (+ |cmemrchr_#t~pre1.offset| 1) (select |#length| |cmemrchr_#t~pre1.base|)) (<= 0 |cmemrchr_#t~pre1.offset|)), 110#true, 111#false] [2018-02-04 14:59:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:51,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:59:51,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:59:51,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:59:51,418 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 9 states. [2018-02-04 14:59:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:51,569 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-02-04 14:59:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:59:51,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-02-04 14:59:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:51,570 INFO L225 Difference]: With dead ends: 53 [2018-02-04 14:59:51,570 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 14:59:51,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:59:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 14:59:51,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2018-02-04 14:59:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 14:59:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-02-04 14:59:51,575 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 15 [2018-02-04 14:59:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:51,575 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-02-04 14:59:51,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:59:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-02-04 14:59:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:59:51,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:51,576 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:51,576 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1060276079, now seen corresponding path program 1 times [2018-02-04 14:59:51,577 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:51,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:51,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:51,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:59:51,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:51,744 INFO L182 omatonBuilderFactory]: Interpolants [224#true, 225#false, 226#(<= main_~n~0 2147483647), 227#(and (<= main_~n~0 2147483647) (<= 1 main_~n~0)), 228#(and (<= main_~n~0 2147483647) (= 0 |main_#t~malloc6.offset|) (<= 1 main_~n~0) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 229#(and (<= main_~n~0 2147483647) (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 230#(and (<= 1 |cmemrchr_#in~n|) (= 0 |cmemrchr_#in~s.offset|) (<= |cmemrchr_#in~n| (select |#length| |cmemrchr_#in~s.base|)) (<= |cmemrchr_#in~n| 2147483647)), 231#(and (< 0 (+ (div cmemrchr_~n 4294967296) 1)) (<= cmemrchr_~n 2147483647) (= cmemrchr_~s.offset 0) (<= cmemrchr_~n (select |#length| cmemrchr_~s.base))), 232#(and (<= 1 cmemrchr_~cp~0.offset) (<= cmemrchr_~cp~0.offset (select |#length| cmemrchr_~cp~0.base))), 233#(and (<= (+ |cmemrchr_#t~pre1.offset| 1) (select |#length| |cmemrchr_#t~pre1.base|)) (<= 0 |cmemrchr_#t~pre1.offset|))] [2018-02-04 14:59:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:51,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:59:51,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:59:51,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:59:51,745 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 10 states. [2018-02-04 14:59:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:51,928 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-02-04 14:59:51,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:59:51,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-02-04 14:59:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:51,932 INFO L225 Difference]: With dead ends: 54 [2018-02-04 14:59:51,932 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 14:59:51,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:59:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 14:59:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 29. [2018-02-04 14:59:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 14:59:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-02-04 14:59:51,937 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2018-02-04 14:59:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:51,937 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-02-04 14:59:51,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:59:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-02-04 14:59:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:59:51,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:51,938 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:51,939 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1406269975, now seen corresponding path program 1 times [2018-02-04 14:59:51,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:51,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:52,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:59:52,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,160 INFO L182 omatonBuilderFactory]: Interpolants [336#(and (<= cmemrchr_~n (+ (* 4294967296 (div cmemrchr_~n 4294967296)) 1)) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n)), 337#(<= |cmemrchr_#t~pre0| (* 4294967296 (div |cmemrchr_#t~pre0| 4294967296))), 327#true, 328#false, 329#(<= main_~n~0 1), 330#(and (= 0 |main_#t~malloc6.offset|) (<= main_~n~0 1) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 331#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= main_~n~0 1) (= 0 main_~nondetArea~0.offset)), 332#(and (= 0 |cmemrchr_#in~s.offset|) (<= (select |#length| |cmemrchr_#in~s.base|) 1)), 333#(and (<= (select |#length| cmemrchr_~s.base) 1) (= cmemrchr_~s.offset 0)), 334#(and (or (<= (+ cmemrchr_~cp~0.offset 1) 0) (<= (+ cmemrchr_~n (select |#length| cmemrchr_~cp~0.base)) (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1))) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n)), 335#(and (or (<= (+ |cmemrchr_#t~pre1.offset| 2) 0) (and (<= (+ cmemrchr_~n (select |#length| cmemrchr_~cp~0.base)) (+ |cmemrchr_#t~pre1.offset| (* 4294967296 (div cmemrchr_~n 4294967296)) 2)) (= |cmemrchr_#t~pre1.base| cmemrchr_~cp~0.base))) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n))] [2018-02-04 14:59:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:59:52,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:59:52,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:59:52,162 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 11 states. [2018-02-04 14:59:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:52,410 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 14:59:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:59:52,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-02-04 14:59:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:52,411 INFO L225 Difference]: With dead ends: 49 [2018-02-04 14:59:52,412 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 14:59:52,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:59:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 14:59:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-02-04 14:59:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 14:59:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-02-04 14:59:52,415 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2018-02-04 14:59:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:52,415 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-02-04 14:59:52,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:59:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-02-04 14:59:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:59:52,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:52,416 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:52,416 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:52,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2125153178, now seen corresponding path program 1 times [2018-02-04 14:59:52,417 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:52,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:52,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:59:52,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,470 INFO L182 omatonBuilderFactory]: Interpolants [443#true, 444#false, 445#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 446#(= cmemrchr_~n |cmemrchr_#in~n|), 447#(or (<= |cmemrchr_#in~n| 0) (<= 4294967296 |cmemrchr_#in~n|))] [2018-02-04 14:59:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:59:52,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:59:52,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:59:52,471 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-02-04 14:59:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:52,500 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-04 14:59:52,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:59:52,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 14:59:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:52,501 INFO L225 Difference]: With dead ends: 59 [2018-02-04 14:59:52,501 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 14:59:52,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:59:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 14:59:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-02-04 14:59:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 14:59:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-04 14:59:52,505 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-02-04 14:59:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:52,506 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-04 14:59:52,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:59:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-04 14:59:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:59:52,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:52,507 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:52,507 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1993075989, now seen corresponding path program 1 times [2018-02-04 14:59:52,508 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:52,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:52,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 14:59:52,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,671 INFO L182 omatonBuilderFactory]: Interpolants [560#(and (<= (+ cmemrchr_~cp~0.offset 1) (select |#length| cmemrchr_~cp~0.base)) (or (<= |cmemrchr_#t~pre0| (* 4294967296 (div |cmemrchr_#t~pre0| 4294967296))) (<= |cmemrchr_#t~pre0| (+ cmemrchr_~cp~0.offset (* 4294967296 (div |cmemrchr_#t~pre0| 4294967296)))))), 561#(and (<= 1 cmemrchr_~cp~0.offset) (<= (+ cmemrchr_~cp~0.offset 1) (select |#length| cmemrchr_~cp~0.base))), 562#(and (<= (+ |cmemrchr_#t~pre1.offset| 2) (select |#length| |cmemrchr_#t~pre1.base|)) (<= 0 |cmemrchr_#t~pre1.offset|)), 551#true, 552#false, 553#(= 0 |main_#t~malloc6.offset|), 554#(= 0 main_~nondetArea~0.offset), 555#(= 0 |cmemrchr_#in~s.offset|), 556#(= cmemrchr_~s.offset 0), 557#(or (and (<= cmemrchr_~n (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)))) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n)) (<= (+ cmemrchr_~cp~0.offset 1) 0)), 558#(or (<= (+ |cmemrchr_#t~pre1.offset| 2) 0) (and (<= cmemrchr_~n (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1)) (<= cmemrchr_~cp~0.offset |cmemrchr_#t~pre1.offset|) (= |cmemrchr_#t~pre1.base| cmemrchr_~cp~0.base) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n))), 559#(and (<= cmemrchr_~n (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1)) (<= (+ cmemrchr_~cp~0.offset 1) (select |#length| cmemrchr_~cp~0.base)) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n))] [2018-02-04 14:59:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:59:52,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:59:52,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:59:52,671 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 12 states. [2018-02-04 14:59:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:52,863 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-02-04 14:59:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 14:59:52,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-02-04 14:59:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:52,864 INFO L225 Difference]: With dead ends: 52 [2018-02-04 14:59:52,864 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 14:59:52,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:59:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 14:59:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-02-04 14:59:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 14:59:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-02-04 14:59:52,869 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-02-04 14:59:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:52,869 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-02-04 14:59:52,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:59:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-02-04 14:59:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:59:52,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:52,870 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:52,870 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:52,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1538347164, now seen corresponding path program 1 times [2018-02-04 14:59:52,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:52,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:52,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:59:52,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,905 INFO L182 omatonBuilderFactory]: Interpolants [680#true, 681#false, 682#(= |#valid| |old(#valid)|), 683#(= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|)] [2018-02-04 14:59:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:52,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:59:52,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:59:52,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:59:52,906 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-02-04 14:59:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:52,940 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-02-04 14:59:52,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:59:52,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 14:59:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:52,941 INFO L225 Difference]: With dead ends: 46 [2018-02-04 14:59:52,941 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 14:59:52,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:59:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 14:59:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 14:59:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 14:59:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 14:59:52,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-02-04 14:59:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:52,944 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 14:59:52,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:59:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 14:59:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:59:52,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:52,945 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:52,945 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1560958191, now seen corresponding path program 2 times [2018-02-04 14:59:52,946 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:52,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:53,212 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 14:59:53,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:53,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 14:59:53,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:53,213 INFO L182 omatonBuilderFactory]: Interpolants [768#(and (<= (+ |cmemrchr_#t~pre1.offset| (* 4294967296 (div (+ (- cmemrchr_~cp~0.offset) (+ cmemrchr_~n 4294967294)) 4294967296)) 1) cmemrchr_~n) (<= (+ cmemrchr_~cp~0.offset 2) (select |#length| cmemrchr_~cp~0.base))), 769#(and (<= (+ (* 4294967296 (div (+ (- cmemrchr_~cp~0.offset) (+ cmemrchr_~n 4294967294)) 4294967296)) 1) cmemrchr_~n) (<= (+ cmemrchr_~cp~0.offset 2) (select |#length| cmemrchr_~cp~0.base))), 770#(and (<= (+ cmemrchr_~cp~0.offset 2) (select |#length| cmemrchr_~cp~0.base)) (or (<= |cmemrchr_#t~pre0| (* 4294967296 (div |cmemrchr_#t~pre0| 4294967296))) (<= |cmemrchr_#t~pre0| (+ cmemrchr_~cp~0.offset (* 4294967296 (div |cmemrchr_#t~pre0| 4294967296)))))), 771#(and (<= 1 cmemrchr_~cp~0.offset) (<= (+ cmemrchr_~cp~0.offset 2) (select |#length| cmemrchr_~cp~0.base))), 772#(and (<= (+ |cmemrchr_#t~pre1.offset| 3) (select |#length| |cmemrchr_#t~pre1.base|)) (<= 0 |cmemrchr_#t~pre1.offset|)), 758#true, 759#false, 760#(and (= 0 |main_#t~malloc6.offset|) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 761#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 762#(= 0 |cmemrchr_#in~s.offset|), 763#(= cmemrchr_~s.offset 0), 764#(or (<= (+ cmemrchr_~cp~0.offset 1) 0) (and (<= (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296))) cmemrchr_~n) (<= cmemrchr_~n (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)))))), 765#(or (and (<= cmemrchr_~n (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1)) (<= cmemrchr_~cp~0.offset |cmemrchr_#t~pre1.offset|) (<= (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1) cmemrchr_~n) (= |cmemrchr_#t~pre1.base| cmemrchr_~cp~0.base)) (<= (+ |cmemrchr_#t~pre1.offset| 2) 0)), 766#(and (<= cmemrchr_~n (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1)) (<= (+ cmemrchr_~cp~0.offset 1) (select |#length| cmemrchr_~cp~0.base)) (<= (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1) cmemrchr_~n)), 767#(and (<= (+ cmemrchr_~cp~0.offset 1) (select |#length| cmemrchr_~cp~0.base)) (<= (+ cmemrchr_~cp~0.offset (* 4294967296 (div (+ (- cmemrchr_~cp~0.offset) (+ cmemrchr_~n 4294967295)) 4294967296))) cmemrchr_~n))] [2018-02-04 14:59:53,213 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 14:59:53,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 14:59:53,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 14:59:53,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:59:53,214 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 15 states. [2018-02-04 14:59:57,548 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 42 DAG size of output 29 [2018-02-04 15:00:03,972 WARN L146 SmtUtils]: Spent 4388ms on a formula simplification. DAG size of input: 44 DAG size of output 34 [2018-02-04 15:00:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:00:03,991 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-04 15:00:03,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 15:00:03,991 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-04 15:00:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:00:03,992 INFO L225 Difference]: With dead ends: 26 [2018-02-04 15:00:03,992 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 15:00:03,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2018-02-04 15:00:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 15:00:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 15:00:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 15:00:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 15:00:03,993 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-02-04 15:00:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:00:03,993 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 15:00:03,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 15:00:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 15:00:03,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 15:00:03,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:00:03 BoogieIcfgContainer [2018-02-04 15:00:03,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:00:03,997 INFO L168 Benchmark]: Toolchain (without parser) took 13714.56 ms. Allocated memory was 401.6 MB in the beginning and 673.2 MB in the end (delta: 271.6 MB). Free memory was 359.6 MB in the beginning and 561.6 MB in the end (delta: -202.0 MB). Peak memory consumption was 69.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:00:03,998 INFO L168 Benchmark]: CDTParser took 1.16 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:00:03,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.64 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 349.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:00:03,998 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 ms. Allocated memory is still 401.6 MB. Free memory was 349.0 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:00:03,998 INFO L168 Benchmark]: RCFGBuilder took 164.93 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 330.5 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-04 15:00:03,998 INFO L168 Benchmark]: TraceAbstraction took 13369.61 ms. Allocated memory was 401.6 MB in the beginning and 673.2 MB in the end (delta: 271.6 MB). Free memory was 330.5 MB in the beginning and 561.6 MB in the end (delta: -231.1 MB). Peak memory consumption was 40.5 MB. Max. memory is 5.3 GB. [2018-02-04 15:00:03,999 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.64 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 349.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.50 ms. Allocated memory is still 401.6 MB. Free memory was 349.0 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 164.93 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 330.5 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13369.61 ms. Allocated memory was 401.6 MB in the beginning and 673.2 MB in the end (delta: 271.6 MB). Free memory was 330.5 MB in the beginning and 561.6 MB in the end (delta: -231.1 MB). Peak memory consumption was 40.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: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 3 error locations. SAFE Result, 13.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 182 SDtfs, 235 SDslu, 865 SDs, 0 SdLazy, 651 SolverSat, 69 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2/13 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, 8 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 19235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/13 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_cmemrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-00-04-005.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-00-04-005.csv Received shutdown request...