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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:28:34,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:28:34,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:28:34,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:28:34,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:28:34,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:28:34,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:28:34,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:28:34,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:28:34,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:28:34,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:28:34,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:28:34,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:28:34,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:28:34,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:28:34,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:28:34,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:28:34,400 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:28:34,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:28:34,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:28:34,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:28:34,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:28:34,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:28:34,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:28:34,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:28:34,410 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:28:34,410 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:28:34,411 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:28:34,411 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:28:34,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:28:34,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:28:34,412 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:28:34,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:28:34,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:28:34,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:28:34,423 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:28:34,423 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:28:34,424 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:28:34,424 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:28:34,424 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:28:34,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:28:34,425 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:28:34,425 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:28:34,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:28:34,425 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:28:34,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:28:34,426 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:28:34,426 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:28:34,426 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:28:34,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:28:34,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:28:34,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:28:34,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:28:34,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:28:34,427 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:28:34,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:28:34,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:28:34,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:28:34,428 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:28:34,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:28:34,428 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:28:34,429 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:28:34,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:28:34,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:28:34,429 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:28:34,429 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:28:34,430 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:28:34,430 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:28:34,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:28:34,475 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:28:34,478 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:28:34,479 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:28:34,479 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:28:34,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:28:34,641 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:28:34,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:28:34,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:28:34,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:28:34,653 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:28:34,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:28:34" (1/1) ... [2018-01-25 05:28:34,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f336ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34, skipping insertion in model container [2018-01-25 05:28:34,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:28:34" (1/1) ... [2018-01-25 05:28:34,675 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:28:34,717 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:28:34,832 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:28:34,846 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:28:34,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34 WrapperNode [2018-01-25 05:28:34,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:28:34,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:28:34,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:28:34,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:28:34,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34" (1/1) ... [2018-01-25 05:28:34,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34" (1/1) ... [2018-01-25 05:28:34,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34" (1/1) ... [2018-01-25 05:28:34,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34" (1/1) ... [2018-01-25 05:28:34,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34" (1/1) ... [2018-01-25 05:28:34,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34" (1/1) ... [2018-01-25 05:28:34,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34" (1/1) ... [2018-01-25 05:28:34,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:28:34,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:28:34,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:28:34,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:28:34,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34" (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-25 05:28:34,934 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:28:34,934 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:28:34,934 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-25 05:28:34,934 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:28:34,934 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:28:34,935 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:28:34,935 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:28:34,935 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:28:34,935 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:28:34,935 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:28:34,935 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-25 05:28:34,936 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:28:34,936 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:28:34,936 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:28:35,099 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:28:35,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:28:35 BoogieIcfgContainer [2018-01-25 05:28:35,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:28:35,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:28:35,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:28:35,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:28:35,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:28:34" (1/3) ... [2018-01-25 05:28:35,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21279fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:28:35, skipping insertion in model container [2018-01-25 05:28:35,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:34" (2/3) ... [2018-01-25 05:28:35,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21279fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:28:35, skipping insertion in model container [2018-01-25 05:28:35,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:28:35" (3/3) ... [2018-01-25 05:28:35,107 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:28:35,116 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:28:35,123 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-25 05:28:35,172 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:28:35,172 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:28:35,172 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:28:35,172 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:28:35,173 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:28:35,173 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:28:35,173 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:28:35,173 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:28:35,174 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:28:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-01-25 05:28:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:28:35,200 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:35,201 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:35,201 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:28:35,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434931, now seen corresponding path program 1 times [2018-01-25 05:28:35,209 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:35,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:35,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:35,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:35,259 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:35,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:35,394 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-25 05:28:35,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:35,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:28:35,398 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:35,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:28:35,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:28:35,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:28:35,419 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-01-25 05:28:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:35,563 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-01-25 05:28:35,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:28:35,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-25 05:28:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:35,573 INFO L225 Difference]: With dead ends: 42 [2018-01-25 05:28:35,574 INFO L226 Difference]: Without dead ends: 27 [2018-01-25 05:28:35,576 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-25 05:28:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-01-25 05:28:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-01-25 05:28:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-25 05:28:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-25 05:28:35,606 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2018-01-25 05:28:35,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:35,606 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-25 05:28:35,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:28:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-25 05:28:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:28:35,607 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:35,607 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:35,607 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:28:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434932, now seen corresponding path program 1 times [2018-01-25 05:28:35,608 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:35,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:35,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:35,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:35,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:35,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:35,736 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-25 05:28:35,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:35,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:28:35,736 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:35,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:28:35,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:28:35,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:28:35,739 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-01-25 05:28:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:35,827 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-01-25 05:28:35,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:35,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-25 05:28:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:35,828 INFO L225 Difference]: With dead ends: 27 [2018-01-25 05:28:35,828 INFO L226 Difference]: Without dead ends: 26 [2018-01-25 05:28:35,829 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-25 05:28:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-25 05:28:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-25 05:28:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-25 05:28:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-25 05:28:35,834 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-01-25 05:28:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:35,835 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-25 05:28:35,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:28:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-25 05:28:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:28:35,835 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:35,835 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:35,835 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:28:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900249, now seen corresponding path program 1 times [2018-01-25 05:28:35,836 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:35,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:35,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:35,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:35,838 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:35,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:35,889 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-25 05:28:35,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:35,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:28:35,890 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:35,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:28:35,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:28:35,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:28:35,890 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-25 05:28:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:35,960 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-01-25 05:28:35,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:28:35,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:28:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:35,962 INFO L225 Difference]: With dead ends: 26 [2018-01-25 05:28:35,962 INFO L226 Difference]: Without dead ends: 25 [2018-01-25 05:28:35,963 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-25 05:28:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-25 05:28:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-25 05:28:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-25 05:28:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-25 05:28:35,968 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-01-25 05:28:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:35,969 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-25 05:28:35,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:28:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-25 05:28:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:28:35,970 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:35,970 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:35,970 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:28:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900248, now seen corresponding path program 1 times [2018-01-25 05:28:35,971 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:35,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:35,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:35,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:35,972 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:35,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:36,099 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-25 05:28:36,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:36,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:28:36,100 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:36,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:28:36,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:28:36,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:28:36,101 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-01-25 05:28:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:36,244 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-01-25 05:28:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:28:36,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-01-25 05:28:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:36,248 INFO L225 Difference]: With dead ends: 33 [2018-01-25 05:28:36,248 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 05:28:36,249 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:28:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 05:28:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-01-25 05:28:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-25 05:28:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-25 05:28:36,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2018-01-25 05:28:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:36,255 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-25 05:28:36,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:28:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-25 05:28:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:28:36,256 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:36,256 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:36,256 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:28:36,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1301829867, now seen corresponding path program 1 times [2018-01-25 05:28:36,257 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:36,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:36,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:36,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:36,258 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:36,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:36,395 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-25 05:28:36,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:36,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:28:36,395 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:36,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:28:36,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:28:36,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:28:36,397 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-01-25 05:28:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:36,557 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-01-25 05:28:36,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:28:36,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-25 05:28:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:36,558 INFO L225 Difference]: With dead ends: 56 [2018-01-25 05:28:36,558 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 05:28:36,558 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-25 05:28:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 05:28:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-01-25 05:28:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 05:28:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-25 05:28:36,564 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2018-01-25 05:28:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:36,565 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-25 05:28:36,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:28:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-25 05:28:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:28:36,565 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:36,565 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:36,566 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:28:36,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1559995305, now seen corresponding path program 1 times [2018-01-25 05:28:36,566 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:36,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:36,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:36,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:36,567 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:36,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:36,766 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-25 05:28:36,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:36,766 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:28:36,767 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-01-25 05:28:36,769 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [16], [25], [30], [32], [33], [34], [43], [44], [45], [47] [2018-01-25 05:28:36,818 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:28:36,819 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:28:37,236 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:28:37,238 INFO L268 AbstractInterpreter]: Visited 17 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-25 05:28:37,247 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:28:37,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:37,247 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-25 05:28:37,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:37,257 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:37,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:37,352 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-25 05:28:37,358 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-25 05:28:37,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:37,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:37,368 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-25 05:28:37,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:28:37,494 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-25 05:28:37,516 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-25 05:28:37,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:37,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:37,573 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-25 05:28:37,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 05:28:37,696 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-25 05:28:37,696 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:37,892 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-25 05:28:37,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:37,900 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-25 05:28:37,910 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-25 05:28:37,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:37,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:37,918 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-25 05:28:37,918 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 05:28:37,928 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-25 05:28:37,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:37,950 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-25 05:28:37,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:37,957 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:37,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:38,008 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-25 05:28:38,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:38,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:38,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:28:38,041 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-25 05:28:38,043 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-25 05:28:38,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:38,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:38,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:38,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:28:38,141 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-25 05:28:38,146 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 17 [2018-01-25 05:28:38,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:38,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:38,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:38,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-25 05:28:38,224 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-25 05:28:38,224 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:38,282 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-25 05:28:38,291 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-25 05:28:38,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:38,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:38,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:38,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:28:38,354 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-25 05:28:38,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:28:38,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 10, 10] total 30 [2018-01-25 05:28:38,356 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:28:38,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 05:28:38,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 05:28:38,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2018-01-25 05:28:38,357 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 16 states. [2018-01-25 05:28:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:39,101 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-25 05:28:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:28:39,101 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-01-25 05:28:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:39,102 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:28:39,102 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 05:28:39,103 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 05:28:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 05:28:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-01-25 05:28:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:28:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-01-25 05:28:39,108 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2018-01-25 05:28:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:39,109 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-01-25 05:28:39,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 05:28:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-01-25 05:28:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:28:39,109 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:39,109 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-25 05:28:39,109 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:28:39,110 INFO L82 PathProgramCache]: Analyzing trace with hash -968711636, now seen corresponding path program 1 times [2018-01-25 05:28:39,110 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:39,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:39,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:39,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:39,111 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:39,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:39,162 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-25 05:28:39,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:39,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:28:39,162 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:39,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:28:39,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:28:39,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:28:39,163 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 4 states. [2018-01-25 05:28:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:39,218 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-25 05:28:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:28:39,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 05:28:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:39,220 INFO L225 Difference]: With dead ends: 42 [2018-01-25 05:28:39,220 INFO L226 Difference]: Without dead ends: 23 [2018-01-25 05:28:39,220 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-25 05:28:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-01-25 05:28:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-01-25 05:28:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-01-25 05:28:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-01-25 05:28:39,226 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2018-01-25 05:28:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:39,227 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-01-25 05:28:39,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:28:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-01-25 05:28:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:28:39,227 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:39,227 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:39,227 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:28:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1772753452, now seen corresponding path program 2 times [2018-01-25 05:28:39,228 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:39,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:39,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:39,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:39,229 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:39,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:39,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:39,470 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:28:39,470 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:28:39,470 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:28:39,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:39,470 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-25 05:28:39,475 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:28:39,475 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:28:39,484 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:39,487 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:39,488 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:28:39,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:39,493 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-25 05:28:39,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:39,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:39,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:28:39,521 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-25 05:28:39,522 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-25 05:28:39,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:39,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:39,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:39,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-25 05:28:39,634 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-25 05:28:39,641 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-25 05:28:39,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:39,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:39,654 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-25 05:28:39,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-25 05:28:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:39,716 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:40,066 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-25 05:28:40,084 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-25 05:28:40,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,104 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-25 05:28:40,124 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-25 05:28:40,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,144 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-25 05:28:40,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-25 05:28:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:40,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:40,244 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-25 05:28:40,247 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:28:40,247 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:28:40,258 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:40,267 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:40,279 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:28:40,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:40,286 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-25 05:28:40,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:28:40,299 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-25 05:28:40,301 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-25 05:28:40,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:28:40,425 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-25 05:28:40,430 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-25 05:28:40,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:40,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:40,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:40,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-25 05:28:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:40,460 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:40,624 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-25 05:28:40,632 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-25 05:28:40,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:40,638 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-25 05:28:40,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 05:28:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:40,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:28:40,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 11, 11] total 36 [2018-01-25 05:28:40,737 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:28:40,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:28:40,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:28:40,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 05:28:40,739 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 18 states. [2018-01-25 05:28:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:41,217 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-01-25 05:28:41,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:28:41,218 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-01-25 05:28:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:41,218 INFO L225 Difference]: With dead ends: 25 [2018-01-25 05:28:41,218 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:28:41,219 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2018-01-25 05:28:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:28:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:28:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:28:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:28:41,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-25 05:28:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:41,220 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:28:41,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:28:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:28:41,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:28:41,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:28:41,588 WARN L146 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 95 DAG size of output 67 [2018-01-25 05:28:41,592 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-25 05:28:41,592 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:28:41,592 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-25 05:28:41,592 INFO L404 ceAbstractionStarter]: At program point cstrlenENTRY(lines 540 547) the Hoare annotation is: true [2018-01-25 05:28:41,593 INFO L401 ceAbstractionStarter]: For program point L544'''(lines 544 545) no Hoare annotation was computed. [2018-01-25 05:28:41,593 INFO L401 ceAbstractionStarter]: For program point cstrlenErr1RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-25 05:28:41,593 INFO L401 ceAbstractionStarter]: For program point cstrlenEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-25 05:28:41,593 INFO L397 ceAbstractionStarter]: At program point L544''''(lines 544 545) the Hoare annotation is: (let ((.cse0 (not (= 0 |cstrlen_#in~str.offset|))) (.cse2 (not (= (select |#valid| |cstrlen_#in~str.base|) 1))) (.cse1 (= 1 (select |#valid| cstrlen_~s~2.base))) (.cse3 (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int) (main_~length1~4 Int)) (and (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4 (- 1)))) (<= |cstrlen_#in~str.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4) (select |#length| |cstrlen_#in~str.base|)) (<= 1 main_~length1~4)))))) (and (or .cse0 (and (= 0 (select (select |#memory_int| cstrlen_~s~2.base) cstrlen_~s~2.offset)) (= cstrlen_~s~2.offset 0) (<= 1 (select |#length| cstrlen_~s~2.base)) .cse1) .cse2 (not (= (select (select |#memory_int| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|) 0)) .cse3) (or .cse0 (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_4 Int)) (and (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_4) (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_4 (select |#length| |cstrlen_#in~str.base|) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_4 0) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_4 |cstrlen_#in~str.offset|)))) .cse2 (and (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_4 Int)) (and (<= v_main_~nondetString1~4.offset_BEFORE_CALL_4 cstrlen_~s~2.offset) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_4) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_4 0) (= (select (select |#memory_int| cstrlen_~s~2.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_4 (select |#length| cstrlen_~s~2.base) (- 1))) 0))) (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int) (main_~length1~4 Int)) (and (<= cstrlen_~s~2.offset v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4) (select |#length| cstrlen_~s~2.base)) (= (select (select |#memory_int| cstrlen_~s~2.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4 (- 1))) 0) (<= 1 main_~length1~4))) .cse1) .cse3))) [2018-01-25 05:28:41,593 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-25 05:28:41,593 INFO L401 ceAbstractionStarter]: For program point cstrlenErr0RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-25 05:28:41,593 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-25 05:28:41,593 INFO L401 ceAbstractionStarter]: For program point L544'''''(lines 544 545) no Hoare annotation was computed. [2018-01-25 05:28:41,593 INFO L401 ceAbstractionStarter]: For program point cstrlenFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 556) the Hoare annotation is: true [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 556) the Hoare annotation is: true [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 556) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 556) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-25 05:28:41,594 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-25 05:28:41,595 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-25 05:28:41,595 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 556) no Hoare annotation was computed. [2018-01-25 05:28:41,595 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:28:41,595 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-25 05:28:41,595 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-25 05:28:41,595 INFO L397 ceAbstractionStarter]: At program point L554'(line 554) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~4.base))) (and (= 1 (select |#valid| |main_#t~malloc3.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= main_~length1~4 .cse0) (= main_~nondetString1~4.offset 0) (= main_~length1~4 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset .cse0 (- 1))) 0) (<= 1 main_~length1~4) (= 1 (select |#valid| main_~nondetString1~4.base)))) [2018-01-25 05:28:41,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,607 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,607 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,607 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,607 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,607 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,608 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,608 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,608 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,608 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,608 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,608 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,609 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,609 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,609 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,609 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,609 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,627 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,627 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:28:41 BoogieIcfgContainer [2018-01-25 05:28:41,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:28:41,634 INFO L168 Benchmark]: Toolchain (without parser) took 6992.45 ms. Allocated memory was 300.9 MB in the beginning and 536.9 MB in the end (delta: 235.9 MB). Free memory was 260.9 MB in the beginning and 307.1 MB in the end (delta: -46.3 MB). Peak memory consumption was 189.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:41,635 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:28:41,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.68 ms. Allocated memory is still 300.9 MB. Free memory was 259.9 MB in the beginning and 249.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:41,635 INFO L168 Benchmark]: Boogie Preprocessor took 31.47 ms. Allocated memory is still 300.9 MB. Free memory was 249.6 MB in the beginning and 248.6 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-25 05:28:41,636 INFO L168 Benchmark]: RCFGBuilder took 215.86 ms. Allocated memory is still 300.9 MB. Free memory was 248.6 MB in the beginning and 233.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:41,636 INFO L168 Benchmark]: TraceAbstraction took 6532.12 ms. Allocated memory was 300.9 MB in the beginning and 536.9 MB in the end (delta: 235.9 MB). Free memory was 233.5 MB in the beginning and 307.1 MB in the end (delta: -73.7 MB). Peak memory consumption was 162.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:41,644 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.19 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.68 ms. Allocated memory is still 300.9 MB. Free memory was 259.9 MB in the beginning and 249.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.47 ms. Allocated memory is still 300.9 MB. Free memory was 249.6 MB in the beginning and 248.6 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 215.86 ms. Allocated memory is still 300.9 MB. Free memory was 248.6 MB in the beginning and 233.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6532.12 ms. Allocated memory was 300.9 MB in the beginning and 536.9 MB in the end (delta: 235.9 MB). Free memory was 233.5 MB in the beginning and 307.1 MB in the end (delta: -73.7 MB). Peak memory consumption was 162.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 16 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 113 LocStat_NO_SUPPORTING_DISEQUALITIES : 15 LocStat_NO_DISJUNCTIONS : -32 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 23 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 37 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 24 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.457745 RENAME_VARIABLES(MILLISECONDS) : 0.387095 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.393575 PROJECTAWAY(MILLISECONDS) : 0.639398 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.103286 DISJOIN(MILLISECONDS) : 0.345812 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.424824 ADD_EQUALITY(MILLISECONDS) : 0.030862 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020827 #CONJOIN_DISJUNCTIVE : 39 #RENAME_VARIABLES : 64 #UNFREEZE : 0 #CONJOIN : 68 #PROJECTAWAY : 57 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 61 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * 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~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,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 #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 #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 #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 #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 #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 #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: 548]: 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: 544]: Loop Invariant [2018-01-25 05:28:41,654 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,654 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,659 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,659 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,659 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,659 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,659 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,662 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:28:41,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:28:41,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:28:41,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:28:41,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:28:41,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(0 == str) || (((0 == unknown-#memory_int-unknown[s][s] && s == 0) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s])) || !(\valid[str] == 1)) || !(unknown-#memory_int-unknown[str][str] == 0)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((0 == unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] && str <= v_main_~nondetString1~4.offset_BEFORE_CALL_2) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[str]) && 1 <= main_~length1~4)) && ((((!(0 == str) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_4 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_4 && 0 == unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_4 + unknown-#length-unknown[str] + -1]) && v_main_~nondetString1~4.offset_BEFORE_CALL_4 <= 0) && v_main_~nondetString1~4.offset_BEFORE_CALL_4 <= str)) || !(\valid[str] == 1)) || (((\exists v_main_~nondetString1~4.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_4 <= s && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_4) && v_main_~nondetString1~4.offset_BEFORE_CALL_4 <= 0) && unknown-#memory_int-unknown[s][v_main_~nondetString1~4.offset_BEFORE_CALL_4 + unknown-#length-unknown[s] + -1] == 0) && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((s <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[s]) && unknown-#memory_int-unknown[s][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0) && 1 <= main_~length1~4)) && 1 == \valid[s])) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((0 == unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] && str <= v_main_~nondetString1~4.offset_BEFORE_CALL_2) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[str]) && 1 <= main_~length1~4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 5 error locations. SAFE Result, 6.4s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 154 SDtfs, 200 SDslu, 506 SDs, 0 SdLazy, 478 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 110 SyntacticMatches, 10 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 239 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 723 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 272 ConstructedInterpolants, 25 QuantifiedInterpolants, 51823 SizeOfPredicates, 42 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 6/52 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/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-28-41-679.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-28-41-679.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-28-41-679.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-28-41-679.csv Received shutdown request...