java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:25:41,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:25:41,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:25:41,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:25:41,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:25:41,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:25:41,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:25:41,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:25:41,136 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:25:41,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:25:41,137 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:25:41,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:25:41,139 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:25:41,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:25:41,141 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:25:41,143 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:25:41,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:25:41,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:25:41,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:25:41,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:25:41,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:25:41,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:25:41,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:25:41,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:25:41,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:25:41,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:25:41,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:25:41,156 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:25:41,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:25:41,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:25:41,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:25:41,157 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:25:41,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:25:41,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:25:41,168 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:25:41,168 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:25:41,168 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:25:41,168 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:25:41,168 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:25:41,169 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:25:41,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:25:41,169 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:25:41,170 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:25:41,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:25:41,170 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:25:41,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:25:41,170 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:25:41,171 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:25:41,171 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:25:41,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:25:41,171 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:25:41,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:25:41,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:25:41,172 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:25:41,172 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:25:41,172 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:25:41,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:25:41,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:25:41,173 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:25:41,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:25:41,173 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:25:41,173 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:25:41,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:25:41,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:25:41,174 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:25:41,174 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:25:41,175 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:25:41,175 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:25:41,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:25:41,220 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:25:41,224 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:25:41,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:25:41,225 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:25:41,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:25:41,402 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:25:41,406 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:25:41,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:25:41,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:25:41,411 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:25:41,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:25:41" (1/1) ... [2018-01-25 05:25:41,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a17fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41, skipping insertion in model container [2018-01-25 05:25:41,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:25:41" (1/1) ... [2018-01-25 05:25:41,427 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:25:41,462 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:25:41,571 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:25:41,588 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:25:41,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41 WrapperNode [2018-01-25 05:25:41,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:25:41,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:25:41,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:25:41,597 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:25:41,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41" (1/1) ... [2018-01-25 05:25:41,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41" (1/1) ... [2018-01-25 05:25:41,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41" (1/1) ... [2018-01-25 05:25:41,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41" (1/1) ... [2018-01-25 05:25:41,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41" (1/1) ... [2018-01-25 05:25:41,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41" (1/1) ... [2018-01-25 05:25:41,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41" (1/1) ... [2018-01-25 05:25:41,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:25:41,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:25:41,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:25:41,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:25:41,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:25:41,676 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:25:41,676 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:25:41,676 INFO L136 BoogieDeclarations]: Found implementation of procedure cmemrchr [2018-01-25 05:25:41,676 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:25:41,676 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:25:41,676 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:25:41,676 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:25:41,676 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:25:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:25:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:25:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure cmemrchr [2018-01-25 05:25:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:25:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:25:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:25:41,817 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:25:41,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:25:41 BoogieIcfgContainer [2018-01-25 05:25:41,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:25:41,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:25:41,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:25:41,820 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:25:41,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:25:41" (1/3) ... [2018-01-25 05:25:41,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd9164d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:25:41, skipping insertion in model container [2018-01-25 05:25:41,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:41" (2/3) ... [2018-01-25 05:25:41,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd9164d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:25:41, skipping insertion in model container [2018-01-25 05:25:41,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:25:41" (3/3) ... [2018-01-25 05:25:41,824 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:25:41,831 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:25:41,836 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-25 05:25:41,876 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:25:41,876 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:25:41,876 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:25:41,877 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:25:41,877 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:25:41,877 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:25:41,877 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:25:41,877 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:25:41,878 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:25:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-01-25 05:25:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:25:41,896 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:41,897 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:41,897 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:41,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1869622704, now seen corresponding path program 1 times [2018-01-25 05:25:41,905 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:41,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:41,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:41,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:41,947 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:42,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:42,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:42,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:25:42,189 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:42,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:25:42,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:25:42,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:25:42,203 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 8 states. [2018-01-25 05:25:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:42,499 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-25 05:25:42,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:25:42,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-25 05:25:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:42,513 INFO L225 Difference]: With dead ends: 45 [2018-01-25 05:25:42,513 INFO L226 Difference]: Without dead ends: 30 [2018-01-25 05:25:42,517 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:25:42,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-25 05:25:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-01-25 05:25:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-25 05:25:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-01-25 05:25:42,546 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2018-01-25 05:25:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:42,547 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-01-25 05:25:42,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:25:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-01-25 05:25:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:25:42,547 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:42,548 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:42,548 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1869622705, now seen corresponding path program 1 times [2018-01-25 05:25:42,548 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:42,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:42,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:42,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:42,549 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:42,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:42,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:42,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:25:42,828 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:42,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:25:42,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:25:42,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:25:42,830 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 9 states. [2018-01-25 05:25:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:43,041 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-01-25 05:25:43,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:25:43,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-01-25 05:25:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:43,042 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:25:43,042 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 05:25:43,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:25:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 05:25:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2018-01-25 05:25:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:25:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-01-25 05:25:43,050 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 15 [2018-01-25 05:25:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:43,051 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-01-25 05:25:43,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:25:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-01-25 05:25:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:25:43,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:43,052 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:43,053 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:43,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1060276079, now seen corresponding path program 1 times [2018-01-25 05:25:43,053 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:43,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:43,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:43,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:43,054 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:43,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:43,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:43,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:25:43,253 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:43,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:25:43,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:25:43,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:25:43,253 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 10 states. [2018-01-25 05:25:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:43,511 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-01-25 05:25:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:25:43,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-01-25 05:25:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:43,512 INFO L225 Difference]: With dead ends: 55 [2018-01-25 05:25:43,513 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:25:43,513 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:25:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:25:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 29. [2018-01-25 05:25:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-25 05:25:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-01-25 05:25:43,521 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2018-01-25 05:25:43,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:43,521 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-01-25 05:25:43,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:25:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-01-25 05:25:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:43,522 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:43,522 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:43,523 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:43,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1406269975, now seen corresponding path program 1 times [2018-01-25 05:25:43,523 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:43,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:43,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:43,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:43,529 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:43,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:43,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:43,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 05:25:43,734 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:43,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:25:43,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:25:43,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:25:43,735 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 11 states. [2018-01-25 05:25:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:43,935 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-01-25 05:25:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:25:43,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-01-25 05:25:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:43,936 INFO L225 Difference]: With dead ends: 63 [2018-01-25 05:25:43,936 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:25:43,937 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-01-25 05:25:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:25:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-01-25 05:25:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:25:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-01-25 05:25:43,944 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2018-01-25 05:25:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:43,944 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-01-25 05:25:43,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:25:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-01-25 05:25:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:43,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:43,945 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] [2018-01-25 05:25:43,945 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2125153178, now seen corresponding path program 1 times [2018-01-25 05:25:43,946 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:43,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:43,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:43,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:43,947 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:43,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:43,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:43,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:25:43,998 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:43,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:25:43,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:25:43,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:25:43,999 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-01-25 05:25:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:44,040 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-25 05:25:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:25:44,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 05:25:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:44,043 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:25:44,043 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 05:25:44,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:25:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 05:25:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-01-25 05:25:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:25:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-25 05:25:44,052 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-25 05:25:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:44,052 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-25 05:25:44,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:25:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-25 05:25:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:44,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:44,053 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:44,053 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1993075989, now seen corresponding path program 1 times [2018-01-25 05:25:44,054 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:44,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:44,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:44,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:44,055 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:44,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:44,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:44,337 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:44,338 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-01-25 05:25:44,339 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [9], [10], [12], [16], [18], [23], [35], [38], [46], [48], [49], [56], [57], [58], [60] [2018-01-25 05:25:44,381 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:25:44,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:25:44,626 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:25:44,627 INFO L268 AbstractInterpreter]: Visited 19 different actions 24 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 05:25:44,642 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:25:44,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:44,642 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:25:44,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:44,649 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:44,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:44,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:25:44,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:44,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:44,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:25:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:45,152 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:45,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:45,592 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:25:45,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:45,596 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:45,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:45,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:25:45,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:45,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:45,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:25:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:46,010 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:46,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:25:46,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11, 11, 11] total 46 [2018-01-25 05:25:46,292 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:25:46,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:25:46,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:25:46,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1981, Unknown=0, NotChecked=0, Total=2162 [2018-01-25 05:25:46,294 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 23 states. [2018-01-25 05:25:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:47,112 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-01-25 05:25:47,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:25:47,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2018-01-25 05:25:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:47,114 INFO L225 Difference]: With dead ends: 56 [2018-01-25 05:25:47,114 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 05:25:47,115 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=345, Invalid=2847, Unknown=0, NotChecked=0, Total=3192 [2018-01-25 05:25:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 05:25:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-01-25 05:25:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:25:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-01-25 05:25:47,124 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-01-25 05:25:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:47,124 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-01-25 05:25:47,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:25:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-01-25 05:25:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:47,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:47,126 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] [2018-01-25 05:25:47,126 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:47,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1538347164, now seen corresponding path program 1 times [2018-01-25 05:25:47,126 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:47,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:47,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:47,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:47,127 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:47,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:47,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:47,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:25:47,200 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:47,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:25:47,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:25:47,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:25:47,201 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-01-25 05:25:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:47,267 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-01-25 05:25:47,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:25:47,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 05:25:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:47,270 INFO L225 Difference]: With dead ends: 47 [2018-01-25 05:25:47,271 INFO L226 Difference]: Without dead ends: 26 [2018-01-25 05:25:47,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:25:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-25 05:25:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-25 05:25:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-25 05:25:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-25 05:25:47,277 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-01-25 05:25:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:47,277 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-25 05:25:47,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:25:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-25 05:25:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:25:47,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:47,278 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:47,278 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1560958191, now seen corresponding path program 2 times [2018-01-25 05:25:47,279 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:47,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:47,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:47,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:47,280 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:47,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:48,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:48,311 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:48,312 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:25:48,312 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:25:48,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:48,312 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:25:48,317 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:25:48,317 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:25:48,328 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:48,333 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:48,336 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:25:48,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:48,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:25:48,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:48,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:48,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:25:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:48,826 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:49,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:49,510 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:25:49,513 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:25:49,513 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:25:49,529 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:49,542 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:49,559 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:25:49,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:49,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 6 treesize of output 5 [2018-01-25 05:25:49,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:49,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:49,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:25:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:52,439 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:52,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:25:52,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14, 14, 14] total 53 [2018-01-25 05:25:52,610 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:25:52,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-25 05:25:52,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-25 05:25:52,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2640, Unknown=0, NotChecked=0, Total=2862 [2018-01-25 05:25:52,611 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 29 states. [2018-01-25 05:25:57,877 WARN L146 SmtUtils]: Spent 2234ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-01-25 05:26:00,233 WARN L146 SmtUtils]: Spent 2141ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-01-25 05:26:03,386 WARN L146 SmtUtils]: Spent 2294ms on a formula simplification. DAG size of input: 48 DAG size of output 35 [2018-01-25 05:26:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:05,579 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-01-25 05:26:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-25 05:26:05,580 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-01-25 05:26:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:05,580 INFO L225 Difference]: With dead ends: 32 [2018-01-25 05:26:05,580 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:26:05,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=505, Invalid=4465, Unknown=0, NotChecked=0, Total=4970 [2018-01-25 05:26:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:26:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:26:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:26:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:26:05,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-25 05:26:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:05,582 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:26:05,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-25 05:26:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:26:05,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:26:05,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:26:05,663 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 05:26:06,129 WARN L146 SmtUtils]: Spent 455ms on a formula simplification. DAG size of input: 114 DAG size of output 80 [2018-01-25 05:26:06,183 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 566) no Hoare annotation was computed. [2018-01-25 05:26:06,183 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 566) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:26:06,184 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 566) no Hoare annotation was computed. [2018-01-25 05:26:06,184 INFO L401 ceAbstractionStarter]: For program point cmemrchrFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-25 05:26:06,184 INFO L401 ceAbstractionStarter]: For program point L546(lines 546 549) no Hoare annotation was computed. [2018-01-25 05:26:06,184 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-25 05:26:06,184 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-25 05:26:06,184 INFO L401 ceAbstractionStarter]: For program point L544'(lines 544 550) no Hoare annotation was computed. [2018-01-25 05:26:06,184 INFO L401 ceAbstractionStarter]: For program point L546'(lines 546 549) no Hoare annotation was computed. [2018-01-25 05:26:06,184 INFO L401 ceAbstractionStarter]: For program point cmemrchrErr0RequiresViolation(lines 1 566) no Hoare annotation was computed. [2018-01-25 05:26:06,185 INFO L401 ceAbstractionStarter]: For program point cmemrchrErr1RequiresViolation(lines 1 566) no Hoare annotation was computed. [2018-01-25 05:26:06,185 INFO L401 ceAbstractionStarter]: For program point cmemrchrEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-25 05:26:06,185 INFO L404 ceAbstractionStarter]: At program point cmemrchrENTRY(lines 540 552) the Hoare annotation is: true [2018-01-25 05:26:06,185 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-25 05:26:06,185 INFO L397 ceAbstractionStarter]: At program point L546'''(lines 546 549) the Hoare annotation is: (let ((.cse6 (select |#length| |cmemrchr_#in~s.base|))) (let ((.cse7 (or (< |cmemrchr_#in~n| 1) (not (= 0 |cmemrchr_#in~s.offset|)) (not (= 1 (select |#valid| |cmemrchr_#in~s.base|))) (< .cse6 |cmemrchr_#in~n|))) (.cse2 (select |#length| cmemrchr_~cp~2.base)) (.cse4 (* 4294967296 (div cmemrchr_~n 4294967296)))) (and (let ((.cse0 (= 1 (select |#valid| cmemrchr_~s.base))) (.cse1 (= 1 (select |#valid| cmemrchr_~cp~2.base))) (.cse3 (= cmemrchr_~s.offset 0))) (or (and .cse0 (= cmemrchr_~n (select |#length| cmemrchr_~s.base)) .cse1 (= cmemrchr_~cp~2.offset (mod cmemrchr_~n 4294967296)) (= cmemrchr_~n |cmemrchr_#in~n|) (= cmemrchr_~n .cse2) .cse3) (and .cse0 (<= (+ cmemrchr_~cp~2.offset 2) .cse2) .cse1 (<= (+ cmemrchr_~cp~2.offset (* 4294967296 (div (+ (- cmemrchr_~cp~2.offset) (+ cmemrchr_~n 4294967295)) 4294967296))) cmemrchr_~n) (<= 1 cmemrchr_~cp~2.offset) (<= (+ cmemrchr_~cp~2.offset .cse4) cmemrchr_~n) .cse3) (let ((.cse5 (+ cmemrchr_~cp~2.offset 1))) (and .cse0 (<= .cse5 .cse2) (= (+ cmemrchr_~n 1) .cse2) .cse1 (not (= (mod (+ .cse2 4294967295) 4294967296) 0)) (= .cse5 (mod .cse2 4294967296)) (<= .cse2 2147483647) (<= 0 cmemrchr_~cp~2.offset) .cse3)) (not (= |cmemrchr_#in~n| .cse6)) .cse7 (< 2147483647 |cmemrchr_#in~n|))) (or (< 1 .cse6) .cse7 (<= (+ cmemrchr_~n .cse2) (+ cmemrchr_~cp~2.offset .cse4 1)))))) [2018-01-25 05:26:06,185 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 566) the Hoare annotation is: true [2018-01-25 05:26:06,185 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 566) no Hoare annotation was computed. [2018-01-25 05:26:06,186 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 566) the Hoare annotation is: true [2018-01-25 05:26:06,186 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 566) no Hoare annotation was computed. [2018-01-25 05:26:06,186 INFO L401 ceAbstractionStarter]: For program point L560'(lines 560 562) no Hoare annotation was computed. [2018-01-25 05:26:06,186 INFO L397 ceAbstractionStarter]: At program point L564(line 564) the Hoare annotation is: (and (<= 1 main_~n~5) (= (select |#length| main_~nondetArea~5.base) main_~n~5) (= main_~nondetArea~5.offset 0) (= (select |#length| |main_#t~malloc6.base|) main_~n~5) (<= main_~n~5 2147483647) (= 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)|) (= 1 (select |#valid| main_~nondetArea~5.base)) (= |main_#t~malloc6.offset| 0)) [2018-01-25 05:26:06,186 INFO L401 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-25 05:26:06,186 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-25 05:26:06,186 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-25 05:26:06,186 INFO L401 ceAbstractionStarter]: For program point L557(lines 557 559) no Hoare annotation was computed. [2018-01-25 05:26:06,187 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 566) no Hoare annotation was computed. [2018-01-25 05:26:06,187 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 566) no Hoare annotation was computed. [2018-01-25 05:26:06,187 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 566) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:26:06,187 INFO L401 ceAbstractionStarter]: For program point L563''(line 563) no Hoare annotation was computed. [2018-01-25 05:26:06,187 INFO L401 ceAbstractionStarter]: For program point L557''(lines 557 559) no Hoare annotation was computed. [2018-01-25 05:26:06,187 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 553 566) no Hoare annotation was computed. [2018-01-25 05:26:06,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,209 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,209 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,209 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,209 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,210 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,210 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,210 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,210 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,210 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:26:06 BoogieIcfgContainer [2018-01-25 05:26:06,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:26:06,214 INFO L168 Benchmark]: Toolchain (without parser) took 24811.81 ms. Allocated memory was 307.2 MB in the beginning and 562.6 MB in the end (delta: 255.3 MB). Free memory was 267.3 MB in the beginning and 365.2 MB in the end (delta: -97.9 MB). Peak memory consumption was 157.4 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:06,215 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:26:06,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.14 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:06,215 INFO L168 Benchmark]: Boogie Preprocessor took 33.93 ms. Allocated memory is still 307.2 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:06,216 INFO L168 Benchmark]: RCFGBuilder took 187.12 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 239.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:06,216 INFO L168 Benchmark]: TraceAbstraction took 24394.62 ms. Allocated memory was 307.2 MB in the beginning and 562.6 MB in the end (delta: 255.3 MB). Free memory was 239.6 MB in the beginning and 365.2 MB in the end (delta: -125.5 MB). Peak memory consumption was 129.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:06,217 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.21 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 189.14 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.93 ms. Allocated memory is still 307.2 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 187.12 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 239.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 24394.62 ms. Allocated memory was 307.2 MB in the beginning and 562.6 MB in the end (delta: 255.3 MB). Free memory was 239.6 MB in the beginning and 365.2 MB in the end (delta: -125.5 MB). Peak memory consumption was 129.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 145 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 25 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 44 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 26 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.575863 RENAME_VARIABLES(MILLISECONDS) : 0.303578 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.524445 PROJECTAWAY(MILLISECONDS) : 0.207253 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.135825 DISJOIN(MILLISECONDS) : 1.904643 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.349628 ADD_EQUALITY(MILLISECONDS) : 0.033240 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018001 #CONJOIN_DISJUNCTIVE : 39 #RENAME_VARIABLES : 59 #UNFREEZE : 0 #CONJOIN : 73 #PROJECTAWAY : 56 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 57 #ADD_EQUALITY : 44 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 546]: Loop Invariant [2018-01-25 05:26:06,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:06,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((1 == \valid[s] && n == unknown-#length-unknown[s]) && 1 == \valid[cp]) && cp == n % 4294967296) && n == \old(n)) && n == unknown-#length-unknown[cp]) && s == 0) || ((((((1 == \valid[s] && cp + 2 <= unknown-#length-unknown[cp]) && 1 == \valid[cp]) && cp + 4294967296 * ((-cp + (n + 4294967295)) / 4294967296) <= n) && 1 <= cp) && cp + 4294967296 * (n / 4294967296) <= n) && s == 0)) || ((((((((1 == \valid[s] && cp + 1 <= unknown-#length-unknown[cp]) && n + 1 == unknown-#length-unknown[cp]) && 1 == \valid[cp]) && !((unknown-#length-unknown[cp] + 4294967295) % 4294967296 == 0)) && cp + 1 == unknown-#length-unknown[cp] % 4294967296) && unknown-#length-unknown[cp] <= 2147483647) && 0 <= cp) && s == 0)) || !(\old(n) == unknown-#length-unknown[s])) || ((\old(n) < 1 || !(0 == s)) || !(1 == \valid[s])) || unknown-#length-unknown[s] < \old(n)) || 2147483647 < \old(n)) && ((1 < unknown-#length-unknown[s] || ((\old(n) < 1 || !(0 == s)) || !(1 == \valid[s])) || unknown-#length-unknown[s] < \old(n)) || n + unknown-#length-unknown[cp] <= cp + 4294967296 * (n / 4294967296) + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 3 error locations. SAFE Result, 24.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 14.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 174 SDtfs, 308 SDslu, 962 SDs, 0 SdLazy, 916 SolverSat, 114 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 107 SyntacticMatches, 8 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2011 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 68 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 262 HoareAnnotationTreeSize, 9 FomulaSimplifications, 512 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 675 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 95253 SizeOfPredicates, 47 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 2/57 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/openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-26-06-238.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-26-06-238.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-26-06-238.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-26-06-238.csv Received shutdown request...