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_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:03:26,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:03:26,502 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:03:26,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:03:26,511 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:03:26,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:03:26,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:03:26,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:03:26,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:03:26,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:03:26,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:03:26,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:03:26,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:03:26,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:03:26,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:03:26,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:03:26,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:03:26,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:03:26,524 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:03:26,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:03:26,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:03:26,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:03:26,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:03:26,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:03:26,528 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:03:26,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:03:26,529 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:03:26,530 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:03:26,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:03:26,530 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:03:26,531 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:03:26,531 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:03:26,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:03:26,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:03:26,542 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:03:26,542 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:03:26,542 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:03:26,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:03:26,543 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:03:26,543 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:03:26,543 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:03:26,543 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:03:26,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:03:26,543 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:03:26,544 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:03:26,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:03:26,544 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:03:26,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:03:26,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:03:26,545 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:03:26,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:03:26,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:03:26,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:03:26,545 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:03:26,545 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:03:26,545 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:03:26,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:03:26,587 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:03:26,591 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:03:26,593 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:03:26,593 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:03:26,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:03:26,738 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:03:26,739 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:03:26,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:03:26,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:03:26,746 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:03:26,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:03:26" (1/1) ... [2018-02-04 12:03:26,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559dcc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26, skipping insertion in model container [2018-02-04 12:03:26,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:03:26" (1/1) ... [2018-02-04 12:03:26,764 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:03:26,792 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:03:26,875 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:03:26,885 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:03:26,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26 WrapperNode [2018-02-04 12:03:26,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:03:26,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:03:26,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:03:26,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:03:26,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26" (1/1) ... [2018-02-04 12:03:26,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26" (1/1) ... [2018-02-04 12:03:26,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26" (1/1) ... [2018-02-04 12:03:26,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26" (1/1) ... [2018-02-04 12:03:26,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26" (1/1) ... [2018-02-04 12:03:26,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26" (1/1) ... [2018-02-04 12:03:26,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26" (1/1) ... [2018-02-04 12:03:26,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:03:26,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:03:26,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:03:26,915 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:03:26,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26" (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 12:03:26,954 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:03:26,954 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:03:26,954 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 12:03:26,954 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:03:26,954 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:03:26,954 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:03:26,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:03:26,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:03:26,955 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:03:26,955 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:03:26,955 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 12:03:26,955 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:03:26,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:03:26,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:03:27,053 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:03:27,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:03:27 BoogieIcfgContainer [2018-02-04 12:03:27,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:03:27,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:03:27,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:03:27,056 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:03:27,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:03:26" (1/3) ... [2018-02-04 12:03:27,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5bb669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:03:27, skipping insertion in model container [2018-02-04 12:03:27,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:26" (2/3) ... [2018-02-04 12:03:27,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5bb669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:03:27, skipping insertion in model container [2018-02-04 12:03:27,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:03:27" (3/3) ... [2018-02-04 12:03:27,058 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:03:27,063 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:03:27,066 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 12:03:27,092 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:03:27,092 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:03:27,092 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:03:27,092 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:03:27,092 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:03:27,093 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:03:27,093 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:03:27,093 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:03:27,093 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:03:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-04 12:03:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 12:03:27,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:27,115 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:27,115 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:03:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-02-04 12:03:27,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:27,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:27,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,166 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:27,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:27,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:27,266 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 12:03:27,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:27,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:27,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:03:27,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:03:27,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:03:27,285 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-02-04 12:03:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:27,364 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-04 12:03:27,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:03:27,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 12:03:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:27,407 INFO L225 Difference]: With dead ends: 29 [2018-02-04 12:03:27,407 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 12:03:27,408 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 12:03:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 12:03:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 12:03:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 12:03:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 12:03:27,427 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-04 12:03:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:27,427 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 12:03:27,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:03:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 12:03:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 12:03:27,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:27,428 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:27,428 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:03:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-02-04 12:03:27,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:27,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:27,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,429 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:27,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:27,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:27,500 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 12:03:27,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:27,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:03:27,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:27,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:27,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:27,502 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-04 12:03:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:27,532 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-04 12:03:27,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:03:27,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 12:03:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:27,533 INFO L225 Difference]: With dead ends: 25 [2018-02-04 12:03:27,533 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 12:03:27,534 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 12:03:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 12:03:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 12:03:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 12:03:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 12:03:27,537 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-02-04 12:03:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:27,537 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 12:03:27,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 12:03:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:03:27,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:27,538 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:27,538 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:03:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-02-04 12:03:27,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:27,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:27,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,539 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:27,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:27,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:27,589 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 12:03:27,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:27,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:03:27,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:27,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:27,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:27,589 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-02-04 12:03:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:27,639 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-02-04 12:03:27,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:03:27,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:03:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:27,640 INFO L225 Difference]: With dead ends: 24 [2018-02-04 12:03:27,640 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 12:03:27,640 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 12:03:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 12:03:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 12:03:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 12:03:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-04 12:03:27,642 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-02-04 12:03:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:27,643 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-04 12:03:27,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-04 12:03:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:03:27,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:27,644 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:27,644 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:03:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-02-04 12:03:27,644 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:27,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:27,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:27,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:27,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:27,739 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 12:03:27,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:27,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:03:27,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:03:27,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:03:27,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:03:27,740 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-02-04 12:03:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:27,810 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-02-04 12:03:27,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:03:27,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-04 12:03:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:27,812 INFO L225 Difference]: With dead ends: 30 [2018-02-04 12:03:27,812 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 12:03:27,813 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 12:03:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 12:03:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-02-04 12:03:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 12:03:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 12:03:27,816 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-02-04 12:03:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:27,816 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 12:03:27,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:03:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 12:03:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:03:27,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:27,817 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:27,817 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:03:27,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-02-04 12:03:27,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:27,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:27,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,819 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:27,819 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:27,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:27,908 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 12:03:27,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:27,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:03:27,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:03:27,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:03:27,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:03:27,909 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-02-04 12:03:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:28,032 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-04 12:03:28,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:03:28,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 12:03:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:28,033 INFO L225 Difference]: With dead ends: 42 [2018-02-04 12:03:28,033 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 12:03:28,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:03:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 12:03:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-04 12:03:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 12:03:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-02-04 12:03:28,037 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-02-04 12:03:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:28,037 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-02-04 12:03:28,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:03:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-02-04 12:03:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:03:28,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:28,038 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:28,038 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:03:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-02-04 12:03:28,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:28,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:28,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:28,039 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:28,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:28,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:28,174 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 12:03:28,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:28,174 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:03:28,179 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:28,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:28,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:03:28,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:03:28,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:28,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:28,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:03:28,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:03:28,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-04 12:03:28,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:03:28,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:28,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:28,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:28,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-04 12:03:28,408 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 12:03:28,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:28,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-02-04 12:03:28,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 12:03:28,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 12:03:28,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:03:28,433 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2018-02-04 12:03:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:28,756 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-02-04 12:03:28,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:03:28,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-02-04 12:03:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:28,757 INFO L225 Difference]: With dead ends: 47 [2018-02-04 12:03:28,757 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 12:03:28,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:03:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 12:03:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-02-04 12:03:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 12:03:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-02-04 12:03:28,761 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-02-04 12:03:28,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:28,761 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-02-04 12:03:28,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 12:03:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-02-04 12:03:28,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:03:28,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:28,762 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:28,762 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:03:28,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-02-04 12:03:28,762 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:28,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:28,763 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:28,763 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:28,763 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:28,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:28,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:28,920 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:03:28,925 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:03:28,936 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:03:28,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:03:28,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:28,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:03:28,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:28,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:28,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:03:28,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:03:28,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:03:28,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:28,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:28,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:28,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 12:03:29,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 12:03:29,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:03:29,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:29,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:29,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:29,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-02-04 12:03:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:29,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:29,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-02-04 12:03:29,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:03:29,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:03:29,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:03:29,120 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 17 states. [2018-02-04 12:03:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:29,529 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-02-04 12:03:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:03:29,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-02-04 12:03:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:29,531 INFO L225 Difference]: With dead ends: 46 [2018-02-04 12:03:29,531 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 12:03:29,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:03:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 12:03:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-02-04 12:03:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 12:03:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-02-04 12:03:29,536 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 20 [2018-02-04 12:03:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:29,536 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-02-04 12:03:29,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:03:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-02-04 12:03:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:03:29,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:29,537 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:29,537 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:03:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-02-04 12:03:29,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:29,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:29,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:29,538 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:03:29,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:29,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:29,588 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 12:03:29,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:29,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:29,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:03:29,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:03:29,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:03:29,590 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-02-04 12:03:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:29,628 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-02-04 12:03:29,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:03:29,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 12:03:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:29,629 INFO L225 Difference]: With dead ends: 33 [2018-02-04 12:03:29,629 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:03:29,629 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 12:03:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:03:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:03:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:03:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:03:29,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-02-04 12:03:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:29,630 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:03:29,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:03:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:03:29,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:03:29,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:03:29 BoogieIcfgContainer [2018-02-04 12:03:29,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:03:29,636 INFO L168 Benchmark]: Toolchain (without parser) took 2897.85 ms. Allocated memory was 402.1 MB in the beginning and 652.2 MB in the end (delta: 250.1 MB). Free memory was 360.3 MB in the beginning and 581.0 MB in the end (delta: -220.7 MB). Peak memory consumption was 29.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:29,637 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:03:29,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.13 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 349.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:29,638 INFO L168 Benchmark]: Boogie Preprocessor took 24.59 ms. Allocated memory is still 402.1 MB. Free memory was 349.8 MB in the beginning and 347.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:29,638 INFO L168 Benchmark]: RCFGBuilder took 138.62 ms. Allocated memory is still 402.1 MB. Free memory was 347.1 MB in the beginning and 332.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:29,638 INFO L168 Benchmark]: TraceAbstraction took 2581.43 ms. Allocated memory was 402.1 MB in the beginning and 652.2 MB in the end (delta: 250.1 MB). Free memory was 332.8 MB in the beginning and 581.0 MB in the end (delta: -248.2 MB). Peak memory consumption was 1.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:29,640 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 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.13 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 349.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.59 ms. Allocated memory is still 402.1 MB. Free memory was 349.8 MB in the beginning and 347.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 138.62 ms. Allocated memory is still 402.1 MB. Free memory was 347.1 MB in the beginning and 332.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2581.43 ms. Allocated memory was 402.1 MB in the beginning and 652.2 MB in the end (delta: 250.1 MB). Free memory was 332.8 MB in the beginning and 581.0 MB in the end (delta: -248.2 MB). Peak memory consumption was 1.9 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: 547]: 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 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 2.5s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 234 SDslu, 549 SDs, 0 SdLazy, 546 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 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, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 151 ConstructedInterpolants, 10 QuantifiedInterpolants, 17814 SizeOfPredicates, 14 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 4/20 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/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-03-29-646.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-03-29-646.csv Received shutdown request...