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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:36:54,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:36:54,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:36:54,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:36:54,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:36:54,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:36:54,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:36:54,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:36:54,063 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:36:54,064 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:36:54,065 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:36:54,065 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:36:54,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:36:54,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:36:54,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:36:54,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:36:54,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:36:54,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:36:54,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:36:54,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:36:54,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:36:54,081 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:36:54,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:36:54,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:36:54,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:36:54,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:36:54,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:36:54,085 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:36:54,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:36:54,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:36:54,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:36:54,087 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:36:54,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:36:54,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:36:54,097 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:36:54,098 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:36:54,098 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:36:54,098 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:36:54,098 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:36:54,099 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:36:54,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:36:54,099 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:36:54,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:36:54,100 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:36:54,100 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:36:54,100 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:36:54,100 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:36:54,100 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:36:54,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:36:54,101 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:36:54,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:36:54,101 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:36:54,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:36:54,102 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:36:54,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:36:54,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:36:54,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:36:54,102 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:36:54,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:36:54,103 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:36:54,103 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:36:54,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:36:54,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:36:54,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:36:54,104 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:36:54,105 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:36:54,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:36:54,153 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:36:54,158 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:36:54,160 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:36:54,160 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:36:54,161 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-29 22:36:54,338 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:36:54,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:36:54,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:36:54,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:36:54,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:36:54,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:36:54" (1/1) ... [2018-01-29 22:36:54,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ecb39d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54, skipping insertion in model container [2018-01-29 22:36:54,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:36:54" (1/1) ... [2018-01-29 22:36:54,372 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:36:54,413 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:36:54,527 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:36:54,542 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:36:54,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54 WrapperNode [2018-01-29 22:36:54,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:36:54,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:36:54,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:36:54,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:36:54,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54" (1/1) ... [2018-01-29 22:36:54,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54" (1/1) ... [2018-01-29 22:36:54,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54" (1/1) ... [2018-01-29 22:36:54,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54" (1/1) ... [2018-01-29 22:36:54,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54" (1/1) ... [2018-01-29 22:36:54,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54" (1/1) ... [2018-01-29 22:36:54,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54" (1/1) ... [2018-01-29 22:36:54,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:36:54,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:36:54,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:36:54,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:36:54,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54" (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-29 22:36:54,637 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:36:54,637 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:36:54,638 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-29 22:36:54,638 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:36:54,638 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:36:54,638 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:36:54,638 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:36:54,638 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:36:54,638 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:36:54,639 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:36:54,639 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-29 22:36:54,639 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:36:54,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:36:54,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:36:54,817 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:36:54,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:36:54 BoogieIcfgContainer [2018-01-29 22:36:54,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:36:54,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:36:54,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:36:54,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:36:54,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:36:54" (1/3) ... [2018-01-29 22:36:54,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e84185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:36:54, skipping insertion in model container [2018-01-29 22:36:54,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:54" (2/3) ... [2018-01-29 22:36:54,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e84185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:36:54, skipping insertion in model container [2018-01-29 22:36:54,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:36:54" (3/3) ... [2018-01-29 22:36:54,825 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:36:54,832 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:36:54,841 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-29 22:36:54,891 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:36:54,891 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:36:54,891 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:36:54,891 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:36:54,891 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:36:54,891 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:36:54,892 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:36:54,892 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:36:54,893 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:36:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-01-29 22:36:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-29 22:36:54,919 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:54,920 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:54,920 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash -481424937, now seen corresponding path program 1 times [2018-01-29 22:36:54,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:54,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:54,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:54,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:54,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:55,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:55,149 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-29 22:36:55,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:55,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:36:55,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:36:55,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:36:55,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:36:55,168 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2018-01-29 22:36:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:55,322 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-01-29 22:36:55,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:36:55,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-29 22:36:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:55,334 INFO L225 Difference]: With dead ends: 55 [2018-01-29 22:36:55,334 INFO L226 Difference]: Without dead ends: 38 [2018-01-29 22:36:55,337 INFO L553 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-29 22:36:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-29 22:36:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-29 22:36:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-29 22:36:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-29 22:36:55,368 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 13 [2018-01-29 22:36:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:55,368 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-29 22:36:55,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:36:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-29 22:36:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-29 22:36:55,369 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:55,369 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:55,369 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash -481424936, now seen corresponding path program 1 times [2018-01-29 22:36:55,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:55,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:55,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:55,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:55,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:55,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:55,504 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-29 22:36:55,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:55,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:36:55,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:36:55,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:36:55,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:36:55,507 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 5 states. [2018-01-29 22:36:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:55,580 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-01-29 22:36:55,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:36:55,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-29 22:36:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:55,581 INFO L225 Difference]: With dead ends: 38 [2018-01-29 22:36:55,581 INFO L226 Difference]: Without dead ends: 37 [2018-01-29 22:36:55,581 INFO L553 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-29 22:36:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-29 22:36:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-29 22:36:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-29 22:36:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-01-29 22:36:55,586 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 13 [2018-01-29 22:36:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:55,586 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-01-29 22:36:55,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:36:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-01-29 22:36:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-29 22:36:55,587 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:55,587 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:55,587 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:55,588 INFO L82 PathProgramCache]: Analyzing trace with hash -915444664, now seen corresponding path program 1 times [2018-01-29 22:36:55,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:55,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:55,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:55,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:55,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:55,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:55,648 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-29 22:36:55,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:55,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:36:55,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:36:55,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:36:55,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:36:55,649 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 6 states. [2018-01-29 22:36:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:55,773 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-29 22:36:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:36:55,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-29 22:36:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:55,775 INFO L225 Difference]: With dead ends: 41 [2018-01-29 22:36:55,775 INFO L226 Difference]: Without dead ends: 40 [2018-01-29 22:36:55,776 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:36:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-29 22:36:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-29 22:36:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-29 22:36:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-01-29 22:36:55,782 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 18 [2018-01-29 22:36:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:55,783 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-01-29 22:36:55,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:36:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-01-29 22:36:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-29 22:36:55,784 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:55,784 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:55,784 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:55,784 INFO L82 PathProgramCache]: Analyzing trace with hash -915444663, now seen corresponding path program 1 times [2018-01-29 22:36:55,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:55,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:55,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:55,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:55,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:55,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:56,029 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-29 22:36:56,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:56,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:36:56,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:36:56,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:36:56,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:36:56,030 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 9 states. [2018-01-29 22:36:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:56,165 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-29 22:36:56,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:36:56,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-29 22:36:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:56,170 INFO L225 Difference]: With dead ends: 48 [2018-01-29 22:36:56,171 INFO L226 Difference]: Without dead ends: 47 [2018-01-29 22:36:56,171 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-29 22:36:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-29 22:36:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-01-29 22:36:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-29 22:36:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-01-29 22:36:56,177 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 18 [2018-01-29 22:36:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:56,177 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-01-29 22:36:56,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:36:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-01-29 22:36:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 22:36:56,178 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:56,178 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:56,178 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 869431728, now seen corresponding path program 1 times [2018-01-29 22:36:56,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:56,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:56,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:56,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:56,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:56,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:36:56,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:56,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:36:56,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:36:56,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:36:56,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:36:56,260 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 7 states. [2018-01-29 22:36:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:56,334 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-01-29 22:36:56,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:36:56,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-29 22:36:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:56,336 INFO L225 Difference]: With dead ends: 39 [2018-01-29 22:36:56,336 INFO L226 Difference]: Without dead ends: 38 [2018-01-29 22:36:56,336 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:36:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-29 22:36:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-29 22:36:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-29 22:36:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-29 22:36:56,342 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 25 [2018-01-29 22:36:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:56,343 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-29 22:36:56,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:36:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-29 22:36:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 22:36:56,344 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:56,344 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:56,344 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash 869431729, now seen corresponding path program 1 times [2018-01-29 22:36:56,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:56,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:56,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:56,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:56,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:56,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:56,575 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-29 22:36:56,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:56,576 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-29 22:36:56,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:56,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:56,688 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-29 22:36:56,691 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-29 22:36:56,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:56,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:56,700 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-29 22:36:56,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:36:56,948 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-29 22:36:56,953 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-29 22:36:56,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:36:56,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:56,965 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-29 22:36:56,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-01-29 22:36:57,077 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-29 22:36:57,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:57,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-29 22:36:57,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 22:36:57,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 22:36:57,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-01-29 22:36:57,101 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 22 states. [2018-01-29 22:36:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:57,802 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-01-29 22:36:57,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 22:36:57,802 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-01-29 22:36:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:57,803 INFO L225 Difference]: With dead ends: 58 [2018-01-29 22:36:57,803 INFO L226 Difference]: Without dead ends: 57 [2018-01-29 22:36:57,804 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 22:36:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-29 22:36:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2018-01-29 22:36:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-29 22:36:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-29 22:36:57,811 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 25 [2018-01-29 22:36:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:57,811 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-29 22:36:57,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 22:36:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-29 22:36:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-29 22:36:57,813 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:57,814 INFO L350 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:57,814 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash -454468650, now seen corresponding path program 1 times [2018-01-29 22:36:57,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:57,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:57,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:57,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:57,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:57,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:57,888 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-29 22:36:57,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:57,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:36:57,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:36:57,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:36:57,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:36:57,890 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 4 states. [2018-01-29 22:36:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:57,941 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-01-29 22:36:57,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:36:57,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-29 22:36:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:57,942 INFO L225 Difference]: With dead ends: 45 [2018-01-29 22:36:57,942 INFO L226 Difference]: Without dead ends: 34 [2018-01-29 22:36:57,942 INFO L553 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-29 22:36:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-29 22:36:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-29 22:36:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-29 22:36:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-29 22:36:57,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2018-01-29 22:36:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:57,948 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-29 22:36:57,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:36:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-29 22:36:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 22:36:57,948 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:57,949 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:57,949 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2033121463, now seen corresponding path program 2 times [2018-01-29 22:36:57,949 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:57,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:57,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:57,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:57,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:57,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:58,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:58,314 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:36:58,319 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:36:58,330 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:58,334 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:58,336 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:36:58,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:58,343 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-29 22:36:58,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:58,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:58,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:36:58,387 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-29 22:36:58,388 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-29 22:36:58,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:58,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:58,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:58,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-29 22:36:58,580 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-29 22:36:58,598 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-29 22:36:58,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:36:58,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:58,635 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-29 22:36:58,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-29 22:36:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:58,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:58,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-29 22:36:58,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 22:36:58,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 22:36:58,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-01-29 22:36:58,754 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 25 states. [2018-01-29 22:36:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:59,817 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-01-29 22:36:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 22:36:59,817 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-01-29 22:36:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:59,817 INFO L225 Difference]: With dead ends: 39 [2018-01-29 22:36:59,817 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:36:59,818 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 22:36:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:36:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:36:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:36:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:36:59,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-29 22:36:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:59,819 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:36:59,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 22:36:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:36:59,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:36:59,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:37:00,146 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 100 DAG size of output 72 [2018-01-29 22:37:00,149 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 555) no Hoare annotation was computed. [2018-01-29 22:37:00,149 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-29 22:37:00,150 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:37:00,150 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-29 22:37:00,150 INFO L402 ceAbstractionStarter]: At program point cstrlenENTRY(lines 540 546) the Hoare annotation is: true [2018-01-29 22:37:00,150 INFO L399 ceAbstractionStarter]: For program point cstrlenErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-29 22:37:00,150 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-29 22:37:00,150 INFO L399 ceAbstractionStarter]: For program point cstrlenEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-29 22:37:00,150 INFO L399 ceAbstractionStarter]: For program point L543''''(line 543) no Hoare annotation was computed. [2018-01-29 22:37:00,150 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 22:37:00,150 INFO L399 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-29 22:37:00,151 INFO L395 ceAbstractionStarter]: At program point L543'''''(lines 543 544) the Hoare annotation is: (let ((.cse4 (select |#length| cstrlen_~p~2.base)) (.cse0 (= 1 (select |#valid| cstrlen_~p~2.base))) (.cse1 (= 1 (select |#valid| cstrlen_~s.base))) (.cse2 (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (= (select (select |#memory_int| cstrlen_~s.base) (+ (select |#length| cstrlen_~s.base) v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 cstrlen_~s.offset) (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_2)))) (.cse3 (<= 1 (select |#length| cstrlen_~s.base))) (.cse5 (= 0 cstrlen_~s.offset))) (or (and (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 0) (= (select (select |#memory_int| cstrlen_~p~2.base) (+ (select |#length| cstrlen_~p~2.base) v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= (+ v_main_~nondetString1~3.offset_BEFORE_CALL_2 1) cstrlen_~p~2.offset) (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_2))) .cse0 .cse1 .cse2 .cse3 (<= (+ cstrlen_~p~2.offset 1) .cse4) .cse5) (not (exists ((main_~length1~3 Int)) (and (<= (+ main_~length1~3 |cstrlen_#in~s.offset|) (select |#length| |cstrlen_#in~s.base|)) (<= 1 main_~length1~3) (= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) (+ main_~length1~3 |cstrlen_#in~s.offset| (- 1))))))) (not (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (= (select (select |#memory_int| |cstrlen_#in~s.base|) (+ (select |#length| |cstrlen_#in~s.base|) v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 |cstrlen_#in~s.offset|) (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_2)))) (not (= (select |#valid| |cstrlen_#in~s.base|) 1)) (not (= 0 |cstrlen_#in~s.offset|)) (and (<= 1 .cse4) .cse0 .cse1 .cse2 .cse3 (= cstrlen_~p~2.offset 0) .cse5 (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 0) (= (select (select |#memory_int| cstrlen_~p~2.base) (+ (select |#length| cstrlen_~p~2.base) v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 cstrlen_~p~2.offset) (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_2)))))) [2018-01-29 22:37:00,151 INFO L399 ceAbstractionStarter]: For program point cstrlenErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-29 22:37:00,151 INFO L399 ceAbstractionStarter]: For program point L543''''''(lines 543 544) no Hoare annotation was computed. [2018-01-29 22:37:00,151 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-29 22:37:00,151 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-29 22:37:00,151 INFO L399 ceAbstractionStarter]: For program point cstrlenFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-29 22:37:00,151 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-29 22:37:00,151 INFO L399 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-29 22:37:00,151 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-29 22:37:00,151 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-29 22:37:00,151 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-29 22:37:00,151 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L395 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|)) (= (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|) (= (store |#valid| |main_#t~malloc3.base| (select (store |#valid| |main_#t~malloc3.base| 0) |main_#t~malloc3.base|)) |old(#valid)|) (= 0 main_~nondetString1~3.offset) (<= 1 main_~length1~3) (= main_~length1~3 (select |#length| |main_#t~malloc3.base|)))) [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 547 555) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 555) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-29 22:37:00,152 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-29 22:37:00,153 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 547 555) no Hoare annotation was computed. [2018-01-29 22:37:00,153 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 547 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:37:00,153 INFO L399 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-29 22:37:00,153 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-29 22:37:00,153 INFO L399 ceAbstractionStarter]: For program point L554''(line 554) no Hoare annotation was computed. [2018-01-29 22:37:00,153 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-29 22:37:00,153 INFO L399 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-29 22:37:00,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-29 22:37:00,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-29 22:37:00,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,165 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,165 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,165 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,166 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,166 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,166 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,166 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,167 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,167 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,167 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,167 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,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-29 22:37:00,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:37:00 BoogieIcfgContainer [2018-01-29 22:37:00,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:37:00,195 INFO L168 Benchmark]: Toolchain (without parser) took 5856.81 ms. Allocated memory was 306.7 MB in the beginning and 537.9 MB in the end (delta: 231.2 MB). Free memory was 266.7 MB in the beginning and 402.3 MB in the end (delta: -135.5 MB). Peak memory consumption was 95.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:37:00,197 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:37:00,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.19 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-29 22:37:00,198 INFO L168 Benchmark]: Boogie Preprocessor took 34.13 ms. Allocated memory is still 306.7 MB. Free memory was 255.7 MB in the beginning and 254.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-29 22:37:00,198 INFO L168 Benchmark]: RCFGBuilder took 232.67 ms. Allocated memory is still 306.7 MB. Free memory was 254.7 MB in the beginning and 239.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:37:00,198 INFO L168 Benchmark]: TraceAbstraction took 5375.26 ms. Allocated memory was 306.7 MB in the beginning and 537.9 MB in the end (delta: 231.2 MB). Free memory was 239.0 MB in the beginning and 402.3 MB in the end (delta: -163.3 MB). Peak memory consumption was 67.9 MB. Max. memory is 5.3 GB. [2018-01-29 22:37:00,200 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.20 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.19 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.13 ms. Allocated memory is still 306.7 MB. Free memory was 255.7 MB in the beginning and 254.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 232.67 ms. Allocated memory is still 306.7 MB. Free memory was 254.7 MB in the beginning and 239.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5375.26 ms. Allocated memory was 306.7 MB in the beginning and 537.9 MB in the end (delta: 231.2 MB). Free memory was 239.0 MB in the beginning and 402.3 MB in the end (delta: -163.3 MB). Peak memory consumption was 67.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_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[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[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[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[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[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[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[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[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[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[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[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[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[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[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[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[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[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[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[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[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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-29 22:37:00,208 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,219 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,220 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,220 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,220 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,221 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,221 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,221 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,221 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,221 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,222 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,222 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-29 22:37:00,222 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,222 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,223 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,223 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,223 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,223 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,225 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:37:00,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:37:00,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:37:00,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((\exists v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= 0 && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_2 + 1 <= p) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_2) && 1 == \valid[p]) && 1 == \valid[s]) && (\exists v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0 && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= s) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_2)) && 1 <= unknown-#length-unknown[s]) && p + 1 <= unknown-#length-unknown[p]) && 0 == s) || !(\exists main_~length1~3 : int :: (main_~length1~3 + s <= unknown-#length-unknown[s] && 1 <= main_~length1~3) && 0 == unknown-#memory_int-unknown[s][main_~length1~3 + s + -1])) || !(\exists v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0 && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= s) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_2)) || !(\valid[s] == 1)) || !(0 == s)) || (((((((1 <= unknown-#length-unknown[p] && 1 == \valid[p]) && 1 == \valid[s]) && (\exists v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0 && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= s) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_2)) && 1 <= unknown-#length-unknown[s]) && p == 0) && 0 == s) && (\exists v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= 0 && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= p) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 5 error locations. SAFE Result, 5.2s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 241 SDtfs, 525 SDslu, 987 SDs, 0 SdLazy, 689 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 9 NumberOfFragments, 267 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 513 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 220 ConstructedInterpolants, 16 QuantifiedInterpolants, 41687 SizeOfPredicates, 29 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 4/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-37-00-235.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-37-00-235.csv Received shutdown request...