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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:46:04,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:46:04,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:46:04,891 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:46:04,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:46:04,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:46:04,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:46:04,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:46:04,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:46:04,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:46:04,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:46:04,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:46:04,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:46:04,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:46:04,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:46:04,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:46:04,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:46:04,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:46:04,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:46:04,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:46:04,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:46:04,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:46:04,916 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:46:04,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:46:04,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:46:04,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:46:04,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:46:04,920 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:46:04,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:46:04,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:46:04,921 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:46:04,921 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_mostprecise.epf [2018-01-24 19:46:04,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:46:04,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:46:04,931 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:46:04,931 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:46:04,931 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:46:04,931 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:46:04,931 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:46:04,931 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:46:04,931 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:46:04,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:46:04,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:46:04,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:46:04,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:46:04,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:46:04,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:46:04,933 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:46:04,933 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:46:04,933 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:46:04,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:46:04,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:46:04,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:46:04,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:46:04,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:46:04,934 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:46:04,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:46:04,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:46:04,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:46:04,935 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:46:04,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:46:04,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:46:04,935 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:46:04,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:46:04,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:46:04,935 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:46:04,936 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:46:04,936 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:46:04,936 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:46:04,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:46:04,982 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:46:04,986 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:46:04,987 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:46:04,987 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:46:04,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:46:05,132 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:46:05,137 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:46:05,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:46:05,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:46:05,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:46:05,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:46:05" (1/1) ... [2018-01-24 19:46:05,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3565d9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05, skipping insertion in model container [2018-01-24 19:46:05,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:46:05" (1/1) ... [2018-01-24 19:46:05,159 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:46:05,194 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:46:05,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:46:05,325 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:46:05,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05 WrapperNode [2018-01-24 19:46:05,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:46:05,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:46:05,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:46:05,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:46:05,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05" (1/1) ... [2018-01-24 19:46:05,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05" (1/1) ... [2018-01-24 19:46:05,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05" (1/1) ... [2018-01-24 19:46:05,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05" (1/1) ... [2018-01-24 19:46:05,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05" (1/1) ... [2018-01-24 19:46:05,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05" (1/1) ... [2018-01-24 19:46:05,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05" (1/1) ... [2018-01-24 19:46:05,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:46:05,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:46:05,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:46:05,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:46:05,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05" (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 19:46:05,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:46:05,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:46:05,410 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-24 19:46:05,410 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:46:05,410 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:46:05,410 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:46:05,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:46:05,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:46:05,410 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:46:05,410 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:46:05,410 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-24 19:46:05,410 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:46:05,410 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:46:05,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:46:05,549 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:46:05,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:46:05 BoogieIcfgContainer [2018-01-24 19:46:05,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:46:05,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:46:05,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:46:05,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:46:05,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:46:05" (1/3) ... [2018-01-24 19:46:05,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2565aa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:46:05, skipping insertion in model container [2018-01-24 19:46:05,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:46:05" (2/3) ... [2018-01-24 19:46:05,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2565aa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:46:05, skipping insertion in model container [2018-01-24 19:46:05,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:46:05" (3/3) ... [2018-01-24 19:46:05,556 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:46:05,562 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:46:05,568 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 19:46:05,606 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:46:05,606 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:46:05,607 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:46:05,607 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:46:05,607 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:46:05,607 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:46:05,607 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:46:05,607 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:46:05,608 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:46:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-24 19:46:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 19:46:05,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:46:05,638 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:46:05,638 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:46:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-01-24 19:46:05,646 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:46:05,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:05,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:05,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:05,689 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:46:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:05,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:46:05,812 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 19:46:05,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:46:05,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:46:05,814 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:46:05,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:46:05,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:46:05,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:46:05,830 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-01-24 19:46:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:46:05,978 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-24 19:46:05,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:46:05,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 19:46:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:46:05,987 INFO L225 Difference]: With dead ends: 41 [2018-01-24 19:46:05,988 INFO L226 Difference]: Without dead ends: 26 [2018-01-24 19:46:05,991 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 19:46:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-24 19:46:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-24 19:46:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 19:46:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 19:46:06,019 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-01-24 19:46:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:46:06,019 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 19:46:06,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:46:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 19:46:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 19:46:06,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:46:06,020 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:46:06,020 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:46:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-01-24 19:46:06,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:46:06,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:06,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:46:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:06,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:46:06,158 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 19:46:06,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:46:06,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:46:06,159 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:46:06,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:46:06,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:46:06,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:46:06,161 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-24 19:46:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:46:06,241 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-01-24 19:46:06,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:46:06,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 19:46:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:46:06,243 INFO L225 Difference]: With dead ends: 26 [2018-01-24 19:46:06,243 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 19:46:06,244 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 19:46:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 19:46:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 19:46:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 19:46:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 19:46:06,249 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-01-24 19:46:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:46:06,250 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 19:46:06,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:46:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 19:46:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:46:06,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:46:06,251 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:46:06,251 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:46:06,251 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-01-24 19:46:06,251 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:46:06,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:06,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,253 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:46:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:06,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:46:06,317 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 19:46:06,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:46:06,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:46:06,318 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:46:06,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:46:06,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:46:06,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:46:06,319 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-01-24 19:46:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:46:06,360 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-01-24 19:46:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:46:06,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 19:46:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:46:06,362 INFO L225 Difference]: With dead ends: 25 [2018-01-24 19:46:06,362 INFO L226 Difference]: Without dead ends: 24 [2018-01-24 19:46:06,362 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 19:46:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-24 19:46:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-24 19:46:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-24 19:46:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-01-24 19:46:06,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-01-24 19:46:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:46:06,367 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-01-24 19:46:06,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:46:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-01-24 19:46:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:46:06,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:46:06,368 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:46:06,368 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:46:06,368 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-01-24 19:46:06,368 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:46:06,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:06,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,369 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:46:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:06,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:46:06,477 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 19:46:06,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:46:06,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:46:06,478 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:46:06,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:46:06,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:46:06,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:46:06,479 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-01-24 19:46:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:46:06,585 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-01-24 19:46:06,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:46:06,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-01-24 19:46:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:46:06,588 INFO L225 Difference]: With dead ends: 31 [2018-01-24 19:46:06,588 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 19:46:06,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:46:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 19:46:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-01-24 19:46:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 19:46:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 19:46:06,593 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-01-24 19:46:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:46:06,593 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 19:46:06,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:46:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 19:46:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 19:46:06,594 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:46:06,594 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:46:06,594 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:46:06,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-01-24 19:46:06,595 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:46:06,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:06,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,596 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:46:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:06,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:46:06,718 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 19:46:06,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:46:06,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 19:46:06,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:46:06,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:46:06,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:46:06,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:46:06,720 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-01-24 19:46:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:46:06,897 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-24 19:46:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:46:06,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-24 19:46:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:46:06,899 INFO L225 Difference]: With dead ends: 54 [2018-01-24 19:46:06,899 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 19:46:06,900 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 19:46:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 19:46:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-01-24 19:46:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 19:46:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-01-24 19:46:06,907 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-01-24 19:46:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:46:06,907 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-01-24 19:46:06,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:46:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-01-24 19:46:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 19:46:06,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:46:06,909 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:46:06,909 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:46:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-01-24 19:46:06,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:46:06,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:06,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:06,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:46:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:06,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:46:07,084 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 19:46:07,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:07,085 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:46:07,086 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-01-24 19:46:07,088 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [24], [29], [31], [32], [33], [42], [43], [44], [46] [2018-01-24 19:46:07,131 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:46:07,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:46:09,296 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:46:09,297 INFO L268 AbstractInterpreter]: Visited 16 different actions 20 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-24 19:46:09,311 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:46:09,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:09,311 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 19:46:09,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:09,339 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:46:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:09,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:46:09,416 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 19:46:09,420 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 19:46:09,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,457 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 19:46:09,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 19:46:09,597 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 19:46:09,607 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 19:46:09,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:46:09,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:46:09,632 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 19:46:09,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 19:46:09,733 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 19:46:09,734 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:46:09,929 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 19:46:09,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,940 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 19:46:09,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 19:46:09,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,973 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 19:46:09,973 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 19:46:09,978 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 19:46:10,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:10,001 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 19:46:10,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:10,006 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:46:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:10,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:46:10,035 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 19:46:10,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:10,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:10,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 19:46:10,072 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 19:46:10,076 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 19:46:10,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:10,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:10,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:10,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 19:46:10,235 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 19:46:10,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-24 19:46:10,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:46:10,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:46:10,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:46:10,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 19:46:10,353 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 19:46:10,353 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:46:10,424 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 19:46:10,433 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 19:46:10,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:10,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:10,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:10,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 19:46:10,485 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 19:46:10,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:46:10,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 9, 9] total 28 [2018-01-24 19:46:10,486 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:46:10,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 19:46:10,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 19:46:10,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-01-24 19:46:10,488 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2018-01-24 19:46:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:46:10,857 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 19:46:10,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 19:46:10,857 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-01-24 19:46:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:46:10,858 INFO L225 Difference]: With dead ends: 48 [2018-01-24 19:46:10,858 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 19:46:10,859 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 19:46:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 19:46:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-01-24 19:46:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 19:46:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-24 19:46:10,866 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-01-24 19:46:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:46:10,866 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-24 19:46:10,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 19:46:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-24 19:46:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:46:10,867 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:46:10,867 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:46:10,867 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:46:10,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-01-24 19:46:10,868 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:46:10,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:10,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:10,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:10,869 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:46:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:10,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:46:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:46:11,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:11,137 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:46:11,137 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 19:46:11,137 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 19:46:11,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:11,137 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 19:46:11,144 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 19:46:11,145 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 19:46:11,153 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:46:11,157 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:46:11,162 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:46:11,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:46:11,168 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 19:46:11,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:11,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:11,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 19:46:11,229 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 19:46:11,235 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 19:46:11,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:11,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:11,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:11,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 19:46:11,360 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 19:46:11,368 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 19:46:11,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:46:11,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:46:11,383 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 19:46:11,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 19:46:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:46:11,434 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:46:11,685 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 19:46:11,727 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 19:46:11,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:11,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:11,768 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 19:46:11,791 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 19:46:11,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:11,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:11,813 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 19:46:11,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 19:46:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:46:11,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:11,944 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 19:46:11,947 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 19:46:11,947 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 19:46:11,959 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:46:11,968 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:46:11,981 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:46:11,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:46:12,001 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 19:46:12,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:12,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:12,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 19:46:12,013 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 19:46:12,014 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 19:46:12,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:12,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:12,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:12,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 19:46:12,150 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 19:46:12,157 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 19:46:12,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:46:12,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:46:12,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:46:12,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 19:46:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:46:12,186 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:46:12,385 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 19:46:12,394 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 19:46:12,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:12,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:12,401 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 19:46:12,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 19:46:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:46:12,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:46:12,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 10, 10] total 34 [2018-01-24 19:46:12,483 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:46:12,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 19:46:12,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 19:46:12,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 19:46:12,484 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 17 states. [2018-01-24 19:46:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:46:13,066 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 19:46:13,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 19:46:13,066 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-01-24 19:46:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:46:13,067 INFO L225 Difference]: With dead ends: 47 [2018-01-24 19:46:13,067 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 19:46:13,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=252, Invalid=1640, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 19:46:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 19:46:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-01-24 19:46:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 19:46:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-24 19:46:13,073 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 20 [2018-01-24 19:46:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:46:13,073 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-24 19:46:13,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 19:46:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-24 19:46:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:46:13,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:46:13,074 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 19:46:13,074 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:46:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-01-24 19:46:13,074 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:46:13,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:13,075 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 19:46:13,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:13,076 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:46:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:13,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:46:13,142 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 19:46:13,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:46:13,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:46:13,143 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:46:13,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:46:13,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:46:13,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:46:13,143 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-01-24 19:46:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:46:13,170 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-01-24 19:46:13,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:46:13,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 19:46:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:46:13,170 INFO L225 Difference]: With dead ends: 34 [2018-01-24 19:46:13,170 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 19:46:13,171 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 19:46:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 19:46:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 19:46:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 19:46:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 19:46:13,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-24 19:46:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:46:13,171 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 19:46:13,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:46:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 19:46:13,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 19:46:13,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 19:46:13,325 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 55 DAG size of output 1 [2018-01-24 19:46:13,740 WARN L146 SmtUtils]: Spent 399ms on a formula simplification. DAG size of input: 95 DAG size of output 66 [2018-01-24 19:46:13,771 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 19:46:13,771 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 19:46:13,771 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 19:46:13,771 INFO L404 ceAbstractionStarter]: At program point cstrlenENTRY(lines 540 546) the Hoare annotation is: true [2018-01-24 19:46:13,771 INFO L397 ceAbstractionStarter]: At program point L543'''(lines 543 544) the Hoare annotation is: (let ((.cse0 (not (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_4 Int)) (and (<= v_main_~nondetString1~3.offset_BEFORE_CALL_4 |cstrlen_#in~s.offset|) (= (select (select |#memory_int| |cstrlen_#in~s.base|) (+ (select |#length| |cstrlen_#in~s.base|) v_main_~nondetString1~3.offset_BEFORE_CALL_4 (- 1))) 0) (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_4) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_4 0))))) (.cse1 (not (= (select |#valid| |cstrlen_#in~s.base|) 1))) (.cse2 (not (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= |cstrlen_#in~s.offset| v_main_~nondetString1~3.offset_BEFORE_CALL_2) (= (select (select |#memory_int| |cstrlen_#in~s.base|) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2) (select |#length| |cstrlen_#in~s.base|)) (<= 1 main_~length1~3))))) (.cse3 (not (= 0 |cstrlen_#in~s.offset|)))) (and (or (and (= 1 (select |#valid| cstrlen_~p~2.base)) (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2) (select |#length| cstrlen_~p~2.base)) (= (select (select |#memory_int| cstrlen_~p~2.base) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= cstrlen_~p~2.offset v_main_~nondetString1~3.offset_BEFORE_CALL_2) (<= 1 main_~length1~3))) (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_4 Int)) (and (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_4) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_4 cstrlen_~p~2.offset) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_4 0) (= (select (select |#memory_int| cstrlen_~p~2.base) (+ (select |#length| cstrlen_~p~2.base) v_main_~nondetString1~3.offset_BEFORE_CALL_4 (- 1))) 0)))) .cse0 .cse1 .cse2 .cse3) (or (not (= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) |cstrlen_#in~s.offset|))) .cse0 .cse1 .cse2 .cse3 (and (= 0 (select (select |#memory_int| cstrlen_~p~2.base) cstrlen_~p~2.offset)) (= cstrlen_~p~2.offset 0))))) [2018-01-24 19:46:13,771 INFO L401 ceAbstractionStarter]: For program point cstrlenErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 19:46:13,771 INFO L401 ceAbstractionStarter]: For program point cstrlenEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point L543''''(lines 543 544) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point cstrlenErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point cstrlenFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 19:46:13,772 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 19:46:13,773 INFO L397 ceAbstractionStarter]: At program point L553'(line 553) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~3.base))) (and (= main_~length1~3 .cse0) (= 1 (select |#valid| |main_#t~malloc3.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= (select (select |#memory_int| main_~nondetString1~3.base) (+ main_~nondetString1~3.offset .cse0 (- 1))) 0) (= 1 (select |#valid| main_~nondetString1~3.base)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~nondetString1~3.offset) (<= 1 main_~length1~3) (= main_~length1~3 (select |#length| |main_#t~malloc3.base|)))) [2018-01-24 19:46:13,773 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 555) no Hoare annotation was computed. [2018-01-24 19:46:13,773 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 555) no Hoare annotation was computed. [2018-01-24 19:46:13,773 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 19:46:13,773 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-24 19:46:13,773 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 19:46:13,773 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 555) no Hoare annotation was computed. [2018-01-24 19:46:13,773 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 19:46:13,773 INFO L401 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-24 19:46:13,773 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-24 19:46:13,782 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,783 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,783 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,784 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,784 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,784 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,784 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,784 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,784 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,784 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,785 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,785 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,785 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,785 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,802 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,802 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,809 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,809 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:46:13 BoogieIcfgContainer [2018-01-24 19:46:13,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:46:13,816 INFO L168 Benchmark]: Toolchain (without parser) took 8683.44 ms. Allocated memory was 303.6 MB in the beginning and 660.6 MB in the end (delta: 357.0 MB). Free memory was 261.5 MB in the beginning and 352.9 MB in the end (delta: -91.4 MB). Peak memory consumption was 265.7 MB. Max. memory is 5.3 GB. [2018-01-24 19:46:13,817 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 303.6 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:46:13,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.93 ms. Allocated memory is still 303.6 MB. Free memory was 260.5 MB in the beginning and 250.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 19:46:13,818 INFO L168 Benchmark]: Boogie Preprocessor took 29.12 ms. Allocated memory is still 303.6 MB. Free memory was 250.4 MB in the beginning and 249.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 19:46:13,818 INFO L168 Benchmark]: RCFGBuilder took 187.03 ms. Allocated memory is still 303.6 MB. Free memory was 249.4 MB in the beginning and 234.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-24 19:46:13,818 INFO L168 Benchmark]: TraceAbstraction took 8264.14 ms. Allocated memory was 303.6 MB in the beginning and 660.6 MB in the end (delta: 357.0 MB). Free memory was 234.3 MB in the beginning and 352.9 MB in the end (delta: -118.5 MB). Peak memory consumption was 238.5 MB. Max. memory is 5.3 GB. [2018-01-24 19:46:13,821 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.14 ms. Allocated memory is still 303.6 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 195.93 ms. Allocated memory is still 303.6 MB. Free memory was 260.5 MB in the beginning and 250.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.12 ms. Allocated memory is still 303.6 MB. Free memory was 250.4 MB in the beginning and 249.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 187.03 ms. Allocated memory is still 303.6 MB. Free memory was 249.4 MB in the beginning and 234.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8264.14 ms. Allocated memory was 303.6 MB in the beginning and 660.6 MB in the end (delta: 357.0 MB). Free memory was 234.3 MB in the beginning and 352.9 MB in the end (delta: -118.5 MB). Peak memory consumption was 238.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 109 LocStat_NO_SUPPORTING_DISEQUALITIES : 11 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 37 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.044893 RENAME_VARIABLES(MILLISECONDS) : 0.240454 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.977026 PROJECTAWAY(MILLISECONDS) : 0.587161 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.106383 DISJOIN(MILLISECONDS) : 0.250690 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.280081 ADD_EQUALITY(MILLISECONDS) : 0.012450 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013757 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 60 #UNFREEZE : 0 #CONJOIN : 67 #PROJECTAWAY : 54 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 57 #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[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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 #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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-24 19:46:13,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,834 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,834 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,834 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,834 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,844 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,844 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,844 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,844 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 19:46:13,847 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,847 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,847 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,847 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,847 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:46:13,847 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 19:46:13,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 19:46:13,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:46:13,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((1 == \valid[p] && (\exists main_~length1~3 : int, v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[p] && unknown-#memory_int-unknown[p][main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && p <= v_main_~nondetString1~3.offset_BEFORE_CALL_2) && 1 <= main_~length1~3)) && (\exists v_main_~nondetString1~3.offset_BEFORE_CALL_4 : int :: ((0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_4 && v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= p) && v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= 0) && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~3.offset_BEFORE_CALL_4 + -1] == 0)) || !(\exists v_main_~nondetString1~3.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= s && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_4 + -1] == 0) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_4) && v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= 0)) || !(\valid[s] == 1)) || !(\exists main_~length1~3 : int, v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((s <= v_main_~nondetString1~3.offset_BEFORE_CALL_2 && unknown-#memory_int-unknown[s][main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s]) && 1 <= main_~length1~3)) || !(0 == s)) && (((((!(0 == unknown-#memory_int-unknown[s][s]) || !(\exists v_main_~nondetString1~3.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= s && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_4 + -1] == 0) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_4) && v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= 0)) || !(\valid[s] == 1)) || !(\exists main_~length1~3 : int, v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((s <= v_main_~nondetString1~3.offset_BEFORE_CALL_2 && unknown-#memory_int-unknown[s][main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s]) && 1 <= main_~length1~3)) || !(0 == s)) || (0 == unknown-#memory_int-unknown[p][p] && p == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 8.1s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 238 SDslu, 534 SDs, 0 SdLazy, 531 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 253 HoareAnnotationTreeSize, 9 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 739 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 256 ConstructedInterpolants, 22 QuantifiedInterpolants, 42768 SizeOfPredicates, 42 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 6/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-46-13-856.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-46-13-856.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-46-13-856.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-46-13-856.csv Received shutdown request...