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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:46:51,252 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:46:51,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:46:51,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:46:51,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:46:51,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:46:51,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:46:51,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:46:51,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:46:51,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:46:51,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:46:51,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:46:51,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:46:51,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:46:51,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:46:51,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:46:51,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:46:51,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:46:51,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:46:51,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:46:51,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:46:51,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:46:51,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:46:51,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:46:51,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:46:51,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:46:51,295 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:46:51,295 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:46:51,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:46:51,296 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:46:51,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:46:51,297 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:46:51,305 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:46:51,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:46:51,306 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:46:51,306 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:46:51,306 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:46:51,306 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:46:51,306 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:46:51,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:46:51,307 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:46:51,307 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:46:51,307 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:46:51,307 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:46:51,307 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:46:51,307 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:46:51,308 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:46:51,308 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:46:51,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:46:51,308 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:46:51,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:46:51,308 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:46:51,308 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:46:51,308 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:46:51,309 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:46:51,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:46:51,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:46:51,309 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:46:51,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:46:51,310 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:46:51,310 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:46:51,310 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:46:51,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:46:51,310 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:46:51,311 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:46:51,311 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:46:51,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:46:51,353 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:46:51,356 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:46:51,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:46:51,357 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:46:51,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:46:51,528 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:46:51,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:46:51,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:46:51,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:46:51,538 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:46:51,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:46:51" (1/1) ... [2018-01-24 12:46:51,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3565d9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51, skipping insertion in model container [2018-01-24 12:46:51,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:46:51" (1/1) ... [2018-01-24 12:46:51,554 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:46:51,592 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:46:51,704 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:46:51,721 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:46:51,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51 WrapperNode [2018-01-24 12:46:51,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:46:51,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:46:51,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:46:51,730 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:46:51,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51" (1/1) ... [2018-01-24 12:46:51,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51" (1/1) ... [2018-01-24 12:46:51,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51" (1/1) ... [2018-01-24 12:46:51,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51" (1/1) ... [2018-01-24 12:46:51,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51" (1/1) ... [2018-01-24 12:46:51,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51" (1/1) ... [2018-01-24 12:46:51,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51" (1/1) ... [2018-01-24 12:46:51,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:46:51,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:46:51,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:46:51,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:46:51,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51" (1/1) ... No working directory specified, using /storage/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-01-24 12:46:51,817 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:46:51,817 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:46:51,817 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-24 12:46:51,817 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:46:51,817 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:46:51,817 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:46:51,817 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:46:51,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:46:51,818 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:46:51,818 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:46:51,818 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-24 12:46:51,818 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:46:51,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:46:51,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:46:51,953 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:46:51,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:46:51 BoogieIcfgContainer [2018-01-24 12:46:51,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:46:51,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:46:51,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:46:51,957 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:46:51,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:46:51" (1/3) ... [2018-01-24 12:46:51,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2565aa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:46:51, skipping insertion in model container [2018-01-24 12:46:51,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:51" (2/3) ... [2018-01-24 12:46:51,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2565aa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:46:51, skipping insertion in model container [2018-01-24 12:46:51,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:46:51" (3/3) ... [2018-01-24 12:46:51,960 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:46:51,967 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:46:51,973 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 12:46:52,010 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:46:52,010 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:46:52,010 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:46:52,011 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:46:52,011 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:46:52,011 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:46:52,011 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:46:52,011 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:46:52,012 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:46:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-24 12:46:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:46:52,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:52,040 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:52,040 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-01-24 12:46:52,047 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:52,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:52,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:52,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:52,086 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:52,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:52,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:52,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:46:52,223 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:52,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:46:52,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:46:52,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:46:52,238 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-01-24 12:46:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:52,391 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-24 12:46:52,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:46:52,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 12:46:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:52,402 INFO L225 Difference]: With dead ends: 41 [2018-01-24 12:46:52,402 INFO L226 Difference]: Without dead ends: 26 [2018-01-24 12:46:52,405 INFO L525 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-01-24 12:46:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-24 12:46:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-24 12:46:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 12:46:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 12:46:52,432 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-01-24 12:46:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:52,432 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 12:46:52,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:46:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 12:46:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:46:52,433 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:52,433 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:52,433 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-01-24 12:46:52,434 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:52,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:52,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:52,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:52,436 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:52,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:52,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:52,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:46:52,565 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:52,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:46:52,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:46:52,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:46:52,568 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-24 12:46:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:52,614 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-01-24 12:46:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:46:52,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 12:46:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:52,615 INFO L225 Difference]: With dead ends: 26 [2018-01-24 12:46:52,615 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 12:46:52,616 INFO L525 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-01-24 12:46:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 12:46:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 12:46:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 12:46:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 12:46:52,622 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-01-24 12:46:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:52,622 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 12:46:52,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:46:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 12:46:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:46:52,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:52,623 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:52,623 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-01-24 12:46:52,624 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:52,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:52,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:52,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:52,625 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:52,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:52,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:52,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:46:52,687 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:52,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:46:52,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:46:52,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:46:52,688 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-01-24 12:46:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:52,745 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-01-24 12:46:52,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:46:52,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:46:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:52,746 INFO L225 Difference]: With dead ends: 25 [2018-01-24 12:46:52,746 INFO L226 Difference]: Without dead ends: 24 [2018-01-24 12:46:52,747 INFO L525 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-01-24 12:46:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-24 12:46:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-24 12:46:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-24 12:46:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-01-24 12:46:52,752 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-01-24 12:46:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:52,752 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-01-24 12:46:52,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:46:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-01-24 12:46:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:46:52,753 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:52,753 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:52,753 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-01-24 12:46:52,754 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:52,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:52,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:52,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:52,755 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:52,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:52,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:52,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:46:52,880 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:52,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:46:52,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:46:52,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:46:52,881 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-01-24 12:46:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:53,013 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-01-24 12:46:53,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:46:53,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-01-24 12:46:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:53,016 INFO L225 Difference]: With dead ends: 31 [2018-01-24 12:46:53,016 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 12:46:53,017 INFO L525 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-01-24 12:46:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 12:46:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-01-24 12:46:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 12:46:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 12:46:53,021 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-01-24 12:46:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:53,021 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 12:46:53,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:46:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 12:46:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:46:53,022 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:53,022 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:53,022 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:53,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-01-24 12:46:53,022 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:53,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:53,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:53,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:53,023 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:53,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:53,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:53,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:46:53,173 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:53,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:46:53,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:46:53,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:46:53,174 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-01-24 12:46:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:53,322 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-24 12:46:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:46:53,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-24 12:46:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:53,324 INFO L225 Difference]: With dead ends: 54 [2018-01-24 12:46:53,324 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 12:46:53,325 INFO L525 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-01-24 12:46:53,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 12:46:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-01-24 12:46:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 12:46:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-01-24 12:46:53,334 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-01-24 12:46:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:53,334 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-01-24 12:46:53,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:46:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-01-24 12:46:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:46:53,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:53,335 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:53,335 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-01-24 12:46:53,336 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:53,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:53,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:53,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:53,337 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:53,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:53,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:53,557 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 12:46:53,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:53,569 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:53,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:53,628 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-01-24 12:46:53,631 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-01-24 12:46:53,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:53,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:53,639 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-01-24 12:46:53,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:46:53,729 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-01-24 12:46:53,737 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-01-24 12:46:53,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:53,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:53,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:53,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 12:46:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:53,907 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:54,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 12 [2018-01-24 12:46:54,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,156 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 13 treesize of output 11 [2018-01-24 12:46:54,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:46:54,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,178 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:46:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:54,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:54,202 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:46:54,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:54,206 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:54,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:54,238 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-01-24 12:46:54,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:46:54,266 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-01-24 12:46:54,267 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-01-24 12:46:54,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:46:54,346 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 19 treesize of output 15 [2018-01-24 12:46:54,353 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 15 treesize of output 16 [2018-01-24 12:46:54,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:54,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:54,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:54,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 12:46:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:54,412 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:54,459 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 13 treesize of output 11 [2018-01-24 12:46:54,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:46:54,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:54,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 12:46:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:54,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:46:54,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 9, 9] total 28 [2018-01-24 12:46:54,524 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:46:54,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:46:54,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:46:54,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-01-24 12:46:54,525 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2018-01-24 12:46:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:54,925 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 12:46:54,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:46:54,925 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-01-24 12:46:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:54,926 INFO L225 Difference]: With dead ends: 48 [2018-01-24 12:46:54,926 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 12:46:54,927 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 12:46:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 12:46:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-01-24 12:46:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 12:46:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-24 12:46:54,933 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-01-24 12:46:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:54,933 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-24 12:46:54,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:46:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-24 12:46:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:46:54,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:54,934 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:54,934 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-01-24 12:46:54,934 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:54,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:54,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:54,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:54,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:54,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:55,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:55,124 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:46:55,129 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:46:55,129 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:46:55,138 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:55,141 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:55,144 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:46:55,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:55,150 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-01-24 12:46:55,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:46:55,189 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-01-24 12:46:55,191 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-01-24 12:46:55,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 12:46:55,301 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-01-24 12:46:55,312 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-01-24 12:46:55,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:55,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:55,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:55,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 12:46:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:55,390 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:55,636 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 39 treesize of output 37 [2018-01-24 12:46:55,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:46:55,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,745 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 41 treesize of output 39 [2018-01-24 12:46:55,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:46:55,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:55,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 12:46:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:55,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:55,921 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:46:55,924 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:46:55,924 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:46:55,934 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:55,943 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:55,954 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:46:55,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:55,964 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-01-24 12:46:55,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:46:55,977 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 15 treesize of output 12 [2018-01-24 12:46:55,978 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 12 treesize of output 11 [2018-01-24 12:46:55,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:55,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 12:46:56,118 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 19 treesize of output 15 [2018-01-24 12:46:56,141 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 15 treesize of output 12 [2018-01-24 12:46:56,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:56,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:56,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:56,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 12:46:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:56,165 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:56,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 13 treesize of output 11 [2018-01-24 12:46:56,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:46:56,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:56,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:56,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:56,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 12:46:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:56,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:46:56,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 10, 10] total 34 [2018-01-24 12:46:56,393 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:46:56,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:46:56,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:46:56,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 12:46:56,394 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 17 states. [2018-01-24 12:46:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:56,902 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 12:46:56,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:46:56,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-01-24 12:46:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:56,904 INFO L225 Difference]: With dead ends: 47 [2018-01-24 12:46:56,904 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 12:46:56,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=252, Invalid=1640, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 12:46:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 12:46:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-01-24 12:46:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 12:46:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-24 12:46:56,913 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 20 [2018-01-24 12:46:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:56,913 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-24 12:46:56,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:46:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-24 12:46:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:46:56,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:56,914 INFO L322 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-01-24 12:46:56,914 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:56,914 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-01-24 12:46:56,914 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:56,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:56,915 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:46:56,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:56,915 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:56,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:56,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:56,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:46:56,961 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:56,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:46:56,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:46:56,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:46:56,961 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-01-24 12:46:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:56,985 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-01-24 12:46:56,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:46:56,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 12:46:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:56,986 INFO L225 Difference]: With dead ends: 34 [2018-01-24 12:46:56,986 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:46:56,986 INFO L525 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-01-24 12:46:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:46:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:46:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:46:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:46:56,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-24 12:46:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:56,987 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:46:56,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:46:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:46:56,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:46:56,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:46:57,629 WARN L146 SmtUtils]: Spent 596ms on a formula simplification. DAG size of input: 55 DAG size of output 1 [2018-01-24 12:46:57,876 WARN L146 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 95 DAG size of output 59 [2018-01-24 12:46:57,907 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:46:57,907 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:46:57,907 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:46:57,907 INFO L404 ceAbstractionStarter]: At program point cstrlenENTRY(lines 540 546) the Hoare annotation is: true [2018-01-24 12:46:57,908 INFO L397 ceAbstractionStarter]: At program point L543'''(lines 543 544) the Hoare annotation is: (let ((.cse1 (< (select |#length| |cstrlen_#in~s.base|) 1)) (.cse2 (not (= (select |#valid| |cstrlen_#in~s.base|) 1))) (.cse3 (not (= 0 |cstrlen_#in~s.offset|))) (.cse4 (not (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_3 Int)) (and (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_3) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_3 |cstrlen_#in~s.offset|) (= (select (select |#memory_int| |cstrlen_#in~s.base|) (+ (select |#length| |cstrlen_#in~s.base|) v_main_~nondetString1~3.offset_BEFORE_CALL_3 (- 1))) 0) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_3 0))))) (.cse0 (= cstrlen_~p~2.offset 0))) (and (or (and (= 0 (select (select |#memory_int| cstrlen_~p~2.base) cstrlen_~p~2.offset)) .cse0) (not (= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) |cstrlen_#in~s.offset|))) .cse1 .cse2 .cse3 .cse4) (or .cse1 .cse2 .cse3 .cse4 (let ((.cse5 (select |#length| cstrlen_~p~2.base)) (.cse6 (= 1 (select |#valid| cstrlen_~p~2.base)))) (or (and (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_3 Int)) (and (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_3) (= 0 (select (select |#memory_int| cstrlen_~p~2.base) (+ (select |#length| cstrlen_~p~2.base) v_main_~nondetString1~3.offset_BEFORE_CALL_3 (- 1)))) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_3 cstrlen_~p~2.offset) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_3 0))) (<= 1 .cse5) .cse6 .cse0) (and (<= (+ cstrlen_~p~2.offset 1) .cse5) (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_3 Int)) (and (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_3) (= 0 (select (select |#memory_int| cstrlen_~p~2.base) (+ (select |#length| cstrlen_~p~2.base) v_main_~nondetString1~3.offset_BEFORE_CALL_3 (- 1)))) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_3 0) (<= (+ v_main_~nondetString1~3.offset_BEFORE_CALL_3 1) cstrlen_~p~2.offset))) .cse6)))))) [2018-01-24 12:46:57,908 INFO L401 ceAbstractionStarter]: For program point cstrlenErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:46:57,908 INFO L401 ceAbstractionStarter]: For program point cstrlenEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-24 12:46:57,908 INFO L401 ceAbstractionStarter]: For program point L543''''(lines 543 544) no Hoare annotation was computed. [2018-01-24 12:46:57,908 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-24 12:46:57,908 INFO L401 ceAbstractionStarter]: For program point cstrlenErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:46:57,908 INFO L401 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-24 12:46:57,908 INFO L401 ceAbstractionStarter]: For program point cstrlenFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-24 12:46:57,908 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-24 12:46:57,908 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:46:57,908 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L397 ceAbstractionStarter]: At program point L553'(line 553) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~3.base))) (and (= main_~length1~3 .cse0) (= 1 (select |#valid| |main_#t~malloc3.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= (select (select |#memory_int| main_~nondetString1~3.base) (+ main_~nondetString1~3.offset .cse0 (- 1))) 0) (= 1 (select |#valid| main_~nondetString1~3.base)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~nondetString1~3.offset) (<= 1 main_~length1~3) (= main_~length1~3 (select |#length| |main_#t~malloc3.base|)))) [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 555) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 555) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 555) no Hoare annotation was computed. [2018-01-24 12:46:57,909 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:46:57,910 INFO L401 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-24 12:46:57,910 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-24 12:46:57,917 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,921 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,930 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,930 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:46:57 BoogieIcfgContainer [2018-01-24 12:46:57,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:46:57,940 INFO L168 Benchmark]: Toolchain (without parser) took 6412.11 ms. Allocated memory was 309.3 MB in the beginning and 545.8 MB in the end (delta: 236.5 MB). Free memory was 269.4 MB in the beginning and 397.0 MB in the end (delta: -127.6 MB). Peak memory consumption was 108.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:46:57,942 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 309.3 MB. Free memory is still 275.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:46:57,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.91 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 259.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:46:57,942 INFO L168 Benchmark]: Boogie Preprocessor took 34.93 ms. Allocated memory is still 309.3 MB. Free memory was 258.1 MB in the beginning and 257.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 12:46:57,942 INFO L168 Benchmark]: RCFGBuilder took 189.31 ms. Allocated memory is still 309.3 MB. Free memory was 257.1 MB in the beginning and 243.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:46:57,943 INFO L168 Benchmark]: TraceAbstraction took 5984.66 ms. Allocated memory was 309.3 MB in the beginning and 545.8 MB in the end (delta: 236.5 MB). Free memory was 242.3 MB in the beginning and 397.0 MB in the end (delta: -154.7 MB). Peak memory consumption was 81.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:46:57,944 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.12 ms. Allocated memory is still 309.3 MB. Free memory is still 275.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 195.91 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 259.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.93 ms. Allocated memory is still 309.3 MB. Free memory was 258.1 MB in the beginning and 257.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 189.31 ms. Allocated memory is still 309.3 MB. Free memory was 257.1 MB in the beginning and 243.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5984.66 ms. Allocated memory was 309.3 MB in the beginning and 545.8 MB in the end (delta: 236.5 MB). Free memory was 242.3 MB in the beginning and 397.0 MB in the end (delta: -154.7 MB). Peak memory consumption was 81.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 - InvariantResult [Line: 543]: Loop Invariant [2018-01-24 12:46:57,951 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,951 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,951 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,951 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,952 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,952 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,952 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,952 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,952 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,953 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,953 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,953 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,953 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,954 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,954 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,954 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,955 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,957 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,957 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:46:57,963 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,963 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,963 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,963 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:57,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:57,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((0 == unknown-#memory_int-unknown[p][p] && p == 0) || !(0 == unknown-#memory_int-unknown[s][s])) || unknown-#length-unknown[s] < 1) || !(\valid[s] == 1)) || !(0 == s)) || !(\exists v_main_~nondetString1~3.offset_BEFORE_CALL_3 : int :: ((0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_3 && v_main_~nondetString1~3.offset_BEFORE_CALL_3 <= s) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_3 + -1] == 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_3 <= 0)) && ((((unknown-#length-unknown[s] < 1 || !(\valid[s] == 1)) || !(0 == s)) || !(\exists v_main_~nondetString1~3.offset_BEFORE_CALL_3 : int :: ((0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_3 && v_main_~nondetString1~3.offset_BEFORE_CALL_3 <= s) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_3 + -1] == 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_3 <= 0)) || ((((\exists v_main_~nondetString1~3.offset_BEFORE_CALL_3 : int :: ((0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_3 && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~3.offset_BEFORE_CALL_3 + -1]) && v_main_~nondetString1~3.offset_BEFORE_CALL_3 <= p) && v_main_~nondetString1~3.offset_BEFORE_CALL_3 <= 0) && 1 <= unknown-#length-unknown[p]) && 1 == \valid[p]) && p == 0) || ((p + 1 <= unknown-#length-unknown[p] && (\exists v_main_~nondetString1~3.offset_BEFORE_CALL_3 : int :: ((0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_3 && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~3.offset_BEFORE_CALL_3 + -1]) && v_main_~nondetString1~3.offset_BEFORE_CALL_3 <= 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_3 + 1 <= p)) && 1 == \valid[p])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 5.9s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 238 SDslu, 534 SDs, 0 SdLazy, 531 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.7s 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 235 HoareAnnotationTreeSize, 9 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 757 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 256 ConstructedInterpolants, 22 QuantifiedInterpolants, 42752 SizeOfPredicates, 42 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 6/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-46-57-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-46-57-971.csv Received shutdown request...