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_imprecise.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 16:42:27,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:42:27,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:42:27,812 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:42:27,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:42:27,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:42:27,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:42:27,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:42:27,818 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:42:27,819 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:42:27,820 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:42:27,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:42:27,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:42:27,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:42:27,823 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:42:27,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:42:27,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:42:27,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:42:27,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:42:27,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:42:27,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:42:27,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:42:27,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:42:27,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:42:27,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:42:27,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:42:27,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:42:27,840 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:42:27,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:42:27,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:42:27,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:42:27,841 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_imprecise.epf [2018-01-24 16:42:27,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:42:27,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:42:27,852 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:42:27,853 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:42:27,853 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:42:27,853 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:42:27,853 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:42:27,853 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:42:27,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:42:27,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:42:27,854 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:42:27,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:42:27,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:42:27,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:42:27,855 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:42:27,855 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:42:27,855 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:42:27,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:42:27,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:42:27,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:42:27,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:42:27,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:42:27,856 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:42:27,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:42:27,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:42:27,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:42:27,857 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:42:27,857 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:42:27,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:42:27,858 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:42:27,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:42:27,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:42:27,858 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:42:27,858 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:42:27,859 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:42:27,860 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:42:27,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:42:27,907 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:42:27,911 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:42:27,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:42:27,913 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:42:27,914 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 16:42:28,085 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:42:28,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:42:28,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:42:28,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:42:28,097 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:42:28,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:42:28" (1/1) ... [2018-01-24 16:42:28,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd46d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28, skipping insertion in model container [2018-01-24 16:42:28,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:42:28" (1/1) ... [2018-01-24 16:42:28,114 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:42:28,151 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:42:28,266 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:42:28,282 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:42:28,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28 WrapperNode [2018-01-24 16:42:28,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:42:28,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:42:28,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:42:28,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:42:28,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28" (1/1) ... [2018-01-24 16:42:28,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28" (1/1) ... [2018-01-24 16:42:28,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28" (1/1) ... [2018-01-24 16:42:28,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28" (1/1) ... [2018-01-24 16:42:28,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28" (1/1) ... [2018-01-24 16:42:28,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28" (1/1) ... [2018-01-24 16:42:28,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28" (1/1) ... [2018-01-24 16:42:28,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:42:28,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:42:28,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:42:28,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:42:28,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28" (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 16:42:28,378 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:42:28,378 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:42:28,378 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-24 16:42:28,378 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:42:28,378 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:42:28,379 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:42:28,379 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:42:28,379 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:42:28,379 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:42:28,379 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:42:28,379 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-24 16:42:28,380 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:42:28,380 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:42:28,380 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:42:28,518 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:42:28,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:42:28 BoogieIcfgContainer [2018-01-24 16:42:28,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:42:28,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:42:28,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:42:28,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:42:28,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:42:28" (1/3) ... [2018-01-24 16:42:28,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601c9c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:42:28, skipping insertion in model container [2018-01-24 16:42:28,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:28" (2/3) ... [2018-01-24 16:42:28,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601c9c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:42:28, skipping insertion in model container [2018-01-24 16:42:28,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:42:28" (3/3) ... [2018-01-24 16:42:28,525 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:42:28,531 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:42:28,537 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 16:42:28,578 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:42:28,578 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:42:28,578 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:42:28,578 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:42:28,578 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:42:28,578 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:42:28,578 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:42:28,578 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:42:28,579 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:42:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-24 16:42:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 16:42:28,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:28,605 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:28,606 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:42:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-01-24 16:42:28,613 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:28,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:28,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:28,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:28,658 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:28,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:28,778 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 16:42:28,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:28,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:42:28,781 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:28,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:42:28,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:42:28,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:42:28,802 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-01-24 16:42:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:28,976 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-24 16:42:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:42:28,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 16:42:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:28,986 INFO L225 Difference]: With dead ends: 41 [2018-01-24 16:42:28,986 INFO L226 Difference]: Without dead ends: 26 [2018-01-24 16:42:28,988 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 16:42:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-24 16:42:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-24 16:42:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 16:42:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 16:42:29,015 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-01-24 16:42:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:29,016 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 16:42:29,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:42:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 16:42:29,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 16:42:29,016 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:29,017 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:29,017 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:42:29,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-01-24 16:42:29,017 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:29,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:29,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:29,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:29,155 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 16:42:29,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:29,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:42:29,156 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:29,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:42:29,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:42:29,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:42:29,159 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-24 16:42:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:29,217 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-01-24 16:42:29,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:42:29,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 16:42:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:29,219 INFO L225 Difference]: With dead ends: 26 [2018-01-24 16:42:29,219 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 16:42:29,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:42:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 16:42:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 16:42:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 16:42:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 16:42:29,225 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-01-24 16:42:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:29,226 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 16:42:29,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:42:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 16:42:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:42:29,226 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:29,227 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:29,227 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:42:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-01-24 16:42:29,227 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:29,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:29,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,229 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:29,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:29,270 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 16:42:29,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:29,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:42:29,271 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:29,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:42:29,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:42:29,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:42:29,271 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-01-24 16:42:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:29,331 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-01-24 16:42:29,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:42:29,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:42:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:29,332 INFO L225 Difference]: With dead ends: 25 [2018-01-24 16:42:29,332 INFO L226 Difference]: Without dead ends: 24 [2018-01-24 16:42:29,333 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 16:42:29,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-24 16:42:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-24 16:42:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-24 16:42:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-01-24 16:42:29,338 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-01-24 16:42:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:29,338 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-01-24 16:42:29,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:42:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-01-24 16:42:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:42:29,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:29,339 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:29,339 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:42:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-01-24 16:42:29,340 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:29,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:29,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,341 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:29,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:29,512 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 16:42:29,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:29,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:42:29,513 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:29,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:42:29,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:42:29,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:42:29,514 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-01-24 16:42:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:29,623 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-01-24 16:42:29,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:42:29,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-01-24 16:42:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:29,626 INFO L225 Difference]: With dead ends: 31 [2018-01-24 16:42:29,626 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 16:42:29,627 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:42:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 16:42:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-01-24 16:42:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 16:42:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 16:42:29,632 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-01-24 16:42:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:29,633 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 16:42:29,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:42:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 16:42:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:42:29,633 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:29,634 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:29,634 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:42:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-01-24 16:42:29,634 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:29,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:29,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,635 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:29,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:29,770 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 16:42:29,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:29,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:42:29,806 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:29,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:42:29,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:42:29,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:42:29,808 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-01-24 16:42:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:29,942 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-24 16:42:29,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:42:29,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-24 16:42:29,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:29,943 INFO L225 Difference]: With dead ends: 54 [2018-01-24 16:42:29,943 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 16:42:29,944 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 16:42:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 16:42:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-01-24 16:42:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 16:42:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-01-24 16:42:29,949 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-01-24 16:42:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:29,949 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-01-24 16:42:29,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:42:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-01-24 16:42:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:42:29,950 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:29,950 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:29,950 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:42:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-01-24 16:42:29,951 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:29,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:29,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:29,952 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:29,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:30,130 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 16:42:30,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:30,131 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:42:30,132 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-01-24 16:42:30,133 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [24], [29], [31], [32], [33], [42], [43], [44], [46] [2018-01-24 16:42:30,179 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:42:30,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:42:30,340 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:42:30,341 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 16:42:30,362 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:42:30,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:30,362 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 16:42:30,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:30,370 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:42:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:30,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:30,424 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 16:42:30,426 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 16:42:30,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,434 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 16:42:30,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:42:30,515 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 16:42:30,536 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 16:42:30,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:30,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:30,567 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 16:42:30,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 16:42:30,637 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 16:42:30,637 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:30,804 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 16:42:30,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,816 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 16:42:30,829 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 16:42:30,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,837 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 16:42:30,838 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 16:42:30,861 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 16:42:30,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:30,882 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 16:42:30,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:30,889 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:42:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:30,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:30,919 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 16:42:30,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:42:30,949 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 16:42:30,951 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 16:42:30,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:30,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:42:31,064 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 16:42:31,080 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 16:42:31,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:31,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:31,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:31,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 16:42:31,165 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 16:42:31,165 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:31,233 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 16:42:31,242 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 16:42:31,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:31,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:31,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:31,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:42:31,305 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 16:42:31,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:42:31,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 9, 9] total 28 [2018-01-24 16:42:31,307 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:42:31,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 16:42:31,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 16:42:31,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-01-24 16:42:31,308 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2018-01-24 16:42:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:31,668 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 16:42:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:42:31,668 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-01-24 16:42:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:31,669 INFO L225 Difference]: With dead ends: 48 [2018-01-24 16:42:31,669 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 16:42:31,670 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 16:42:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 16:42:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-01-24 16:42:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 16:42:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-24 16:42:31,677 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-01-24 16:42:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:31,677 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-24 16:42:31,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 16:42:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-24 16:42:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:42:31,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:31,678 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:31,679 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:42:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-01-24 16:42:31,679 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:31,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:31,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:31,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:31,680 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:31,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:31,865 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 16:42:31,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:31,866 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:42:31,866 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:42:31,866 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:42:31,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:31,866 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 16:42:31,871 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:42:31,871 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:42:31,878 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:31,881 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:31,882 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:42:31,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:31,887 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 16:42:31,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:31,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:31,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:42:31,915 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 16:42:31,917 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 16:42:31,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:31,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:31,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:31,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 16:42:32,011 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 16:42:32,016 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 16:42:32,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:32,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:32,028 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 16:42:32,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 16:42:32,070 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 16:42:32,070 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:32,272 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 16:42:32,299 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 16:42:32,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,336 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 16:42:32,356 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 16:42:32,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,380 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 16:42:32,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 16:42:32,490 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 16:42:32,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:32,510 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 16:42:32,517 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:42:32,517 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:42:32,531 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:32,540 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:32,552 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:42:32,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:32,559 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 16:42:32,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:42:32,579 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 16:42:32,582 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 16:42:32,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 16:42:32,739 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 16:42:32,745 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 16:42:32,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:32,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:32,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:32,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 16:42:32,769 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 16:42:32,770 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:32,912 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 16:42:32,921 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 16:42:32,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:32,927 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 16:42:32,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 16:42:32,999 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 16:42:33,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:42:33,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 10, 10] total 34 [2018-01-24 16:42:33,000 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:42:33,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 16:42:33,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 16:42:33,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 16:42:33,002 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 17 states. [2018-01-24 16:42:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:33,535 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 16:42:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 16:42:33,535 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-01-24 16:42:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:33,536 INFO L225 Difference]: With dead ends: 47 [2018-01-24 16:42:33,536 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 16:42:33,537 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=252, Invalid=1640, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 16:42:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 16:42:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-01-24 16:42:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 16:42:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-24 16:42:33,544 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 20 [2018-01-24 16:42:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:33,544 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-24 16:42:33,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 16:42:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-24 16:42:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:42:33,545 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:33,545 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 16:42:33,545 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:42:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-01-24 16:42:33,545 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:33,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:33,546 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:42:33,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:33,546 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:33,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:33,591 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 16:42:33,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:33,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:42:33,592 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:33,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:42:33,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:42:33,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:42:33,592 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-01-24 16:42:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:33,617 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-01-24 16:42:33,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:42:33,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 16:42:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:33,618 INFO L225 Difference]: With dead ends: 34 [2018-01-24 16:42:33,618 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 16:42:33,618 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 16:42:33,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 16:42:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 16:42:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 16:42:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 16:42:33,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-24 16:42:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:33,619 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 16:42:33,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:42:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 16:42:33,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 16:42:33,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 16:42:34,099 WARN L146 SmtUtils]: Spent 355ms on a formula simplification. DAG size of input: 95 DAG size of output 66 [2018-01-24 16:42:34,129 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 16:42:34,129 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:42:34,129 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 16:42:34,129 INFO L404 ceAbstractionStarter]: At program point cstrlenENTRY(lines 540 546) the Hoare annotation is: true [2018-01-24 16:42:34,130 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 16:42:34,130 INFO L401 ceAbstractionStarter]: For program point cstrlenErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 16:42:34,130 INFO L401 ceAbstractionStarter]: For program point cstrlenEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-24 16:42:34,130 INFO L401 ceAbstractionStarter]: For program point L543''''(lines 543 544) no Hoare annotation was computed. [2018-01-24 16:42:34,130 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-24 16:42:34,130 INFO L401 ceAbstractionStarter]: For program point cstrlenErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 16:42:34,130 INFO L401 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-24 16:42:34,130 INFO L401 ceAbstractionStarter]: For program point cstrlenFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-24 16:42:34,130 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-24 16:42:34,130 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 16:42:34,130 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 16:42:34,131 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 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 555) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 555) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 555) no Hoare annotation was computed. [2018-01-24 16:42:34,131 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:42:34,131 INFO L401 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-24 16:42:34,132 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-24 16:42:34,138 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,139 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 16:42:34,139 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,139 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 16:42:34,140 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 16:42:34,140 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,140 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 16:42:34,140 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 16:42:34,140 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 16:42:34,140 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 16:42:34,140 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 16:42:34,141 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 16:42:34,141 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 16:42:34,141 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 16:42:34,141 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 16:42:34,141 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,141 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 16:42:34,142 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,142 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 16:42:34,142 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,142 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 16:42:34,142 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 16:42:34,142 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 16:42:34,143 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 16:42:34,143 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 16:42:34,143 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,143 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 16:42:34,143 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,143 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 16:42:34,143 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,145 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,145 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,145 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,145 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,155 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 16:42:34,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,155 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 16:42:34,156 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 16:42:34,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,156 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 16:42:34,156 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 16:42:34,156 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 16:42:34,157 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 16:42:34,157 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 16:42:34,157 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 16:42:34,157 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 16:42:34,158 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 16:42:34,158 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 16:42:34,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,158 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 16:42:34,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,159 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 16:42:34,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,159 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 16:42:34,160 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 16:42:34,160 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 16:42:34,160 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 16:42:34,160 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 16:42:34,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,161 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 16:42:34,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,161 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 16:42:34,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:42:34 BoogieIcfgContainer [2018-01-24 16:42:34,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:42:34,168 INFO L168 Benchmark]: Toolchain (without parser) took 6083.15 ms. Allocated memory was 306.2 MB in the beginning and 547.4 MB in the end (delta: 241.2 MB). Free memory was 266.2 MB in the beginning and 438.3 MB in the end (delta: -172.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:42:34,169 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:42:34,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.09 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 256.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:42:34,170 INFO L168 Benchmark]: Boogie Preprocessor took 34.80 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 16:42:34,170 INFO L168 Benchmark]: RCFGBuilder took 193.49 ms. Allocated memory is still 306.2 MB. Free memory was 254.0 MB in the beginning and 240.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:42:34,171 INFO L168 Benchmark]: TraceAbstraction took 5648.09 ms. Allocated memory was 306.2 MB in the beginning and 547.4 MB in the end (delta: 241.2 MB). Free memory was 239.2 MB in the beginning and 438.3 MB in the end (delta: -199.0 MB). Peak memory consumption was 42.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:42:34,172 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.18 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.09 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 256.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.80 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 193.49 ms. Allocated memory is still 306.2 MB. Free memory was 254.0 MB in the beginning and 240.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5648.09 ms. Allocated memory was 306.2 MB in the beginning and 547.4 MB in the end (delta: 241.2 MB). Free memory was 239.2 MB in the beginning and 438.3 MB in the end (delta: -199.0 MB). Peak memory consumption was 42.1 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 : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 104 LocStat_NO_SUPPORTING_DISEQUALITIES : 11 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 37 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.649401 RENAME_VARIABLES(MILLISECONDS) : 0.441927 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.596564 PROJECTAWAY(MILLISECONDS) : 0.884721 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001061 DISJOIN(MILLISECONDS) : 0.533152 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.485880 ADD_EQUALITY(MILLISECONDS) : 0.026081 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018051 #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 16:42:34,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,181 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 16:42:34,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,182 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 16:42:34,182 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 16:42:34,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,182 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 16:42:34,183 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 16:42:34,183 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 16:42:34,183 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 16:42:34,183 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 16:42:34,183 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 16:42:34,184 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 16:42:34,184 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 16:42:34,184 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 16:42:34,184 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,184 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 16:42:34,185 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,185 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 16:42:34,185 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,185 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 16:42:34,185 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 16:42:34,186 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 16:42:34,186 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 16:42:34,186 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 16:42:34,186 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,186 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 16:42:34,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,187 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 16:42:34,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,193 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 16:42:34,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,193 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 16:42:34,193 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 16:42:34,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,194 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 16:42:34,194 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 16:42:34,194 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 16:42:34,194 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 16:42:34,195 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 16:42:34,195 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 16:42:34,195 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 16:42:34,195 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 16:42:34,195 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 16:42:34,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,196 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 16:42:34,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,196 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 16:42:34,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,197 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 16:42:34,197 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 16:42:34,197 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 16:42:34,197 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 16:42:34,197 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 16:42:34,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,198 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 16:42:34,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,198 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 16:42:34,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-24 16:42:34,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:42:34,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:42:34,201 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, 5.5s 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.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.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s 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_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-42-34-207.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-42-34-207.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-42-34-207.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_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-42-34-207.csv Received shutdown request...