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_precise.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-24 23:20:00,305 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:20:00,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:20:00,323 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:20:00,323 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:20:00,324 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:20:00,325 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:20:00,327 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:20:00,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:20:00,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:20:00,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:20:00,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:20:00,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:20:00,333 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:20:00,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:20:00,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:20:00,338 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:20:00,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:20:00,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:20:00,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:20:00,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:20:00,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:20:00,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:20:00,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:20:00,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:20:00,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:20:00,349 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:20:00,350 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:20:00,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:20:00,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:20:00,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:20:00,351 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_precise.epf [2018-01-24 23:20:00,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:20:00,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:20:00,362 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:20:00,362 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:20:00,362 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:20:00,362 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:20:00,362 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:20:00,362 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:20:00,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:20:00,363 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:20:00,363 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:20:00,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:20:00,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:20:00,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:20:00,364 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:20:00,364 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:20:00,364 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:20:00,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:20:00,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:20:00,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:20:00,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:20:00,365 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:20:00,365 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:20:00,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:20:00,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:20:00,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:20:00,366 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:20:00,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:20:00,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:20:00,366 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:20:00,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:20:00,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:20:00,367 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:20:00,367 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:20:00,367 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:20:00,367 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:20:00,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:20:00,410 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:20:00,414 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:20:00,415 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:20:00,416 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:20:00,416 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-24 23:20:00,569 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:20:00,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:20:00,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:20:00,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:20:00,580 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:20:00,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:20:00" (1/1) ... [2018-01-24 23:20:00,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a59f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00, skipping insertion in model container [2018-01-24 23:20:00,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:20:00" (1/1) ... [2018-01-24 23:20:00,598 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:20:00,638 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:20:00,761 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:20:00,779 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:20:00,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00 WrapperNode [2018-01-24 23:20:00,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:20:00,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:20:00,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:20:00,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:20:00,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00" (1/1) ... [2018-01-24 23:20:00,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00" (1/1) ... [2018-01-24 23:20:00,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00" (1/1) ... [2018-01-24 23:20:00,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00" (1/1) ... [2018-01-24 23:20:00,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00" (1/1) ... [2018-01-24 23:20:00,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00" (1/1) ... [2018-01-24 23:20:00,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00" (1/1) ... [2018-01-24 23:20:00,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:20:00,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:20:00,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:20:00,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:20:00,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:20:00,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:20:00,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:20:00,868 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-24 23:20:00,868 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:20:00,868 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:20:00,868 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:20:00,869 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:20:00,869 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:20:00,869 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:20:00,869 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:20:00,869 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-24 23:20:00,869 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:20:00,869 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:20:00,869 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:20:01,030 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:20:01,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:20:01 BoogieIcfgContainer [2018-01-24 23:20:01,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:20:01,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:20:01,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:20:01,033 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:20:01,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:20:00" (1/3) ... [2018-01-24 23:20:01,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d94c254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:20:01, skipping insertion in model container [2018-01-24 23:20:01,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:00" (2/3) ... [2018-01-24 23:20:01,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d94c254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:20:01, skipping insertion in model container [2018-01-24 23:20:01,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:20:01" (3/3) ... [2018-01-24 23:20:01,036 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:20:01,043 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:20:01,048 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 23:20:01,085 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:20:01,085 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:20:01,086 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:20:01,086 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:20:01,086 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:20:01,086 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:20:01,086 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:20:01,086 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:20:01,087 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:20:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-01-24 23:20:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 23:20:01,115 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:01,116 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:01,116 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:20:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434931, now seen corresponding path program 1 times [2018-01-24 23:20:01,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:01,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:01,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:01,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:01,168 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:01,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:01,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:01,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:20:01,319 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:01,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:20:01,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:20:01,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:20:01,334 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-01-24 23:20:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:01,476 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-01-24 23:20:01,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:20:01,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 23:20:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:01,486 INFO L225 Difference]: With dead ends: 42 [2018-01-24 23:20:01,486 INFO L226 Difference]: Without dead ends: 27 [2018-01-24 23:20:01,489 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:20:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-01-24 23:20:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-01-24 23:20:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 23:20:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-24 23:20:01,517 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2018-01-24 23:20:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:01,517 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-24 23:20:01,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:20:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-24 23:20:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 23:20:01,518 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:01,518 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:01,518 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:20:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434932, now seen corresponding path program 1 times [2018-01-24 23:20:01,519 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:01,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:01,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:01,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:01,521 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:01,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:01,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:01,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:20:01,634 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:01,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:20:01,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:20:01,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:20:01,637 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-01-24 23:20:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:01,691 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-01-24 23:20:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:20:01,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 23:20:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:01,693 INFO L225 Difference]: With dead ends: 27 [2018-01-24 23:20:01,693 INFO L226 Difference]: Without dead ends: 26 [2018-01-24 23:20:01,694 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:20:01,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-24 23:20:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-24 23:20:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 23:20:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 23:20:01,699 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-01-24 23:20:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:01,700 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 23:20:01,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:20:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 23:20:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:20:01,701 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:01,701 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:01,701 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:20:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900249, now seen corresponding path program 1 times [2018-01-24 23:20:01,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:01,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:01,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:01,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:01,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:01,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:01,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:01,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:20:01,753 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:01,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:20:01,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:20:01,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:20:01,753 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-24 23:20:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:01,817 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-01-24 23:20:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:20:01,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:20:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:01,819 INFO L225 Difference]: With dead ends: 26 [2018-01-24 23:20:01,819 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 23:20:01,819 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:20:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 23:20:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 23:20:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 23:20:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 23:20:01,828 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-01-24 23:20:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:01,828 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 23:20:01,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:20:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 23:20:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:20:01,829 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:01,829 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:01,829 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:20:01,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900248, now seen corresponding path program 1 times [2018-01-24 23:20:01,830 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:01,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:01,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:01,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:01,833 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:01,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:02,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:02,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:20:02,024 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:02,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:20:02,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:20:02,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:20:02,025 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-01-24 23:20:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:02,170 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-01-24 23:20:02,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:20:02,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-01-24 23:20:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:02,173 INFO L225 Difference]: With dead ends: 33 [2018-01-24 23:20:02,173 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 23:20:02,173 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-24 23:20:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 23:20:02,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-01-24 23:20:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 23:20:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-24 23:20:02,179 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2018-01-24 23:20:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:02,179 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-24 23:20:02,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:20:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-24 23:20:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:20:02,180 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:02,180 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:02,180 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:20:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1301829867, now seen corresponding path program 1 times [2018-01-24 23:20:02,180 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:02,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:02,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:02,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:02,181 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:02,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:02,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:02,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 23:20:02,329 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:02,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:20:02,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:20:02,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:20:02,331 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-01-24 23:20:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:02,491 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-01-24 23:20:02,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:20:02,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-24 23:20:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:02,492 INFO L225 Difference]: With dead ends: 56 [2018-01-24 23:20:02,493 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 23:20:02,493 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:20:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 23:20:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-01-24 23:20:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 23:20:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-24 23:20:02,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2018-01-24 23:20:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:02,503 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-24 23:20:02,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:20:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-24 23:20:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:20:02,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:02,505 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:02,505 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:20:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1559995305, now seen corresponding path program 1 times [2018-01-24 23:20:02,505 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:02,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:02,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:02,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:02,507 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:02,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:02,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:20:02,853 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:20:02,854 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-01-24 23:20:02,855 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [16], [25], [30], [32], [33], [34], [43], [44], [45], [47] [2018-01-24 23:20:02,898 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:20:02,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:20:05,194 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:20:05,196 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-24 23:20:05,208 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:20:05,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:20:05,208 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:20:05,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:05,220 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:20:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:05,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:20:05,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 23:20:05,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 23:20:05,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:05,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:05,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 23:20:05,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 23:20:05,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 23:20:05,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 23:20:05,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:20:05,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:05,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:05,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 23:20:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:05,722 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:20:06,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 23:20:06,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:20:06,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:20:06,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,139 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 23:20:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:06,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:20:06,180 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 23:20:06,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:06,187 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:20:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:06,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:20:06,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:20:06,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 23:20:06,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:20:06,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 23:20:06,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 23:20:06,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 23:20:06,362 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-24 23:20:06,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:20:06,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:06,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:06,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-24 23:20:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:06,427 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:20:06,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:20:06,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:20:06,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:06,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 23:20:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:06,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 23:20:06,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 10, 10] total 30 [2018-01-24 23:20:06,575 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 23:20:06,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 23:20:06,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 23:20:06,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2018-01-24 23:20:06,577 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 16 states. [2018-01-24 23:20:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:07,437 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-24 23:20:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 23:20:07,438 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-01-24 23:20:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:07,440 INFO L225 Difference]: With dead ends: 51 [2018-01-24 23:20:07,440 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 23:20:07,440 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 23:20:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 23:20:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-01-24 23:20:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 23:20:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-01-24 23:20:07,448 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2018-01-24 23:20:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:07,448 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-01-24 23:20:07,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 23:20:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-01-24 23:20:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:20:07,449 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:07,449 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:07,449 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:20:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash -968711636, now seen corresponding path program 1 times [2018-01-24 23:20:07,449 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:07,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:07,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:07,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:07,450 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:07,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:07,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:07,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:20:07,529 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:07,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:20:07,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:20:07,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:20:07,530 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 4 states. [2018-01-24 23:20:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:07,597 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-24 23:20:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:20:07,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 23:20:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:07,598 INFO L225 Difference]: With dead ends: 42 [2018-01-24 23:20:07,598 INFO L226 Difference]: Without dead ends: 23 [2018-01-24 23:20:07,599 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:20:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-01-24 23:20:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-01-24 23:20:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-01-24 23:20:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-01-24 23:20:07,604 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2018-01-24 23:20:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:07,604 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-01-24 23:20:07,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:20:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-01-24 23:20:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:20:07,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:07,605 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:07,605 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:20:07,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1772753452, now seen corresponding path program 2 times [2018-01-24 23:20:07,605 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:07,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:07,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:07,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:07,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:07,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:07,821 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-24 23:20:07,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:20:07,821 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:20:07,822 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 23:20:07,822 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:20:07,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:20:07,822 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:20:07,827 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 23:20:07,842 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 23:20:07,850 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 23:20:07,853 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 23:20:07,854 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 23:20:07,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:20:07,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:20:07,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:07,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:07,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 23:20:07,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:20:07,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 23:20:07,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:07,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:07,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:07,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 23:20:07,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 23:20:07,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:20:07,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:20:07,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:08,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:08,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 23:20:08,057 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-24 23:20:08,058 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:20:08,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-01-24 23:20:08,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:20:08,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-01-24 23:20:08,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:20:08,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:08,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 23:20:08,532 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-24 23:20:08,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:20:08,553 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 23:20:08,556 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 23:20:08,556 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 23:20:08,568 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 23:20:08,577 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 23:20:08,589 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 23:20:08,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:20:08,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:20:08,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 23:20:08,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 23:20:08,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 23:20:08,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 23:20:08,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 23:20:08,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 23:20:08,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:20:08,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:08,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:08,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 23:20:08,792 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-24 23:20:08,792 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:20:08,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:20:08,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:20:08,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:20:08,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:20:08,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 23:20:09,046 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-24 23:20:09,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 23:20:09,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 11, 11] total 36 [2018-01-24 23:20:09,048 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 23:20:09,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 23:20:09,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 23:20:09,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 23:20:09,050 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 18 states. [2018-01-24 23:20:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:09,527 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-01-24 23:20:09,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 23:20:09,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-01-24 23:20:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:09,528 INFO L225 Difference]: With dead ends: 25 [2018-01-24 23:20:09,528 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 23:20:09,529 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 23:20:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 23:20:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 23:20:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 23:20:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 23:20:09,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-24 23:20:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:09,530 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 23:20:09,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 23:20:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 23:20:09,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 23:20:09,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 23:20:09,754 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 46 DAG size of output 30 [2018-01-24 23:20:09,961 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 95 DAG size of output 67 [2018-01-24 23:20:09,964 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-24 23:20:09,965 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 23:20:09,965 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-24 23:20:09,965 INFO L404 ceAbstractionStarter]: At program point cstrlenENTRY(lines 540 547) the Hoare annotation is: true [2018-01-24 23:20:09,965 INFO L401 ceAbstractionStarter]: For program point L544'''(lines 544 545) no Hoare annotation was computed. [2018-01-24 23:20:09,965 INFO L401 ceAbstractionStarter]: For program point cstrlenErr1RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 23:20:09,965 INFO L401 ceAbstractionStarter]: For program point cstrlenEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-24 23:20:09,965 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-24 23:20:09,965 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point cstrlenErr0RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point L544'''''(lines 544 545) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point cstrlenFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 556) the Hoare annotation is: true [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 556) the Hoare annotation is: true [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-24 23:20:09,966 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-24 23:20:09,967 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 556) no Hoare annotation was computed. [2018-01-24 23:20:09,967 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 556) no Hoare annotation was computed. [2018-01-24 23:20:09,967 INFO L401 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-24 23:20:09,967 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 23:20:09,967 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 23:20:09,967 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 556) no Hoare annotation was computed. [2018-01-24 23:20:09,967 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 23:20:09,967 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-24 23:20:09,967 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-24 23:20:09,967 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-24 23:20:09,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:09,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:09,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:09,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:09,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:09,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:20:10 BoogieIcfgContainer [2018-01-24 23:20:10,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:20:10,002 INFO L168 Benchmark]: Toolchain (without parser) took 9432.52 ms. Allocated memory was 305.1 MB in the beginning and 662.7 MB in the end (delta: 357.6 MB). Free memory was 265.0 MB in the beginning and 309.2 MB in the end (delta: -44.2 MB). Peak memory consumption was 313.4 MB. Max. memory is 5.3 GB. [2018-01-24 23:20:10,003 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:20:10,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.28 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 254.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 23:20:10,004 INFO L168 Benchmark]: Boogie Preprocessor took 31.56 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 253.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 23:20:10,004 INFO L168 Benchmark]: RCFGBuilder took 210.55 ms. Allocated memory is still 305.1 MB. Free memory was 253.0 MB in the beginning and 237.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. [2018-01-24 23:20:10,005 INFO L168 Benchmark]: TraceAbstraction took 8969.83 ms. Allocated memory was 305.1 MB in the beginning and 662.7 MB in the end (delta: 357.6 MB). Free memory was 237.7 MB in the beginning and 309.2 MB in the end (delta: -71.5 MB). Peak memory consumption was 286.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:20:10,007 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.28 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 254.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.56 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 253.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 210.55 ms. Allocated memory is still 305.1 MB. Free memory was 253.0 MB in the beginning and 237.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8969.83 ms. Allocated memory was 305.1 MB in the beginning and 662.7 MB in the end (delta: 357.6 MB). Free memory was 237.7 MB in the beginning and 309.2 MB in the end (delta: -71.5 MB). Peak memory consumption was 286.0 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) : 1.184096 RENAME_VARIABLES(MILLISECONDS) : 0.228629 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.127798 PROJECTAWAY(MILLISECONDS) : 0.481010 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.109977 DISJOIN(MILLISECONDS) : 0.294227 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.264165 ADD_EQUALITY(MILLISECONDS) : 0.021925 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019756 #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-24 23:20:10,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,022 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,022 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,022 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,022 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,023 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,029 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,029 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,029 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,029 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,029 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,029 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 23:20:10,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 23:20:10,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 23:20:10,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 23:20:10,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 23:20:10,040 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, 8.8s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 154 SDtfs, 200 SDslu, 506 SDs, 0 SdLazy, 478 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 110 SyntacticMatches, 10 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 3.2s 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, 2.3s 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.4s 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_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-20-10-046.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_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-20-10-046.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_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-20-10-046.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_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-20-10-046.csv Received shutdown request...