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_cbzero-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:25:16,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:25:16,028 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:25:16,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:25:16,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:25:16,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:25:16,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:25:16,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:25:16,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:25:16,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:25:16,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:25:16,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:25:16,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:25:16,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:25:16,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:25:16,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:25:16,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:25:16,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:25:16,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:25:16,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:25:16,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:25:16,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:25:16,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:25:16,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:25:16,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:25:16,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:25:16,069 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:25:16,069 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:25:16,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:25:16,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:25:16,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:25:16,071 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:16,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:25:16,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:25:16,080 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:25:16,080 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:25:16,080 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:25:16,080 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:25:16,080 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:25:16,081 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:25:16,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:25:16,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:25:16,081 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:25:16,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:25:16,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:25:16,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:25:16,082 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:25:16,082 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:25:16,082 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:25:16,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:25:16,082 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:25:16,082 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:25:16,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:25:16,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:25:16,083 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:25:16,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:25:16,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:25:16,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:25:16,084 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:25:16,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:25:16,084 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:25:16,084 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:25:16,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:25:16,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:25:16,084 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:25:16,085 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:25:16,085 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:25:16,085 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:25:16,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:25:16,128 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:25:16,132 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:25:16,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:25:16,134 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:25:16,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:25:16,282 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:25:16,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:25:16,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:25:16,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:25:16,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:25:16,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:25:16" (1/1) ... [2018-01-25 05:25:16,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6193682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:16, skipping insertion in model container [2018-01-25 05:25:16,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:25:16" (1/1) ... [2018-01-25 05:25:16,313 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:25:16,352 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:25:16,464 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:25:16,481 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:25:16,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:16 WrapperNode [2018-01-25 05:25:16,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:25:16,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:25:16,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:25:16,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:25:16,504 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:16" (1/1) ... [2018-01-25 05:25:16,504 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:16" (1/1) ... [2018-01-25 05:25:16,514 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:16" (1/1) ... [2018-01-25 05:25:16,515 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:16" (1/1) ... [2018-01-25 05:25:16,518 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:16" (1/1) ... [2018-01-25 05:25:16,521 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:16" (1/1) ... [2018-01-25 05:25:16,521 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:16" (1/1) ... [2018-01-25 05:25:16,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:25:16,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:25:16,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:25:16,523 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:25:16,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:16" (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:16,566 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:25:16,566 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:25:16,566 INFO L136 BoogieDeclarations]: Found implementation of procedure cbzero [2018-01-25 05:25:16,566 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:25:16,566 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:25:16,567 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:25:16,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:25:16,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:25:16,567 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:25:16,567 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:25:16,567 INFO L128 BoogieDeclarations]: Found specification of procedure cbzero [2018-01-25 05:25:16,567 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:25:16,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:25:16,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:25:16,700 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:25:16,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:25:16 BoogieIcfgContainer [2018-01-25 05:25:16,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:25:16,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:25:16,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:25:16,702 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:25:16,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:25:16" (1/3) ... [2018-01-25 05:25:16,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c5dafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:25:16, skipping insertion in model container [2018-01-25 05:25:16,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:16" (2/3) ... [2018-01-25 05:25:16,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c5dafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:25:16, skipping insertion in model container [2018-01-25 05:25:16,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:25:16" (3/3) ... [2018-01-25 05:25:16,705 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:25:16,711 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:25:16,716 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-25 05:25:16,762 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:25:16,762 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:25:16,762 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:25:16,762 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:25:16,763 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:25:16,763 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:25:16,763 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:25:16,763 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:25:16,764 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:25:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-01-25 05:25:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:25:16,790 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:16,791 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:16,791 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:16,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1815231445, now seen corresponding path program 1 times [2018-01-25 05:25:16,798 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:16,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:16,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:16,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:16,848 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:16,899 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:16,985 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:16,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:16,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:25:16,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:16,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:25:17,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:25:17,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:25:17,009 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-01-25 05:25:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:17,082 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-25 05:25:17,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:25:17,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-25 05:25:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:17,155 INFO L225 Difference]: With dead ends: 43 [2018-01-25 05:25:17,155 INFO L226 Difference]: Without dead ends: 29 [2018-01-25 05:25:17,158 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:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-25 05:25:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-01-25 05:25:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-25 05:25:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-01-25 05:25:17,189 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-01-25 05:25:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:17,189 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-01-25 05:25:17,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:25:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-01-25 05:25:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:25:17,190 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:17,190 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:17,190 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1815233367, now seen corresponding path program 1 times [2018-01-25 05:25:17,190 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:17,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:17,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:17,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:17,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:17,202 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:17,227 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:17,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:17,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:25:17,228 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:17,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:25:17,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:25:17,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:25:17,231 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-01-25 05:25:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:17,271 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-01-25 05:25:17,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:25:17,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-25 05:25:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:17,272 INFO L225 Difference]: With dead ends: 29 [2018-01-25 05:25:17,272 INFO L226 Difference]: Without dead ends: 27 [2018-01-25 05:25:17,273 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:25:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-01-25 05:25:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-01-25 05:25:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-25 05:25:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-01-25 05:25:17,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-01-25 05:25:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:17,278 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-01-25 05:25:17,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:25:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-01-25 05:25:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:25:17,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:17,279 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:17,279 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281886, now seen corresponding path program 1 times [2018-01-25 05:25:17,279 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:17,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:17,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:17,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:17,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:17,303 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:17,432 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:17,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:17,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:25:17,432 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:17,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:25:17,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:25:17,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:25:17,434 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-01-25 05:25:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:17,517 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-01-25 05:25:17,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:25:17,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-25 05:25:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:17,518 INFO L225 Difference]: With dead ends: 26 [2018-01-25 05:25:17,518 INFO L226 Difference]: Without dead ends: 25 [2018-01-25 05:25:17,519 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:25:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-25 05:25:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-25 05:25:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-25 05:25:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-01-25 05:25:17,524 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-01-25 05:25:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:17,524 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-01-25 05:25:17,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:25:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-01-25 05:25:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:25:17,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:17,526 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:17,526 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281887, now seen corresponding path program 1 times [2018-01-25 05:25:17,526 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:17,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:17,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:17,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:17,528 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:17,544 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:17,680 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:17,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:17,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:25:17,680 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:17,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:25:17,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:25:17,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:25:17,681 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-01-25 05:25:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:17,820 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-01-25 05:25:17,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:25:17,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-25 05:25:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:17,823 INFO L225 Difference]: With dead ends: 32 [2018-01-25 05:25:17,823 INFO L226 Difference]: Without dead ends: 31 [2018-01-25 05:25:17,823 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:25:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-25 05:25:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-01-25 05:25:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-25 05:25:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-01-25 05:25:17,829 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-01-25 05:25:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:17,829 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-01-25 05:25:17,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:25:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-01-25 05:25:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:17,830 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:17,830 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:17,831 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:17,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1525480681, now seen corresponding path program 1 times [2018-01-25 05:25:17,831 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:17,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:17,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:17,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:17,832 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:17,851 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:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:17,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:17,994 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:17,995 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-01-25 05:25:17,997 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [15], [17], [18], [24], [27], [33], [40], [41], [42], [49], [50], [51], [53] [2018-01-25 05:25:18,044 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:25:18,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:25:20,243 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:25:20,244 INFO L268 AbstractInterpreter]: Visited 18 different actions 32 times. Merged at 5 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 05:25:20,255 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:25:20,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:20,256 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:20,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:20,271 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:20,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:20,441 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:20,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:20,739 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:20,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:20,746 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:20,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:20,852 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:20,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:25:20,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-25 05:25:20,869 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:25:20,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:25:20,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:25:20,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:25:20,870 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-01-25 05:25:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:21,033 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-25 05:25:21,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:25:21,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 05:25:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:21,036 INFO L225 Difference]: With dead ends: 60 [2018-01-25 05:25:21,036 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:25:21,037 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:25:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:25:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-01-25 05:25:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:25:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 05:25:21,045 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-01-25 05:25:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:21,045 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 05:25:21,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:25:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 05:25:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:21,046 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:21,047 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:21,047 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2112286695, now seen corresponding path program 1 times [2018-01-25 05:25:21,047 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:21,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:21,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:21,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:21,048 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:21,065 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:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:21,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:21,238 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:21,238 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-01-25 05:25:21,239 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [15], [17], [18], [24], [27], [35], [40], [41], [42], [49], [50], [51], [53] [2018-01-25 05:25:21,240 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:25:21,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:25:23,657 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:25:23,658 INFO L268 AbstractInterpreter]: Visited 18 different actions 32 times. Merged at 5 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 05:25:23,712 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:25:23,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:23,713 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:23,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:23,724 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:23,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:23,771 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:23,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:23,954 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:23,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:23,966 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:24,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:24,019 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:24,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:25:24,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 16 [2018-01-25 05:25:24,043 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:25:24,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:25:24,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:25:24,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:25:24,044 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-01-25 05:25:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:24,221 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-25 05:25:24,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:25:24,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-01-25 05:25:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:24,224 INFO L225 Difference]: With dead ends: 85 [2018-01-25 05:25:24,241 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:25:24,242 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:25:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:25:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. [2018-01-25 05:25:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:25:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-25 05:25:24,258 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-25 05:25:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:24,259 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-25 05:25:24,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:25:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-25 05:25:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:24,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:24,260 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:24,260 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1171563351, now seen corresponding path program 1 times [2018-01-25 05:25:24,260 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:24,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:24,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:24,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:24,262 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:24,276 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:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:24,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:24,599 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:24,600 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-01-25 05:25:24,600 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [15], [17], [18], [24], [29], [35], [40], [41], [42], [49], [50], [51], [53] [2018-01-25 05:25:24,601 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:25:24,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:25:25,729 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:25:25,729 INFO L268 AbstractInterpreter]: Visited 18 different actions 32 times. Merged at 5 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 05:25:25,738 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:25:25,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:25,739 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-25 05:25:25,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:25,746 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:25,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:25,780 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:25,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:25,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:25,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-01-25 05:25:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:26,401 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:26,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:26,813 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-25 05:25:26,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:26,816 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:26,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:26,867 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:26,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:26,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:26,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-01-25 05:25:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:26,949 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:27,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:25:27,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 34 [2018-01-25 05:25:27,017 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:25:27,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 05:25:27,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 05:25:27,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 05:25:27,018 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 22 states. [2018-01-25 05:25:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:27,360 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-01-25 05:25:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:25:27,361 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2018-01-25 05:25:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:27,361 INFO L225 Difference]: With dead ends: 52 [2018-01-25 05:25:27,361 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:25:27,362 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2018-01-25 05:25:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:25:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-01-25 05:25:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:25:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-25 05:25:27,367 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2018-01-25 05:25:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:27,367 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-25 05:25:27,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 05:25:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-25 05:25:27,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:25:27,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:27,368 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] [2018-01-25 05:25:27,368 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:27,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1556914830, now seen corresponding path program 1 times [2018-01-25 05:25:27,368 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:27,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:27,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:27,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:27,369 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:27,378 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:27,430 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:27,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:27,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:25:27,431 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:27,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:25:27,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:25:27,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:25:27,432 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2018-01-25 05:25:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:27,459 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-25 05:25:27,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:25:27,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 05:25:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:27,461 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:25:27,461 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 05:25:27,461 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:25:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 05:25:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-01-25 05:25:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:25:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-01-25 05:25:27,467 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 21 [2018-01-25 05:25:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:27,467 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-01-25 05:25:27,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:25:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-01-25 05:25:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:25:27,468 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:27,469 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] [2018-01-25 05:25:27,469 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1726935216, now seen corresponding path program 1 times [2018-01-25 05:25:27,469 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:27,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:27,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:27,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:27,470 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:27,480 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:27,535 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:27,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:27,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:25:27,536 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:27,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:25:27,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:25:27,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:25:27,536 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 4 states. [2018-01-25 05:25:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:27,566 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-01-25 05:25:27,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:25:27,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-25 05:25:27,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:27,567 INFO L225 Difference]: With dead ends: 52 [2018-01-25 05:25:27,567 INFO L226 Difference]: Without dead ends: 25 [2018-01-25 05:25:27,567 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:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-25 05:25:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-25 05:25:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-25 05:25:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-01-25 05:25:27,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-01-25 05:25:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:27,571 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-01-25 05:25:27,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:25:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-01-25 05:25:27,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:25:27,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:27,572 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:27,573 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:27,573 INFO L82 PathProgramCache]: Analyzing trace with hash 964772623, now seen corresponding path program 2 times [2018-01-25 05:25:27,573 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:27,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:27,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:27,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:27,574 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:27,588 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:27,903 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-25 05:25:27,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:27,903 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:27,903 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:25:27,904 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:27,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:27,904 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:25:27,911 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:25:27,911 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:25:27,922 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:27,934 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:27,936 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:25:27,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:27,943 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:27,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:27,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:27,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-01-25 05:25:28,200 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-25 05:25:28,200 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:28,874 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-25 05:25:28,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:28,905 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:25:28,908 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:25:28,908 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:25:28,921 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:28,935 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:28,954 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:25:28,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:28,962 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:28,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:28,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:28,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-01-25 05:25:29,128 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-25 05:25:29,128 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:29,239 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-25 05:25:29,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:25:29,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14, 14, 14] total 41 [2018-01-25 05:25:29,241 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:25:29,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-25 05:25:29,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-25 05:25:29,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1554, Unknown=0, NotChecked=0, Total=1722 [2018-01-25 05:25:29,243 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 27 states. [2018-01-25 05:25:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:29,934 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-01-25 05:25:29,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:25:29,934 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 24 [2018-01-25 05:25:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:29,934 INFO L225 Difference]: With dead ends: 30 [2018-01-25 05:25:29,934 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:25:29,936 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=336, Invalid=2744, Unknown=0, NotChecked=0, Total=3080 [2018-01-25 05:25:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:25:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:25:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:25:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:25:29,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-25 05:25:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:29,936 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:25:29,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-25 05:25:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:25:29,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:25:29,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:25:30,244 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 63 DAG size of output 46 [2018-01-25 05:25:30,304 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:25:30,304 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:25:30,304 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:25:30,305 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-25 05:25:30,305 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:25:30,305 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-25 05:25:30,305 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:25:30,305 INFO L401 ceAbstractionStarter]: For program point L544'''(lines 544 545) no Hoare annotation was computed. [2018-01-25 05:25:30,305 INFO L401 ceAbstractionStarter]: For program point cbzeroEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-25 05:25:30,305 INFO L404 ceAbstractionStarter]: At program point cbzeroENTRY(lines 540 546) the Hoare annotation is: true [2018-01-25 05:25:30,305 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-25 05:25:30,306 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 545) no Hoare annotation was computed. [2018-01-25 05:25:30,306 INFO L401 ceAbstractionStarter]: For program point cbzeroErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:25:30,306 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-25 05:25:30,306 INFO L397 ceAbstractionStarter]: At program point L544''(lines 544 545) the Hoare annotation is: (let ((.cse1 (= 0 cbzero_~p~2.offset)) (.cse0 (not (= 0 |cbzero_#in~b.offset|))) (.cse3 (<= cbzero_~p~2.offset 1)) (.cse2 (< |cbzero_#in~length| 1)) (.cse4 (< (select |#length| |cbzero_#in~b.base|) |cbzero_#in~length|)) (.cse5 (not (= (select |#valid| |cbzero_#in~b.base|) 1)))) (and (or (< 1 |cbzero_#in~length|) .cse0 .cse1 .cse2 (and .cse3 (<= cbzero_~length 0)) .cse4 .cse5) (let ((.cse7 (select |#length| cbzero_~p~2.base)) (.cse6 (= 1 (select |#valid| cbzero_~p~2.base))) (.cse8 (<= 0 cbzero_~length))) (or (and .cse6 (<= cbzero_~length |cbzero_#in~length|) (<= |cbzero_#in~length| cbzero_~length) .cse1 (<= cbzero_~length .cse7)) .cse0 (and (<= (+ cbzero_~length 1) .cse7) .cse3 .cse6 (<= 1 cbzero_~p~2.offset) .cse8) .cse2 .cse4 .cse5 (and (<= 2 cbzero_~p~2.offset) (<= (+ cbzero_~length cbzero_~p~2.offset) .cse7) .cse6 .cse8))))) [2018-01-25 05:25:30,306 INFO L401 ceAbstractionStarter]: For program point cbzeroErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:25:30,306 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-25 05:25:30,306 INFO L401 ceAbstractionStarter]: For program point L553'(lines 553 555) no Hoare annotation was computed. [2018-01-25 05:25:30,307 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-25 05:25:30,307 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 560) no Hoare annotation was computed. [2018-01-25 05:25:30,307 INFO L397 ceAbstractionStarter]: At program point L558(line 558) the Hoare annotation is: (and (= 0 |main_#t~malloc5.offset|) (<= 1 main_~n~4) (= 1 (select |#valid| main_~nondetArea~4.base)) (= 0 main_~nondetArea~4.offset) (<= main_~n~4 main_~length~4) (<= main_~n~4 (select |#length| main_~nondetArea~4.base)) (= 1 (select |#valid| |main_#t~malloc5.base|)) (<= main_~n~4 (select |#length| |main_#t~malloc5.base|)) (= (store |#valid| |main_#t~malloc5.base| (select (store |#valid| |main_#t~malloc5.base| 0) |main_#t~malloc5.base|)) |old(#valid)|)) [2018-01-25 05:25:30,307 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 560) no Hoare annotation was computed. [2018-01-25 05:25:30,307 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:25:30,307 INFO L401 ceAbstractionStarter]: For program point L557'''(line 557) no Hoare annotation was computed. [2018-01-25 05:25:30,307 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-25 05:25:30,307 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-25 05:25:30,307 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-25 05:25:30,308 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-25 05:25:30,308 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 547 560) no Hoare annotation was computed. [2018-01-25 05:25:30,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,317 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,317 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,317 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,318 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,327 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,327 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,327 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:25:30 BoogieIcfgContainer [2018-01-25 05:25:30,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:25:30,330 INFO L168 Benchmark]: Toolchain (without parser) took 14047.52 ms. Allocated memory was 301.5 MB in the beginning and 800.6 MB in the end (delta: 499.1 MB). Free memory was 261.5 MB in the beginning and 603.4 MB in the end (delta: -341.9 MB). Peak memory consumption was 157.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:30,331 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:25:30,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.58 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.4 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:25:30,332 INFO L168 Benchmark]: Boogie Preprocessor took 34.82 ms. Allocated memory is still 301.5 MB. Free memory was 250.4 MB in the beginning and 249.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-01-25 05:25:30,332 INFO L168 Benchmark]: RCFGBuilder took 177.19 ms. Allocated memory is still 301.5 MB. Free memory was 249.4 MB in the beginning and 234.9 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:25:30,332 INFO L168 Benchmark]: TraceAbstraction took 13628.77 ms. Allocated memory was 301.5 MB in the beginning and 800.6 MB in the end (delta: 499.1 MB). Free memory was 234.9 MB in the beginning and 603.4 MB in the end (delta: -368.6 MB). Peak memory consumption was 130.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:30,334 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.12 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.58 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.82 ms. Allocated memory is still 301.5 MB. Free memory was 250.4 MB in the beginning and 249.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 177.19 ms. Allocated memory is still 301.5 MB. Free memory was 249.4 MB in the beginning and 234.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13628.77 ms. Allocated memory was 301.5 MB in the beginning and 800.6 MB in the end (delta: 499.1 MB). Free memory was 234.9 MB in the beginning and 603.4 MB in the end (delta: -368.6 MB). Peak memory consumption was 130.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 150 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 46 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 13.084296 RENAME_VARIABLES(MILLISECONDS) : 0.993223 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 13.013460 PROJECTAWAY(MILLISECONDS) : 10.776975 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.139675 DISJOIN(MILLISECONDS) : 1.670342 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.023872 ADD_EQUALITY(MILLISECONDS) : 0.045483 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011368 #CONJOIN_DISJUNCTIVE : 56 #RENAME_VARIABLES : 97 #UNFREEZE : 0 #CONJOIN : 94 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 12 #RENAME_VARIABLES_DISJUNCTIVE : 91 #ADD_EQUALITY : 47 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 144 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 46 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 16.271629 RENAME_VARIABLES(MILLISECONDS) : 1.237858 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 16.200259 PROJECTAWAY(MILLISECONDS) : 13.919347 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.089944 DISJOIN(MILLISECONDS) : 1.620791 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.273584 ADD_EQUALITY(MILLISECONDS) : 0.043052 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013653 #CONJOIN_DISJUNCTIVE : 55 #RENAME_VARIABLES : 97 #UNFREEZE : 0 #CONJOIN : 93 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 12 #RENAME_VARIABLES_DISJUNCTIVE : 91 #ADD_EQUALITY : 47 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 139 LocStat_NO_SUPPORTING_DISEQUALITIES : 10 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 46 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 9.174841 RENAME_VARIABLES(MILLISECONDS) : 0.991673 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 9.123958 PROJECTAWAY(MILLISECONDS) : 9.284926 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.056715 DISJOIN(MILLISECONDS) : 0.591523 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.014260 ADD_EQUALITY(MILLISECONDS) : 0.022352 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008342 #CONJOIN_DISJUNCTIVE : 59 #RENAME_VARIABLES : 108 #UNFREEZE : 0 #CONJOIN : 98 #PROJECTAWAY : 82 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 101 #ADD_EQUALITY : 47 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * 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 * 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: 547]: 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: 544]: Loop Invariant [2018-01-25 05:25:30,343 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,348 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:30,348 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((1 < \old(length) || !(0 == b)) || 0 == p) || \old(length) < 1) || (p <= 1 && length <= 0)) || unknown-#length-unknown[b] < \old(length)) || !(\valid[b] == 1)) && ((((((((((1 == \valid[p] && length <= \old(length)) && \old(length) <= length) && 0 == p) && length <= unknown-#length-unknown[p]) || !(0 == b)) || ((((length + 1 <= unknown-#length-unknown[p] && p <= 1) && 1 == \valid[p]) && 1 <= p) && 0 <= length)) || \old(length) < 1) || unknown-#length-unknown[b] < \old(length)) || !(\valid[b] == 1)) || (((2 <= p && length + p <= unknown-#length-unknown[p]) && 1 == \valid[p]) && 0 <= length)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 3 error locations. SAFE Result, 13.5s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 223 SDtfs, 214 SDslu, 913 SDs, 0 SdLazy, 676 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 268 SyntacticMatches, 14 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.8s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 56 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 20 NumberOfFragments, 171 HoareAnnotationTreeSize, 11 FomulaSimplifications, 236 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 372 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 488 ConstructedInterpolants, 4 QuantifiedInterpolants, 74178 SizeOfPredicates, 71 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 10/95 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_cbzero-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-25-30-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-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-25-30-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-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-25-30-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-25-30-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-25-30-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-25-30-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-25-30-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-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-25-30-353.csv Received shutdown request...