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/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:07:24,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:07:24,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:07:24,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:07:24,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:07:24,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:07:24,322 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:07:24,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:07:24,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:07:24,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:07:24,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:07:24,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:07:24,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:07:24,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:07:24,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:07:24,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:07:24,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:07:24,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:07:24,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:07:24,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:07:24,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:07:24,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:07:24,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:07:24,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:07:24,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:07:24,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:07:24,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:07:24,341 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:07:24,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:07:24,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:07:24,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:07:24,342 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 15:07:24,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:07:24,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:07:24,354 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:07:24,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:07:24,354 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:07:24,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:07:24,355 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:07:24,355 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:07:24,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:07:24,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:07:24,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:07:24,355 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:07:24,355 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:07:24,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:07:24,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:07:24,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:07:24,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:07:24,356 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:07:24,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:07:24,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:07:24,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:07:24,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:07:24,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:07:24,393 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:07:24,397 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:07:24,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:07:24,398 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:07:24,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:07:24,530 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:07:24,531 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:07:24,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:07:24,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:07:24,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:07:24,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:24" (1/1) ... [2018-02-04 15:07:24,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2a890b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24, skipping insertion in model container [2018-02-04 15:07:24,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:24" (1/1) ... [2018-02-04 15:07:24,559 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:07:24,591 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:07:24,672 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:07:24,682 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:07:24,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24 WrapperNode [2018-02-04 15:07:24,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:07:24,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:07:24,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:07:24,688 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:07:24,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24" (1/1) ... [2018-02-04 15:07:24,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24" (1/1) ... [2018-02-04 15:07:24,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24" (1/1) ... [2018-02-04 15:07:24,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24" (1/1) ... [2018-02-04 15:07:24,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24" (1/1) ... [2018-02-04 15:07:24,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24" (1/1) ... [2018-02-04 15:07:24,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24" (1/1) ... [2018-02-04 15:07:24,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:07:24,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:07:24,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:07:24,714 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:07:24,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24" (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 15:07:24,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:07:24,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:07:24,751 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-02-04 15:07:24,751 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:07:24,751 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:07:24,751 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:07:24,751 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:07:24,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:07:24,752 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:07:24,752 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:07:24,752 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-02-04 15:07:24,752 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:07:24,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:07:24,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:07:24,865 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:07:24,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:24 BoogieIcfgContainer [2018-02-04 15:07:24,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:07:24,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:07:24,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:07:24,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:07:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:07:24" (1/3) ... [2018-02-04 15:07:24,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18305ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:24, skipping insertion in model container [2018-02-04 15:07:24,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:24" (2/3) ... [2018-02-04 15:07:24,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18305ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:24, skipping insertion in model container [2018-02-04 15:07:24,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:24" (3/3) ... [2018-02-04 15:07:24,871 INFO L107 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:07:24,876 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:07:24,880 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 15:07:24,909 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:07:24,909 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:07:24,909 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:07:24,909 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:07:24,909 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:07:24,909 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:07:24,909 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:07:24,909 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:07:24,910 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:07:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-04 15:07:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 15:07:24,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:24,926 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:24,926 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:07:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390414, now seen corresponding path program 1 times [2018-02-04 15:07:24,964 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:24,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:25,049 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 15:07:25,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:25,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:07:25,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:25,052 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 15:07:25,052 INFO L182 omatonBuilderFactory]: Interpolants [43#true, 44#false, 45#(= 1 (select |#valid| |main_#t~malloc6.base|)), 46#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 15:07:25,052 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 15:07:25,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:07:25,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:07:25,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:07:25,063 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-04 15:07:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:25,162 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 15:07:25,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:07:25,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 15:07:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:25,169 INFO L225 Difference]: With dead ends: 39 [2018-02-04 15:07:25,169 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 15:07:25,171 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 15:07:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 15:07:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 15:07:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 15:07:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 15:07:25,258 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-02-04 15:07:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:25,259 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 15:07:25,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:07:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 15:07:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 15:07:25,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:25,259 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:25,259 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:07:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390413, now seen corresponding path program 1 times [2018-02-04 15:07:25,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:25,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:25,372 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 15:07:25,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:25,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:07:25,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:25,373 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 15:07:25,373 INFO L182 omatonBuilderFactory]: Interpolants [128#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 124#true, 125#false, 126#(<= 1 main_~length1~0), 127#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0))] [2018-02-04 15:07:25,373 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 15:07:25,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:07:25,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:07:25,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:07:25,375 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 15:07:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:25,415 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 15:07:25,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:07:25,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 15:07:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:25,416 INFO L225 Difference]: With dead ends: 35 [2018-02-04 15:07:25,416 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 15:07:25,416 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 15:07:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 15:07:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 15:07:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 15:07:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 15:07:25,419 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 10 [2018-02-04 15:07:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:25,419 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 15:07:25,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:07:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 15:07:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:07:25,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:25,420 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:25,420 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:07:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash -104566583, now seen corresponding path program 1 times [2018-02-04 15:07:25,421 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:25,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:25,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 15:07:25,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:25,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:07:25,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:25,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 15:07:25,472 INFO L182 omatonBuilderFactory]: Interpolants [201#true, 202#false, 203#(= 1 (select |#valid| main_~nondetString1~0.base)), 204#(= 1 (select |#valid| |cstrreplace_#in~s.base|)), 205#(= 1 (select |#valid| cstrreplace_~p~0.base))] [2018-02-04 15:07:25,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 15:07:25,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:07:25,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:07:25,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:07:25,473 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-04 15:07:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:25,516 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 15:07:25,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:07:25,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 15:07:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:25,517 INFO L225 Difference]: With dead ends: 32 [2018-02-04 15:07:25,517 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 15:07:25,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:07:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 15:07:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 15:07:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 15:07:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-04 15:07:25,521 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-02-04 15:07:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:25,521 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-04 15:07:25,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:07:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-04 15:07:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:07:25,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:25,522 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:25,522 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:07:25,523 INFO L82 PathProgramCache]: Analyzing trace with hash -104566582, now seen corresponding path program 1 times [2018-02-04 15:07:25,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:25,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:25,630 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 15:07:25,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:25,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:07:25,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:25,631 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 15:07:25,631 INFO L182 omatonBuilderFactory]: Interpolants [272#true, 273#false, 274#(<= 1 main_~length1~0), 275#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0)), 276#(and (= 0 main_~nondetString1~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0)), 277#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base))), 278#(and (= 0 |cstrreplace_#in~s.offset|) (<= 1 (select |#length| |cstrreplace_#in~s.base|))), 279#(and (<= 1 (select |#length| cstrreplace_~p~0.base)) (= cstrreplace_~p~0.offset 0))] [2018-02-04 15:07:25,631 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 15:07:25,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:07:25,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:07:25,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:07:25,631 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-02-04 15:07:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:25,706 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-04 15:07:25,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:07:25,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 15:07:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:25,709 INFO L225 Difference]: With dead ends: 43 [2018-02-04 15:07:25,709 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 15:07:25,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:07:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 15:07:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-04 15:07:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 15:07:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-02-04 15:07:25,714 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-02-04 15:07:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:25,714 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-02-04 15:07:25,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:07:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-02-04 15:07:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 15:07:25,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:25,715 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] [2018-02-04 15:07:25,715 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:07:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1089103921, now seen corresponding path program 1 times [2018-02-04 15:07:25,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:25,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:25,851 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 15:07:25,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:25,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 15:07:25,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:25,852 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 15:07:25,852 INFO L182 omatonBuilderFactory]: Interpolants [368#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1)), 369#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 370#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 371#(= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) |cstrreplace_#in~s.offset|)), 372#(= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)), 373#(and (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)) (= |cstrreplace_#t~mem0| (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset))), 365#true, 366#false, 367#(and (<= 1 main_~length1~0) (<= main_~length1~0 1))] [2018-02-04 15:07:25,852 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 15:07:25,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:07:25,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:07:25,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:07:25,853 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-02-04 15:07:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:25,951 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 15:07:25,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:07:25,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 15:07:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:25,952 INFO L225 Difference]: With dead ends: 55 [2018-02-04 15:07:25,952 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 15:07:25,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:07:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 15:07:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-02-04 15:07:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 15:07:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 15:07:25,957 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2018-02-04 15:07:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:25,957 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 15:07:25,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:07:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 15:07:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 15:07:25,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:25,958 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] [2018-02-04 15:07:25,958 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:07:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1925999697, now seen corresponding path program 1 times [2018-02-04 15:07:25,959 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:25,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:26,155 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 15:07:26,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:26,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:07:26,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:26,156 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 15:07:26,157 INFO L182 omatonBuilderFactory]: Interpolants [496#(and (= cstrreplace_~p~0.offset 0) (or (<= 2 (select |#length| cstrreplace_~p~0.base)) (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)))), 497#(and (or (<= 2 (select |#length| cstrreplace_~p~0.base)) (and (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)) (= |cstrreplace_#t~mem0| (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)))) (= cstrreplace_~p~0.offset 0)), 498#(and (<= 2 (select |#length| cstrreplace_~p~0.base)) (= cstrreplace_~p~0.offset 0)), 499#(and (<= 1 cstrreplace_~p~0.offset) (<= (+ cstrreplace_~p~0.offset 1) (select |#length| cstrreplace_~p~0.base))), 489#true, 490#false, 491#(<= 1 main_~length1~0), 492#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0)), 493#(and (or (= (+ main_~nondetString1~0.offset main_~length1~0) 1) (and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0))) (= main_~nondetString1~0.offset 0)), 494#(and (or (<= 2 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset))) (= main_~nondetString1~0.offset 0)), 495#(and (or (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) |cstrreplace_#in~s.offset|)) (<= 2 (select |#length| |cstrreplace_#in~s.base|))) (= 0 |cstrreplace_#in~s.offset|))] [2018-02-04 15:07:26,157 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 15:07:26,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:07:26,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:07:26,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:07:26,158 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 11 states. [2018-02-04 15:07:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:26,436 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-04 15:07:26,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:07:26,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-02-04 15:07:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:26,438 INFO L225 Difference]: With dead ends: 84 [2018-02-04 15:07:26,438 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 15:07:26,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:07:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 15:07:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-02-04 15:07:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 15:07:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-04 15:07:26,443 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 21 [2018-02-04 15:07:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:26,444 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-04 15:07:26,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:07:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-04 15:07:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 15:07:26,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:26,445 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:26,445 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:07:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash 292485851, now seen corresponding path program 1 times [2018-02-04 15:07:26,446 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:26,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:26,494 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 15:07:26,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:26,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:07:26,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:26,495 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 15:07:26,495 INFO L182 omatonBuilderFactory]: Interpolants [656#true, 657#false, 658#(= |#valid| |old(#valid)|), 659#(= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|)] [2018-02-04 15:07:26,495 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 15:07:26,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:07:26,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:07:26,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:07:26,496 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 4 states. [2018-02-04 15:07:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:26,534 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-02-04 15:07:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:07:26,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 15:07:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:26,535 INFO L225 Difference]: With dead ends: 57 [2018-02-04 15:07:26,535 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 15:07:26,535 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 15:07:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 15:07:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 15:07:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 15:07:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 15:07:26,538 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2018-02-04 15:07:26,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:26,538 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 15:07:26,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:07:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 15:07:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:07:26,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:26,539 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:26,539 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:07:26,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1201761770, now seen corresponding path program 2 times [2018-02-04 15:07:26,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:26,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:26,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:26,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:07:26,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:26,762 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 15:07:26,762 INFO L182 omatonBuilderFactory]: Interpolants [757#true, 758#false, 759#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|))), 760#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 761#(and (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= main_~nondetString1~0.offset 0)), 762#(and (= 0 |cstrreplace_#in~s.offset|) (or (<= 3 (select |#length| |cstrreplace_#in~s.base|)) (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) 1)) (<= (select |#length| |cstrreplace_#in~s.base|) 1))), 763#(and (= cstrreplace_~p~0.offset 0) (or (<= 3 (select |#length| cstrreplace_~p~0.base)) (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) 1)) (<= (select |#length| cstrreplace_~p~0.base) 1))), 764#(or (and (<= 1 cstrreplace_~p~0.offset) (or (<= (select |#length| cstrreplace_~p~0.base) cstrreplace_~p~0.offset) (<= (+ cstrreplace_~p~0.offset 2) (select |#length| cstrreplace_~p~0.base)))) (and (= 1 cstrreplace_~p~0.offset) (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)))), 765#(or (and (= 1 cstrreplace_~p~0.offset) (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)) (= |cstrreplace_#t~mem0| (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset))) (and (<= (+ cstrreplace_~p~0.offset 2) (select |#length| cstrreplace_~p~0.base)) (<= 1 cstrreplace_~p~0.offset))), 766#(and (<= (+ cstrreplace_~p~0.offset 2) (select |#length| cstrreplace_~p~0.base)) (<= 1 cstrreplace_~p~0.offset)), 767#(and (<= (+ cstrreplace_~p~0.offset 1) (select |#length| cstrreplace_~p~0.base)) (<= 2 cstrreplace_~p~0.offset))] [2018-02-04 15:07:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:26,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:07:26,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:07:26,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:07:26,763 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2018-02-04 15:07:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:26,921 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-02-04 15:07:26,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:07:26,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 15:07:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:26,922 INFO L225 Difference]: With dead ends: 58 [2018-02-04 15:07:26,922 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 15:07:26,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:07:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 15:07:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-02-04 15:07:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 15:07:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-04 15:07:26,925 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 27 [2018-02-04 15:07:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:26,925 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-04 15:07:26,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:07:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-04 15:07:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 15:07:26,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:26,926 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:26,926 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:07:26,926 INFO L82 PathProgramCache]: Analyzing trace with hash 70029339, now seen corresponding path program 3 times [2018-02-04 15:07:26,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:26,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 15:07:27,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:27,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:07:27,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:27,048 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 15:07:27,048 INFO L182 omatonBuilderFactory]: Interpolants [896#(and (<= 1 cstrreplace_~p~0.offset) (<= (+ cstrreplace_~p~0.offset 1) (select |#length| cstrreplace_~p~0.base))), 886#true, 887#false, 888#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|))), 889#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 890#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 891#(= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) (+ (select |#length| |cstrreplace_#in~s.base|) (- 1)))), 892#(= 0 (select (select |#memory_int| cstrreplace_~p~0.base) (+ (select |#length| cstrreplace_~p~0.base) (- 1)))), 893#(or (<= (select |#length| cstrreplace_~p~0.base) cstrreplace_~p~0.offset) (<= (+ cstrreplace_~p~0.offset 2) (select |#length| cstrreplace_~p~0.base)) (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset))), 894#(or (and (<= (+ cstrreplace_~p~0.offset 2) (select |#length| cstrreplace_~p~0.base)) (<= 0 cstrreplace_~p~0.offset)) (and (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)) (= |cstrreplace_#t~mem0| (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)))), 895#(and (<= (+ cstrreplace_~p~0.offset 2) (select |#length| cstrreplace_~p~0.base)) (<= 0 cstrreplace_~p~0.offset))] [2018-02-04 15:07:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 15:07:27,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:07:27,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:07:27,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:07:27,050 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 11 states. [2018-02-04 15:07:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:27,237 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-04 15:07:27,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:07:27,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-04 15:07:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:27,240 INFO L225 Difference]: With dead ends: 43 [2018-02-04 15:07:27,240 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 15:07:27,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:07:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 15:07:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 15:07:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 15:07:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 15:07:27,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-02-04 15:07:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:27,241 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 15:07:27,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:07:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 15:07:27,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 15:07:27,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:07:27 BoogieIcfgContainer [2018-02-04 15:07:27,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:07:27,248 INFO L168 Benchmark]: Toolchain (without parser) took 2717.40 ms. Allocated memory was 399.0 MB in the beginning and 633.3 MB in the end (delta: 234.4 MB). Free memory was 355.5 MB in the beginning and 403.8 MB in the end (delta: -48.3 MB). Peak memory consumption was 186.1 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:27,251 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 399.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:07:27,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.99 ms. Allocated memory is still 399.0 MB. Free memory was 355.5 MB in the beginning and 344.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:27,252 INFO L168 Benchmark]: Boogie Preprocessor took 26.58 ms. Allocated memory is still 399.0 MB. Free memory was 344.9 MB in the beginning and 342.2 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:07:27,252 INFO L168 Benchmark]: RCFGBuilder took 151.81 ms. Allocated memory is still 399.0 MB. Free memory was 342.2 MB in the beginning and 325.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:27,252 INFO L168 Benchmark]: TraceAbstraction took 2380.57 ms. Allocated memory was 399.0 MB in the beginning and 633.3 MB in the end (delta: 234.4 MB). Free memory was 325.0 MB in the beginning and 403.8 MB in the end (delta: -78.7 MB). Peak memory consumption was 155.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:27,254 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.17 ms. Allocated memory is still 399.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.99 ms. Allocated memory is still 399.0 MB. Free memory was 355.5 MB in the beginning and 344.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.58 ms. Allocated memory is still 399.0 MB. Free memory was 344.9 MB in the beginning and 342.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 151.81 ms. Allocated memory is still 399.0 MB. Free memory was 342.2 MB in the beginning and 325.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2380.57 ms. Allocated memory was 399.0 MB in the beginning and 633.3 MB in the end (delta: 234.4 MB). Free memory was 325.0 MB in the beginning and 403.8 MB in the end (delta: -78.7 MB). Peak memory consumption was 155.6 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: 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: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. SAFE Result, 2.3s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 236 SDtfs, 318 SDslu, 663 SDs, 0 SdLazy, 570 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 8/38 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 30114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 8/38 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/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-07-27-264.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-07-27-264.csv Received shutdown request...