java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:52:35,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:52:35,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:52:35,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:52:35,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:52:35,656 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:52:35,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:52:35,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:52:35,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:52:35,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:52:35,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:52:35,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:52:35,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:52:35,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:52:35,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:52:35,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:52:35,668 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:52:35,670 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:52:35,671 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:52:35,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:52:35,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:52:35,675 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:52:35,675 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:52:35,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:52:35,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:52:35,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:52:35,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:52:35,679 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:52:35,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:52:35,679 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:52:35,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:52:35,680 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:52:35,689 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:52:35,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:52:35,690 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:52:35,691 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:52:35,691 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:52:35,691 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:52:35,691 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:52:35,691 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:52:35,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:52:35,692 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:52:35,692 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:52:35,693 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:52:35,693 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:52:35,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:52:35,693 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:52:35,693 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:52:35,694 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:52:35,694 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:52:35,694 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:52:35,694 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:52:35,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:52:35,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:52:35,695 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:52:35,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:52:35,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:52:35,695 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:52:35,696 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:52:35,696 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:52:35,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:52:35,696 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:52:35,696 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:52:35,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:52:35,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:52:35,697 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:52:35,698 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:52:35,698 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:52:35,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:52:35,742 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:52:35,746 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:52:35,748 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:52:35,748 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:52:35,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:52:35,891 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:52:35,895 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:52:35,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:52:35,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:52:35,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:52:35,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:52:35" (1/1) ... [2018-01-24 16:52:35,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12158f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:35, skipping insertion in model container [2018-01-24 16:52:35,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:52:35" (1/1) ... [2018-01-24 16:52:35,920 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:52:35,960 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:52:36,071 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:52:36,084 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:52:36,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36 WrapperNode [2018-01-24 16:52:36,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:52:36,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:52:36,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:52:36,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:52:36,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36" (1/1) ... [2018-01-24 16:52:36,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36" (1/1) ... [2018-01-24 16:52:36,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36" (1/1) ... [2018-01-24 16:52:36,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36" (1/1) ... [2018-01-24 16:52:36,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36" (1/1) ... [2018-01-24 16:52:36,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36" (1/1) ... [2018-01-24 16:52:36,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36" (1/1) ... [2018-01-24 16:52:36,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:52:36,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:52:36,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:52:36,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:52:36,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:52:36,187 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:52:36,187 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:52:36,187 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-01-24 16:52:36,187 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:52:36,187 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:52:36,187 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:52:36,188 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:52:36,188 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:52:36,188 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:52:36,188 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:52:36,188 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-01-24 16:52:36,188 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:52:36,188 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:52:36,188 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:52:36,385 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:52:36,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:52:36 BoogieIcfgContainer [2018-01-24 16:52:36,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:52:36,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:52:36,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:52:36,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:52:36,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:52:35" (1/3) ... [2018-01-24 16:52:36,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d53bd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:52:36, skipping insertion in model container [2018-01-24 16:52:36,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:36" (2/3) ... [2018-01-24 16:52:36,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d53bd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:52:36, skipping insertion in model container [2018-01-24 16:52:36,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:52:36" (3/3) ... [2018-01-24 16:52:36,392 INFO L105 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:52:36,398 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:52:36,403 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 16:52:36,444 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:52:36,444 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:52:36,444 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:52:36,444 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:52:36,444 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:52:36,445 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:52:36,445 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:52:36,445 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:52:36,445 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:52:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 16:52:36,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 16:52:36,464 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:36,465 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:36,465 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:52:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390414, now seen corresponding path program 1 times [2018-01-24 16:52:36,474 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:36,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:36,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:36,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:36,516 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:36,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:36,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:36,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:52:36,626 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:36,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:52:36,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:52:36,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:52:36,641 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 16:52:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:36,821 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-24 16:52:36,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:52:36,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 16:52:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:36,830 INFO L225 Difference]: With dead ends: 51 [2018-01-24 16:52:36,830 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 16:52:36,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 16:52:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 16:52:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 16:52:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 16:52:36,858 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-01-24 16:52:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:36,858 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 16:52:36,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:52:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 16:52:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 16:52:36,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:36,859 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:36,859 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:52:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390413, now seen corresponding path program 1 times [2018-01-24 16:52:36,859 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:36,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:36,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:36,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:36,861 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:36,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:36,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:36,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:52:36,981 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:36,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:52:36,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:52:36,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:36,983 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 16:52:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:37,120 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 16:52:37,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:52:37,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 16:52:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:37,158 INFO L225 Difference]: With dead ends: 36 [2018-01-24 16:52:37,158 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 16:52:37,159 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 16:52:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 16:52:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 16:52:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 16:52:37,165 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 10 [2018-01-24 16:52:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:37,166 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 16:52:37,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:52:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 16:52:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:52:37,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:37,167 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:37,167 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:52:37,167 INFO L82 PathProgramCache]: Analyzing trace with hash -104566583, now seen corresponding path program 1 times [2018-01-24 16:52:37,167 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:37,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:37,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:37,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:37,169 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:37,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:37,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:37,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:52:37,235 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:37,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:52:37,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:52:37,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:37,236 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 16:52:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:37,315 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 16:52:37,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:52:37,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 16:52:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:37,316 INFO L225 Difference]: With dead ends: 35 [2018-01-24 16:52:37,316 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 16:52:37,317 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 16:52:37,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 16:52:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 16:52:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-24 16:52:37,320 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-01-24 16:52:37,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:37,321 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-24 16:52:37,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:52:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-24 16:52:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:52:37,321 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:37,321 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:37,321 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:52:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash -104566582, now seen corresponding path program 1 times [2018-01-24 16:52:37,322 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:37,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:37,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:37,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:37,323 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:37,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:37,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:37,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:52:37,434 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:37,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:52:37,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:52:37,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:52:37,435 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-01-24 16:52:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:37,553 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-24 16:52:37,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:52:37,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 16:52:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:37,557 INFO L225 Difference]: With dead ends: 46 [2018-01-24 16:52:37,557 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 16:52:37,557 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:52:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 16:52:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-01-24 16:52:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 16:52:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-01-24 16:52:37,563 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-01-24 16:52:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:37,563 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-01-24 16:52:37,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:52:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-01-24 16:52:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:52:37,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:37,565 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:37,565 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:52:37,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1089103921, now seen corresponding path program 1 times [2018-01-24 16:52:37,565 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:37,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:37,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:37,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:37,567 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:37,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:37,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:37,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:52:37,745 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:37,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:52:37,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:52:37,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:52:37,746 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-01-24 16:52:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:37,838 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-01-24 16:52:37,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:52:37,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 16:52:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:37,839 INFO L225 Difference]: With dead ends: 77 [2018-01-24 16:52:37,839 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 16:52:37,839 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:52:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 16:52:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-01-24 16:52:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:52:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 16:52:37,845 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2018-01-24 16:52:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:37,845 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 16:52:37,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:52:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 16:52:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:52:37,846 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:37,846 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:37,846 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:52:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1925999697, now seen corresponding path program 1 times [2018-01-24 16:52:37,846 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:37,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:37,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:37,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:37,847 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:37,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:38,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:38,053 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:52:38,054 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-24 16:52:38,056 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [16], [27], [29], [38], [43], [45], [46], [47], [50], [57], [58], [59], [61] [2018-01-24 16:52:38,105 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:52:38,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:52:38,282 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:52:38,283 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-24 16:52:38,312 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:52:38,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:38,313 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:52:38,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:38,322 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:52:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:38,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:52:38,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 16:52:38,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 16:52:38,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:38,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:38,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:52:38,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:52:38,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 16:52:38,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 16:52:38,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:38,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:38,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:38,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 16:52:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:38,723 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:52:38,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 16:52:38,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:38,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:52:38,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:52:38,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:38,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:38,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:38,920 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 16:52:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:38,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:38,955 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:52:38,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:38,961 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:52:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:38,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:52:38,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:52:38,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:39,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:39,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:52:39,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:52:39,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:52:39,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:39,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:39,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:39,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:52:39,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:52:39,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-24 16:52:39,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:39,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:39,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:39,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 16:52:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:39,246 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:52:39,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:52:39,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:52:39,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:39,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:39,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:39,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:52:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:39,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:52:39,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 10, 10] total 31 [2018-01-24 16:52:39,359 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:52:39,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 16:52:39,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 16:52:39,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2018-01-24 16:52:39,360 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 16 states. [2018-01-24 16:52:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:40,922 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-01-24 16:52:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 16:52:40,922 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-01-24 16:52:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:40,924 INFO L225 Difference]: With dead ends: 111 [2018-01-24 16:52:40,924 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 16:52:40,925 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 16:52:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 16:52:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 58. [2018-01-24 16:52:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 16:52:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-01-24 16:52:40,937 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 21 [2018-01-24 16:52:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:40,937 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-01-24 16:52:40,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 16:52:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-01-24 16:52:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:52:40,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:40,938 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, 1] [2018-01-24 16:52:40,938 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:52:40,938 INFO L82 PathProgramCache]: Analyzing trace with hash 292485851, now seen corresponding path program 1 times [2018-01-24 16:52:40,938 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:40,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:40,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:40,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:40,939 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:40,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:41,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:41,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:52:41,017 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:41,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:52:41,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:52:41,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:52:41,017 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 4 states. [2018-01-24 16:52:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:41,103 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-24 16:52:41,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:52:41,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-24 16:52:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:41,103 INFO L225 Difference]: With dead ends: 58 [2018-01-24 16:52:41,104 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 16:52:41,104 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 16:52:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 16:52:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 16:52:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 16:52:41,110 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2018-01-24 16:52:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:41,111 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 16:52:41,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:52:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 16:52:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:52:41,112 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:41,112 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:41,112 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:52:41,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1201761770, now seen corresponding path program 2 times [2018-01-24 16:52:41,112 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:41,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:41,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:41,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:41,113 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:41,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:41,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:41,364 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:52:41,364 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:52:41,365 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:52:41,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:41,365 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:52:41,371 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:52:41,371 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:52:41,382 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:52:41,387 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:52:41,389 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:52:41,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:52:41,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:52:41,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:41,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:41,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:52:41,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:52:41,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:52:41,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:41,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:41,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:41,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 16:52:41,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 16:52:41,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:52:41,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:41,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:41,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:41,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 16:52:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:41,641 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:52:41,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-01-24 16:52:41,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:52:41,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:41,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:41,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-01-24 16:52:41,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:52:41,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:41,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:42,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:42,004 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 16:52:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:42,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:42,116 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:52:42,118 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:52:42,119 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:52:42,133 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:52:42,153 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:52:42,169 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:52:42,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:52:42,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:52:42,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:42,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:42,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:52:42,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:52:42,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:52:42,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:42,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:42,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:42,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:52:42,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 16:52:42,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:52:42,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:42,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:42,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:42,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-24 16:52:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:42,343 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:52:42,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:52:42,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:52:42,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:42,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:42,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:42,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 16:52:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:42,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:52:42,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 34 [2018-01-24 16:52:42,606 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:52:42,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 16:52:42,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 16:52:42,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 16:52:42,607 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 18 states. [2018-01-24 16:52:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:43,300 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-01-24 16:52:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 16:52:43,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-24 16:52:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:43,301 INFO L225 Difference]: With dead ends: 78 [2018-01-24 16:52:43,301 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 16:52:43,302 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=329, Invalid=2023, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 16:52:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 16:52:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-01-24 16:52:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 16:52:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 16:52:43,310 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 27 [2018-01-24 16:52:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:43,310 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 16:52:43,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 16:52:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 16:52:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 16:52:43,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:43,311 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:43,312 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:52:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2006324798, now seen corresponding path program 1 times [2018-01-24 16:52:43,312 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:43,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:43,313 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:52:43,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:43,313 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:43,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:43,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:43,523 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:52:43,524 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 16:52:43,524 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [16], [21], [22], [25], [27], [29], [38], [43], [45], [46], [47], [50], [57], [58], [59], [61] [2018-01-24 16:52:43,525 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:52:43,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:52:43,680 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:52:43,680 INFO L268 AbstractInterpreter]: Visited 23 different actions 54 times. Merged at 10 different actions 27 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 26 variables. [2018-01-24 16:52:43,688 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:52:43,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:43,688 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:52:43,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:43,701 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:52:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:43,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:52:43,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:52:43,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:43,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:43,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:52:43,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:52:43,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 16:52:43,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:43,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:43,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:43,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 16:52:43,850 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 23 treesize of output 18 [2018-01-24 16:52:43,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 16:52:43,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:43,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:43,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:43,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-01-24 16:52:43,984 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 29 treesize of output 25 [2018-01-24 16:52:44,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:52:44,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:34 [2018-01-24 16:52:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:44,102 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:52:44,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:52:44,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:52:44,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:44,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:44,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 16:52:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:44,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:44,499 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:52:44,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:44,502 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:52:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:44,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:52:44,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:52:44,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:44,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:44,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:52:44,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:52:44,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:52:44,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:44,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:44,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:44,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:52:44,616 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 23 treesize of output 18 [2018-01-24 16:52:44,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 30 [2018-01-24 16:52:44,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-01-24 16:52:44,758 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-24 16:52:44,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:44,765 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 32 treesize of output 26 [2018-01-24 16:52:44,771 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 26 treesize of output 16 [2018-01-24 16:52:44,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:44,788 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:63, output treesize:34 [2018-01-24 16:52:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:44,794 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:52:45,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:52:45,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:52:45,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:45,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:45,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:45,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 16:52:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:45,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:52:45,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12, 12, 12] total 42 [2018-01-24 16:52:45,120 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:52:45,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 16:52:45,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 16:52:45,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1588, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 16:52:45,121 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 21 states. [2018-01-24 16:52:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:45,654 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 16:52:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:52:45,654 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-01-24 16:52:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:45,654 INFO L225 Difference]: With dead ends: 48 [2018-01-24 16:52:45,654 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 16:52:45,655 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 99 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=568, Invalid=2624, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 16:52:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 16:52:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 16:52:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 16:52:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 16:52:45,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-24 16:52:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:45,656 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 16:52:45,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 16:52:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 16:52:45,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 16:52:45,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 16:52:45,704 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:52:46,159 WARN L146 SmtUtils]: Spent 408ms on a formula simplification. DAG size of input: 130 DAG size of output 72 [2018-01-24 16:52:46,268 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,268 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:52:46,268 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,268 INFO L397 ceAbstractionStarter]: At program point cstrreplaceENTRY(lines 540 552) the Hoare annotation is: (let ((.cse6 (select |#length| |cstrreplace_#in~s.base|))) (let ((.cse0 (not (= 1 (select |#valid| |cstrreplace_#in~s.base|)))) (.cse1 (< .cse6 1)) (.cse3 (not (= 0 |cstrreplace_#in~s.offset|))) (.cse4 (select |#memory_int| |cstrreplace_#in~s.base|)) (.cse2 (select |old(#memory_int)| |cstrreplace_#in~s.base|))) (and (or .cse0 .cse1 (not (= (select .cse2 |cstrreplace_#in~s.offset|) 0)) .cse3 (= 0 (select .cse4 |cstrreplace_#in~s.offset|))) (let ((.cse5 (+ .cse6 (- 1)))) (or .cse0 .cse1 .cse3 (= 0 (select .cse4 .cse5)) (not (= 0 (select .cse2 .cse5)))))))) [2018-01-24 16:52:46,269 INFO L397 ceAbstractionStarter]: At program point L544'''(lines 544 550) the Hoare annotation is: (let ((.cse3 (select |#length| |cstrreplace_#in~s.base|))) (let ((.cse0 (not (= 1 (select |#valid| |cstrreplace_#in~s.base|)))) (.cse1 (< .cse3 1)) (.cse2 (select |old(#memory_int)| |cstrreplace_#in~s.base|)) (.cse5 (= 1 (select |#valid| cstrreplace_~p~2.base))) (.cse4 (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_2 Int)) (and (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2) (select |#length| cstrreplace_~p~2.base)) (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2 (- 1)))) (<= 1 main_~length1~5) (<= cstrreplace_~p~2.offset v_main_~nondetString1~5.offset_BEFORE_CALL_2))))) (and (or (< 0 |cstrreplace_#in~s.offset|) .cse0 .cse1 (< |cstrreplace_#in~s.offset| 0) (not (= 0 (select .cse2 (+ .cse3 (- 1))))) (and .cse4 (exists ((v_main_~nondetString1~5.offset_BEFORE_CALL_4 Int)) (and (<= 0 v_main_~nondetString1~5.offset_BEFORE_CALL_4) (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ (select |#length| cstrreplace_~p~2.base) v_main_~nondetString1~5.offset_BEFORE_CALL_4 (- 1)))) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_4 0) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_4 cstrreplace_~p~2.offset))) (exists ((v_main_~nondetString1~5.offset_BEFORE_CALL_4 Int)) (and (<= v_main_~nondetString1~5.offset_BEFORE_CALL_4 |cstrreplace_#in~s.offset|) (<= 0 v_main_~nondetString1~5.offset_BEFORE_CALL_4) (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) (+ (select |#length| |cstrreplace_#in~s.base|) v_main_~nondetString1~5.offset_BEFORE_CALL_4 (- 1)))) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_4 0))) .cse5)) (or .cse0 .cse1 (not (= (select .cse2 |cstrreplace_#in~s.offset|) 0)) (not (= 0 |cstrreplace_#in~s.offset|)) (and (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) cstrreplace_~p~2.offset)) .cse5 (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) |cstrreplace_#in~s.offset|)) .cse4 (= cstrreplace_~p~2.offset 0)))))) [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr2RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point L544''''(lines 544 550) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point cstrreplaceFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr5RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point L545'''(lines 545 548) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,269 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr4RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point cstrreplaceEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr3RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L397 ceAbstractionStarter]: At program point L560(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~5.base))) (and (= 1 (select |#valid| main_~nondetString1~5.base)) (= 0 |main_#t~malloc6.offset|) (= main_~length1~5 .cse0) (<= 1 main_~length1~5) (= main_~length1~5 (select |#length| |main_#t~malloc6.base|)) (= 0 (select (select |#memory_int| main_~nondetString1~5.base) (+ .cse0 (+ main_~nondetString1~5.offset (- 1))))) (= 0 main_~nondetString1~5.offset) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|))) [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-24 16:52:46,270 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-24 16:52:46,271 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 16:52:46,271 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 16:52:46,271 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 16:52:46,271 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-24 16:52:46,271 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:52:46,271 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 16:52:46,271 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 16:52:46,271 INFO L401 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-24 16:52:46,271 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-24 16:52:46,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,292 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,292 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,293 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,293 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,293 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,293 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,293 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,294 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,294 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,294 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,294 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,294 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,295 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,295 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,295 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:52:46 BoogieIcfgContainer [2018-01-24 16:52:46,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:52:46,304 INFO L168 Benchmark]: Toolchain (without parser) took 10412.74 ms. Allocated memory was 304.1 MB in the beginning and 560.5 MB in the end (delta: 256.4 MB). Free memory was 262.8 MB in the beginning and 324.0 MB in the end (delta: -61.2 MB). Peak memory consumption was 195.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:52:46,304 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:52:46,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.27 ms. Allocated memory is still 304.1 MB. Free memory was 262.8 MB in the beginning and 252.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:52:46,305 INFO L168 Benchmark]: Boogie Preprocessor took 38.59 ms. Allocated memory is still 304.1 MB. Free memory was 252.8 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:52:46,305 INFO L168 Benchmark]: RCFGBuilder took 256.58 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 233.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:52:46,306 INFO L168 Benchmark]: TraceAbstraction took 9917.09 ms. Allocated memory was 304.1 MB in the beginning and 560.5 MB in the end (delta: 256.4 MB). Free memory was 233.8 MB in the beginning and 324.0 MB in the end (delta: -90.2 MB). Peak memory consumption was 166.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:52:46,308 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.27 ms. Allocated memory is still 304.1 MB. Free memory was 262.8 MB in the beginning and 252.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.59 ms. Allocated memory is still 304.1 MB. Free memory was 252.8 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 256.58 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 233.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9917.09 ms. Allocated memory was 304.1 MB in the beginning and 560.5 MB in the end (delta: 256.4 MB). Free memory was 233.8 MB in the beginning and 324.0 MB in the end (delta: -90.2 MB). Peak memory consumption was 166.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 166 LocStat_NO_SUPPORTING_DISEQUALITIES : 24 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 46 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.637567 RENAME_VARIABLES(MILLISECONDS) : 0.466672 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.582161 PROJECTAWAY(MILLISECONDS) : 0.978839 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001510 DISJOIN(MILLISECONDS) : 0.495912 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.510310 ADD_EQUALITY(MILLISECONDS) : 0.030527 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012692 #CONJOIN_DISJUNCTIVE : 48 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 86 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 47 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 174 LocStat_NO_SUPPORTING_DISEQUALITIES : 22 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.232420 RENAME_VARIABLES(MILLISECONDS) : 0.119141 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.199389 PROJECTAWAY(MILLISECONDS) : 0.123074 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001471 DISJOIN(MILLISECONDS) : 0.420805 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.138628 ADD_EQUALITY(MILLISECONDS) : 0.030010 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013561 #CONJOIN_DISJUNCTIVE : 92 #RENAME_VARIABLES : 167 #UNFREEZE : 0 #CONJOIN : 136 #PROJECTAWAY : 116 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 11 #RENAME_VARIABLES_DISJUNCTIVE : 161 #ADD_EQUALITY : 52 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 * 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: 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: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: 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 9 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 16:52:46,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,318 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,318 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,318 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,318 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,318 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,319 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,337 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,337 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:52:46,337 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,338 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,338 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,338 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,338 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:52:46,338 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:52:46,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,341 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,341 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,341 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,342 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,342 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,342 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:52:46,342 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:52:46,342 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((0 < s || !(1 == \valid[s])) || unknown-#length-unknown[s] < 1) || s < 0) || !(0 == \old(unknown-#memory_int-unknown)[s][unknown-#length-unknown[s] + -1])) || ((((\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[p] && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1]) && 1 <= main_~length1~5) && p <= v_main_~nondetString1~5.offset_BEFORE_CALL_2) && (\exists v_main_~nondetString1~5.offset_BEFORE_CALL_4 : int :: ((0 <= v_main_~nondetString1~5.offset_BEFORE_CALL_4 && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~5.offset_BEFORE_CALL_4 + -1]) && v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= 0) && v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= p)) && (\exists v_main_~nondetString1~5.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= s && 0 <= v_main_~nondetString1~5.offset_BEFORE_CALL_4) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~5.offset_BEFORE_CALL_4 + -1]) && v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= 0)) && 1 == \valid[p])) && ((((!(1 == \valid[s]) || unknown-#length-unknown[s] < 1) || !(\old(unknown-#memory_int-unknown)[s][s] == 0)) || !(0 == s)) || ((((0 == unknown-#memory_int-unknown[p][p] && 1 == \valid[p]) && 0 == unknown-#memory_int-unknown[s][s]) && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[p] && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1]) && 1 <= main_~length1~5) && p <= v_main_~nondetString1~5.offset_BEFORE_CALL_2)) && p == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. SAFE Result, 9.8s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 484 SDslu, 881 SDs, 0 SdLazy, 847 SolverSat, 162 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 245 SyntacticMatches, 22 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 16 NumberOfFragments, 319 HoareAnnotationTreeSize, 9 FomulaSimplifications, 401 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1015 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 488 ConstructedInterpolants, 71 QuantifiedInterpolants, 203282 SizeOfPredicates, 73 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 22/182 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/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-52-46-349.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-52-46-349.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-52-46-349.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-52-46-349.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-52-46-349.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-52-46-349.csv Received shutdown request...