java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:21:48,069 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:21:48,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:21:48,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:21:48,086 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:21:48,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:21:48,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:21:48,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:21:48,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:21:48,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:21:48,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:21:48,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:21:48,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:21:48,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:21:48,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:21:48,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:21:48,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:21:48,106 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:21:48,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:21:48,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:21:48,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:21:48,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:21:48,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:21:48,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:21:48,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:21:48,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:21:48,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:21:48,115 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:21:48,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:21:48,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:21:48,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:21:48,117 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:21:48,125 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:21:48,126 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:21:48,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:21:48,127 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:21:48,127 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:21:48,127 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:21:48,127 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:21:48,127 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:21:48,128 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:21:48,128 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:21:48,128 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:21:48,128 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:21:48,128 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:21:48,128 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:21:48,128 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:21:48,129 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:21:48,129 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:21:48,129 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:21:48,129 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:21:48,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:21:48,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:21:48,129 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:21:48,130 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:21:48,130 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:21:48,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:21:48,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:21:48,131 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:21:48,131 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:21:48,131 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:21:48,131 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:21:48,131 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:21:48,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:21:48,131 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:21:48,131 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:21:48,132 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:21:48,132 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:21:48,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:21:48,177 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:21:48,181 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:21:48,182 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:21:48,183 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:21:48,183 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-25 05:21:48,341 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:21:48,347 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:21:48,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:21:48,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:21:48,353 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:21:48,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:21:48" (1/1) ... [2018-01-25 05:21:48,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5054e5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48, skipping insertion in model container [2018-01-25 05:21:48,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:21:48" (1/1) ... [2018-01-25 05:21:48,373 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:21:48,413 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:21:48,523 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:21:48,538 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:21:48,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48 WrapperNode [2018-01-25 05:21:48,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:21:48,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:21:48,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:21:48,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:21:48,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48" (1/1) ... [2018-01-25 05:21:48,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48" (1/1) ... [2018-01-25 05:21:48,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48" (1/1) ... [2018-01-25 05:21:48,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48" (1/1) ... [2018-01-25 05:21:48,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48" (1/1) ... [2018-01-25 05:21:48,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48" (1/1) ... [2018-01-25 05:21:48,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48" (1/1) ... [2018-01-25 05:21:48,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:21:48,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:21:48,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:21:48,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:21:48,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:21:48,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:21:48,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:21:48,629 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-25 05:21:48,629 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:21:48,629 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:21:48,629 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:21:48,630 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:21:48,630 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:21:48,630 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:21:48,630 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:21:48,630 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-25 05:21:48,630 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:21:48,630 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:21:48,630 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:21:48,794 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:21:48,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:21:48 BoogieIcfgContainer [2018-01-25 05:21:48,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:21:48,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:21:48,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:21:48,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:21:48,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:21:48" (1/3) ... [2018-01-25 05:21:48,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263e9999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:21:48, skipping insertion in model container [2018-01-25 05:21:48,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:48" (2/3) ... [2018-01-25 05:21:48,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263e9999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:21:48, skipping insertion in model container [2018-01-25 05:21:48,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:21:48" (3/3) ... [2018-01-25 05:21:48,800 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:21:48,807 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:21:48,813 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-25 05:21:48,862 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:21:48,862 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:21:48,862 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:21:48,862 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:21:48,863 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:21:48,863 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:21:48,863 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:21:48,863 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:21:48,864 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:21:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-25 05:21:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:21:48,892 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:48,893 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:48,893 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-01-25 05:21:48,901 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:48,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:48,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:48,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:48,959 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:49,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:49,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:49,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:21:49,103 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:49,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:21:49,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:21:49,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:21:49,119 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-01-25 05:21:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:49,273 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-25 05:21:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:21:49,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-25 05:21:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:49,285 INFO L225 Difference]: With dead ends: 41 [2018-01-25 05:21:49,285 INFO L226 Difference]: Without dead ends: 26 [2018-01-25 05:21:49,287 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:21:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-25 05:21:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-25 05:21:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-25 05:21:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-25 05:21:49,316 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-01-25 05:21:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:49,316 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-25 05:21:49,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:21:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-25 05:21:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:21:49,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:49,318 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:49,318 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-01-25 05:21:49,318 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:49,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:49,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:49,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:49,320 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:49,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:49,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:49,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:21:49,460 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:49,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:21:49,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:21:49,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:21:49,463 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-25 05:21:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:49,543 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-01-25 05:21:49,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:21:49,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-25 05:21:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:49,544 INFO L225 Difference]: With dead ends: 26 [2018-01-25 05:21:49,544 INFO L226 Difference]: Without dead ends: 25 [2018-01-25 05:21:49,545 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:21:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-25 05:21:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-25 05:21:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-25 05:21:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-25 05:21:49,549 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-01-25 05:21:49,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:49,549 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-25 05:21:49,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:21:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-25 05:21:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:21:49,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:49,550 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:49,550 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:49,550 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-01-25 05:21:49,550 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:49,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:49,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:49,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:49,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:49,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:49,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:49,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:21:49,610 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:49,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:21:49,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:21:49,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:21:49,611 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-01-25 05:21:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:49,686 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-01-25 05:21:49,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:21:49,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:21:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:49,687 INFO L225 Difference]: With dead ends: 25 [2018-01-25 05:21:49,687 INFO L226 Difference]: Without dead ends: 24 [2018-01-25 05:21:49,688 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:21:49,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-25 05:21:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-25 05:21:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-25 05:21:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-01-25 05:21:49,692 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-01-25 05:21:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:49,693 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-01-25 05:21:49,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:21:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-01-25 05:21:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:21:49,693 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:49,693 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:49,693 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:49,694 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-01-25 05:21:49,694 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:49,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:49,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:49,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:49,695 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:49,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:49,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:49,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:21:49,842 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:49,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:21:49,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:21:49,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:21:49,843 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-01-25 05:21:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:49,959 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-01-25 05:21:49,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:21:49,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-01-25 05:21:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:49,962 INFO L225 Difference]: With dead ends: 31 [2018-01-25 05:21:49,962 INFO L226 Difference]: Without dead ends: 30 [2018-01-25 05:21:49,962 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:21:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-25 05:21:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-01-25 05:21:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-25 05:21:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-25 05:21:49,967 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-01-25 05:21:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:49,968 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-25 05:21:49,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:21:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-25 05:21:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:21:49,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:49,969 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:49,969 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-01-25 05:21:49,969 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:49,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:49,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:49,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:49,970 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:49,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:50,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:50,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:21:50,125 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:50,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:21:50,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:21:50,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:21:50,125 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-01-25 05:21:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:50,264 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-25 05:21:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:21:50,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-25 05:21:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:50,265 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:21:50,266 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 05:21:50,266 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:21:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 05:21:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-01-25 05:21:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 05:21:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-01-25 05:21:50,272 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-01-25 05:21:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:50,272 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-01-25 05:21:50,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:21:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-01-25 05:21:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:21:50,273 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:50,273 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:50,273 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-01-25 05:21:50,273 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:50,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:50,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:50,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:50,275 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:50,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:50,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:50,504 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:21:50,505 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-01-25 05:21:50,507 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [24], [29], [31], [32], [33], [42], [43], [44], [46] [2018-01-25 05:21:50,562 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:21:50,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:21:50,991 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:21:50,992 INFO L268 AbstractInterpreter]: Visited 16 different actions 20 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-25 05:21:51,006 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:21:51,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:51,007 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:21:51,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:51,019 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:21:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:51,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:51,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 05:21:51,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 05:21:51,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:21:51,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:21:51,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-25 05:21:51,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 05:21:51,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:21:51,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:51,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:51,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 05:21:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:51,354 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:51,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 05:21:51,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:21:51,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:21:51,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,694 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,710 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 05:21:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:51,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:51,746 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:21:51,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:51,754 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:21:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:51,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:51,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:21:51,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:21:51,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:21:51,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:21:51,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:51,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:21:52,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 05:21:52,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-25 05:21:52,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:21:52,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:52,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:52,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-25 05:21:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:52,122 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:52,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:21:52,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:21:52,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:52,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:52,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:52,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:21:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:52,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:21:52,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 9, 9] total 28 [2018-01-25 05:21:52,276 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:21:52,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 05:21:52,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 05:21:52,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:21:52,277 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2018-01-25 05:21:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:52,676 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-25 05:21:52,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:21:52,676 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-01-25 05:21:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:52,677 INFO L225 Difference]: With dead ends: 48 [2018-01-25 05:21:52,677 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 05:21:52,678 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 05:21:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 05:21:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-01-25 05:21:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 05:21:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-25 05:21:52,684 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-01-25 05:21:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:52,684 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-25 05:21:52,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 05:21:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-25 05:21:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:21:52,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:52,685 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:52,685 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-01-25 05:21:52,686 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:52,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:52,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:52,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:52,687 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:52,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:52,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:52,951 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:21:52,952 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:21:52,952 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:21:52,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:52,952 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:21:52,961 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:21:52,961 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:21:52,974 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:21:52,978 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:21:52,980 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:21:52,983 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:52,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:21:52,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:21:53,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:21:53,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:21:53,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-25 05:21:53,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-25 05:21:53,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:21:53,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:21:53,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:53,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:53,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-25 05:21:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:53,226 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:53,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-01-25 05:21:53,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:21:53,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-01-25 05:21:53,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:21:53,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:53,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-25 05:21:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:53,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:53,715 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:21:53,718 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:21:53,718 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:21:53,730 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:21:53,739 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:21:53,751 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:21:53,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:53,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:21:53,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:21:53,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:21:53,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-25 05:21:53,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:53,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:21:53,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 05:21:53,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:21:53,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:21:53,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:53,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:53,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-25 05:21:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:53,976 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:54,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:21:54,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:21:54,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:54,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:54,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:54,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 05:21:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:54,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:21:54,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 10, 10] total 34 [2018-01-25 05:21:54,249 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:21:54,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:21:54,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:21:54,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 05:21:54,250 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 17 states. [2018-01-25 05:21:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:54,755 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-25 05:21:54,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:21:54,755 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-01-25 05:21:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:54,756 INFO L225 Difference]: With dead ends: 47 [2018-01-25 05:21:54,756 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:21:54,757 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=1640, Unknown=0, NotChecked=0, Total=1892 [2018-01-25 05:21:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:21:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-01-25 05:21:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 05:21:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-25 05:21:54,763 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 20 [2018-01-25 05:21:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:54,763 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-25 05:21:54,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:21:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-25 05:21:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:21:54,763 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:54,763 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:54,764 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-01-25 05:21:54,764 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:54,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:54,764 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:21:54,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:54,765 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:54,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:54,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:54,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:21:54,806 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:54,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:21:54,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:21:54,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:21:54,806 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-01-25 05:21:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:54,831 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-01-25 05:21:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:21:54,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 05:21:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:54,831 INFO L225 Difference]: With dead ends: 34 [2018-01-25 05:21:54,831 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:21:54,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:21:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:21:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:21:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:21:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:21:54,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-25 05:21:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:54,832 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:21:54,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:21:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:21:54,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:21:54,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:21:55,269 WARN L146 SmtUtils]: Spent 338ms on a formula simplification. DAG size of input: 95 DAG size of output 66 [2018-01-25 05:21:55,298 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-25 05:21:55,299 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:21:55,299 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-25 05:21:55,299 INFO L404 ceAbstractionStarter]: At program point cstrlenENTRY(lines 540 546) the Hoare annotation is: true [2018-01-25 05:21:55,299 INFO L397 ceAbstractionStarter]: At program point L543'''(lines 543 544) the Hoare annotation is: (let ((.cse0 (not (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_4 Int)) (and (<= v_main_~nondetString1~3.offset_BEFORE_CALL_4 |cstrlen_#in~s.offset|) (= (select (select |#memory_int| |cstrlen_#in~s.base|) (+ (select |#length| |cstrlen_#in~s.base|) v_main_~nondetString1~3.offset_BEFORE_CALL_4 (- 1))) 0) (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_4) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_4 0))))) (.cse1 (not (= (select |#valid| |cstrlen_#in~s.base|) 1))) (.cse2 (not (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= |cstrlen_#in~s.offset| v_main_~nondetString1~3.offset_BEFORE_CALL_2) (= (select (select |#memory_int| |cstrlen_#in~s.base|) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2) (select |#length| |cstrlen_#in~s.base|)) (<= 1 main_~length1~3))))) (.cse3 (not (= 0 |cstrlen_#in~s.offset|)))) (and (or (and (= 1 (select |#valid| cstrlen_~p~2.base)) (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2) (select |#length| cstrlen_~p~2.base)) (= (select (select |#memory_int| cstrlen_~p~2.base) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= cstrlen_~p~2.offset v_main_~nondetString1~3.offset_BEFORE_CALL_2) (<= 1 main_~length1~3))) (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_4 Int)) (and (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_4) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_4 cstrlen_~p~2.offset) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_4 0) (= (select (select |#memory_int| cstrlen_~p~2.base) (+ (select |#length| cstrlen_~p~2.base) v_main_~nondetString1~3.offset_BEFORE_CALL_4 (- 1))) 0)))) .cse0 .cse1 .cse2 .cse3) (or (not (= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) |cstrlen_#in~s.offset|))) .cse0 .cse1 .cse2 .cse3 (and (= 0 (select (select |#memory_int| cstrlen_~p~2.base) cstrlen_~p~2.offset)) (= cstrlen_~p~2.offset 0))))) [2018-01-25 05:21:55,299 INFO L401 ceAbstractionStarter]: For program point cstrlenErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 05:21:55,299 INFO L401 ceAbstractionStarter]: For program point cstrlenEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-25 05:21:55,299 INFO L401 ceAbstractionStarter]: For program point L543''''(lines 543 544) no Hoare annotation was computed. [2018-01-25 05:21:55,299 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-25 05:21:55,299 INFO L401 ceAbstractionStarter]: For program point cstrlenErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 05:21:55,299 INFO L401 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-25 05:21:55,300 INFO L401 ceAbstractionStarter]: For program point cstrlenFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-25 05:21:55,300 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-25 05:21:55,300 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-25 05:21:55,300 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-25 05:21:55,300 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-25 05:21:55,300 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 05:21:55,300 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-25 05:21:55,300 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-25 05:21:55,300 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-25 05:21:55,301 INFO L397 ceAbstractionStarter]: At program point L553'(line 553) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~3.base))) (and (= main_~length1~3 .cse0) (= 1 (select |#valid| |main_#t~malloc3.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= (select (select |#memory_int| main_~nondetString1~3.base) (+ main_~nondetString1~3.offset .cse0 (- 1))) 0) (= 1 (select |#valid| main_~nondetString1~3.base)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~nondetString1~3.offset) (<= 1 main_~length1~3) (= main_~length1~3 (select |#length| |main_#t~malloc3.base|)))) [2018-01-25 05:21:55,301 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 555) no Hoare annotation was computed. [2018-01-25 05:21:55,301 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 555) no Hoare annotation was computed. [2018-01-25 05:21:55,301 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-25 05:21:55,301 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-25 05:21:55,301 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 05:21:55,301 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 555) no Hoare annotation was computed. [2018-01-25 05:21:55,301 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:21:55,302 INFO L401 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-25 05:21:55,302 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-25 05:21:55,309 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,310 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,317 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,318 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,318 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,318 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,336 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,336 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:21:55 BoogieIcfgContainer [2018-01-25 05:21:55,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:21:55,339 INFO L168 Benchmark]: Toolchain (without parser) took 6997.44 ms. Allocated memory was 301.5 MB in the beginning and 539.0 MB in the end (delta: 237.5 MB). Free memory was 261.5 MB in the beginning and 340.2 MB in the end (delta: -78.7 MB). Peak memory consumption was 158.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:21:55,341 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:21:55,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.57 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:21:55,341 INFO L168 Benchmark]: Boogie Preprocessor took 33.86 ms. Allocated memory is still 301.5 MB. Free memory was 250.5 MB in the beginning and 249.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 05:21:55,342 INFO L168 Benchmark]: RCFGBuilder took 215.83 ms. Allocated memory is still 301.5 MB. Free memory was 249.5 MB in the beginning and 234.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:21:55,342 INFO L168 Benchmark]: TraceAbstraction took 6543.59 ms. Allocated memory was 301.5 MB in the beginning and 539.0 MB in the end (delta: 237.5 MB). Free memory was 234.8 MB in the beginning and 340.2 MB in the end (delta: -105.5 MB). Peak memory consumption was 132.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:21:55,345 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 196.57 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.86 ms. Allocated memory is still 301.5 MB. Free memory was 250.5 MB in the beginning and 249.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 215.83 ms. Allocated memory is still 301.5 MB. Free memory was 249.5 MB in the beginning and 234.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6543.59 ms. Allocated memory was 301.5 MB in the beginning and 539.0 MB in the end (delta: 237.5 MB). Free memory was 234.8 MB in the beginning and 340.2 MB in the end (delta: -105.5 MB). Peak memory consumption was 132.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 109 LocStat_NO_SUPPORTING_DISEQUALITIES : 11 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 37 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.792587 RENAME_VARIABLES(MILLISECONDS) : 0.462330 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.727062 PROJECTAWAY(MILLISECONDS) : 1.392199 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.141731 DISJOIN(MILLISECONDS) : 0.392475 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.507075 ADD_EQUALITY(MILLISECONDS) : 0.040630 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.028756 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 60 #UNFREEZE : 0 #CONJOIN : 67 #PROJECTAWAY : 54 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 57 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-25 05:21:55,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,368 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,368 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,368 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,368 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,369 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,369 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,369 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,369 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,369 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:21:55,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:21:55,374 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-25 05:21:55,374 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,374 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,374 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,375 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,375 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,375 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,375 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,376 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,376 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,376 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,376 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,376 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:55,377 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:55,377 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((1 == \valid[p] && (\exists main_~length1~3 : int, v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[p] && unknown-#memory_int-unknown[p][main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && p <= v_main_~nondetString1~3.offset_BEFORE_CALL_2) && 1 <= main_~length1~3)) && (\exists v_main_~nondetString1~3.offset_BEFORE_CALL_4 : int :: ((0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_4 && v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= p) && v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= 0) && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~3.offset_BEFORE_CALL_4 + -1] == 0)) || !(\exists v_main_~nondetString1~3.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= s && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_4 + -1] == 0) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_4) && v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= 0)) || !(\valid[s] == 1)) || !(\exists main_~length1~3 : int, v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((s <= v_main_~nondetString1~3.offset_BEFORE_CALL_2 && unknown-#memory_int-unknown[s][main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s]) && 1 <= main_~length1~3)) || !(0 == s)) && (((((!(0 == unknown-#memory_int-unknown[s][s]) || !(\exists v_main_~nondetString1~3.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= s && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_4 + -1] == 0) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_4) && v_main_~nondetString1~3.offset_BEFORE_CALL_4 <= 0)) || !(\valid[s] == 1)) || !(\exists main_~length1~3 : int, v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((s <= v_main_~nondetString1~3.offset_BEFORE_CALL_2 && unknown-#memory_int-unknown[s][main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s]) && 1 <= main_~length1~3)) || !(0 == s)) || (0 == unknown-#memory_int-unknown[p][p] && p == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 6.4s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 238 SDslu, 534 SDs, 0 SdLazy, 531 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 253 HoareAnnotationTreeSize, 9 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 739 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 256 ConstructedInterpolants, 22 QuantifiedInterpolants, 42768 SizeOfPredicates, 42 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 6/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-21-55-381.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-21-55-381.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-21-55-381.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-21-55-381.csv Received shutdown request...