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/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:54:33,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:54:33,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:54:33,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:54:33,969 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:54:33,970 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:54:33,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:54:33,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:54:33,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:54:33,975 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:54:33,976 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:54:33,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:54:33,977 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:54:33,978 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:54:33,979 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:54:33,981 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:54:33,983 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:54:33,985 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:54:33,986 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:54:33,988 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:54:33,990 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:54:33,990 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:54:33,990 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:54:33,991 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:54:33,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:54:33,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:54:33,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:54:33,994 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:54:33,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:54:33,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:54:33,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:54:33,995 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:54:34,005 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:54:34,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:54:34,007 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:54:34,007 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:54:34,007 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:54:34,007 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:54:34,007 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:54:34,008 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:54:34,008 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:54:34,009 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:54:34,009 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:54:34,009 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:54:34,009 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:54:34,009 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:54:34,010 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:54:34,010 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:54:34,010 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:54:34,010 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:54:34,010 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:54:34,011 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:54:34,011 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:54:34,011 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:54:34,011 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:54:34,011 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:54:34,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:54:34,012 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:54:34,012 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:54:34,012 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:54:34,012 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:54:34,013 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:54:34,013 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:54:34,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:54:34,013 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:54:34,013 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:54:34,014 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:54:34,014 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:54:34,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:54:34,062 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:54:34,066 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:54:34,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:54:34,068 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:54:34,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-01-25 05:54:34,249 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:54:34,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:54:34,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:54:34,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:54:34,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:54:34,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:54:34" (1/1) ... [2018-01-25 05:54:34,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28805b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34, skipping insertion in model container [2018-01-25 05:54:34,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:54:34" (1/1) ... [2018-01-25 05:54:34,284 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:54:34,322 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:54:34,435 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:54:34,451 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:54:34,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34 WrapperNode [2018-01-25 05:54:34,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:54:34,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:54:34,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:54:34,460 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:54:34,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34" (1/1) ... [2018-01-25 05:54:34,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34" (1/1) ... [2018-01-25 05:54:34,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34" (1/1) ... [2018-01-25 05:54:34,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34" (1/1) ... [2018-01-25 05:54:34,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34" (1/1) ... [2018-01-25 05:54:34,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34" (1/1) ... [2018-01-25 05:54:34,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34" (1/1) ... [2018-01-25 05:54:34,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:54:34,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:54:34,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:54:34,494 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:54:34,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34" (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:54:34,538 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:54:34,538 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:54:34,539 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 05:54:34,539 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:54:34,539 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:54:34,539 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:54:34,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:54:34,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:54:34,539 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:54:34,539 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:54:34,539 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:54:34,539 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:54:34,540 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 05:54:34,540 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:54:34,540 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:54:34,540 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:54:34,921 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:54:34,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:54:34 BoogieIcfgContainer [2018-01-25 05:54:34,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:54:34,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:54:34,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:54:34,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:54:34,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:54:34" (1/3) ... [2018-01-25 05:54:34,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9bac04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:54:34, skipping insertion in model container [2018-01-25 05:54:34,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:34" (2/3) ... [2018-01-25 05:54:34,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9bac04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:54:34, skipping insertion in model container [2018-01-25 05:54:34,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:54:34" (3/3) ... [2018-01-25 05:54:34,927 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-01-25 05:54:34,937 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:54:34,944 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-25 05:54:34,990 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:54:34,991 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:54:34,991 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:54:34,991 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:54:34,991 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:54:34,991 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:54:34,991 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:54:34,991 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:54:34,992 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:54:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-01-25 05:54:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:54:35,016 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:35,017 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:35,017 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:35,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068532, now seen corresponding path program 1 times [2018-01-25 05:54:35,023 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:35,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:35,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:35,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:35,064 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:35,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:35,160 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:54:35,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:35,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:54:35,162 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:35,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:54:35,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:54:35,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:54:35,178 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-01-25 05:54:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:35,501 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2018-01-25 05:54:35,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:54:35,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:54:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:35,516 INFO L225 Difference]: With dead ends: 169 [2018-01-25 05:54:35,516 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 05:54:35,520 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:54:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 05:54:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-01-25 05:54:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-25 05:54:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-25 05:54:35,568 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2018-01-25 05:54:35,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:35,569 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-25 05:54:35,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:54:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-25 05:54:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:54:35,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:35,570 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:35,570 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068531, now seen corresponding path program 1 times [2018-01-25 05:54:35,570 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:35,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:35,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:35,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:35,572 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:35,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:35,640 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:54:35,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:35,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:54:35,640 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:35,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:54:35,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:54:35,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:54:35,642 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 3 states. [2018-01-25 05:54:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:35,763 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-25 05:54:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:54:35,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:54:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:35,765 INFO L225 Difference]: With dead ends: 104 [2018-01-25 05:54:35,765 INFO L226 Difference]: Without dead ends: 103 [2018-01-25 05:54:35,766 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:54:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-25 05:54:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-01-25 05:54:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-25 05:54:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-25 05:54:35,776 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 7 [2018-01-25 05:54:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:35,776 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-25 05:54:35,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:54:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-25 05:54:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:54:35,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:35,778 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:35,778 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:35,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515713, now seen corresponding path program 1 times [2018-01-25 05:54:35,778 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:35,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:35,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:35,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:35,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:35,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:35,872 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:54:35,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:35,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:54:35,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:35,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:54:35,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:54:35,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:35,874 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-01-25 05:54:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:36,041 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-01-25 05:54:36,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:36,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:54:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:36,042 INFO L225 Difference]: With dead ends: 104 [2018-01-25 05:54:36,042 INFO L226 Difference]: Without dead ends: 99 [2018-01-25 05:54:36,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:54:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-25 05:54:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-01-25 05:54:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 05:54:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-25 05:54:36,049 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 14 [2018-01-25 05:54:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:36,049 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-25 05:54:36,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:54:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-25 05:54:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:54:36,050 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:36,050 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:36,050 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515714, now seen corresponding path program 1 times [2018-01-25 05:54:36,050 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:36,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:36,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,052 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:36,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:36,154 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:54:36,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:36,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:54:36,155 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:36,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:54:36,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:54:36,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:54:36,156 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-01-25 05:54:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:36,302 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-01-25 05:54:36,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:54:36,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 05:54:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:36,303 INFO L225 Difference]: With dead ends: 95 [2018-01-25 05:54:36,303 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 05:54:36,304 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:54:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 05:54:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-25 05:54:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 05:54:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-25 05:54:36,310 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 14 [2018-01-25 05:54:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:36,310 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-25 05:54:36,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:54:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-25 05:54:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:54:36,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:36,311 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:36,311 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:36,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445036, now seen corresponding path program 1 times [2018-01-25 05:54:36,311 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:36,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:36,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,312 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:36,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:36,364 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:54:36,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:36,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:54:36,365 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:36,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:54:36,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:54:36,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:54:36,366 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 4 states. [2018-01-25 05:54:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:36,455 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-01-25 05:54:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:54:36,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 05:54:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:36,456 INFO L225 Difference]: With dead ends: 86 [2018-01-25 05:54:36,456 INFO L226 Difference]: Without dead ends: 82 [2018-01-25 05:54:36,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-25 05:54:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-25 05:54:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 05:54:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-25 05:54:36,463 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 15 [2018-01-25 05:54:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:36,464 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-25 05:54:36,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:54:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-25 05:54:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:54:36,465 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:36,465 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:36,465 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445037, now seen corresponding path program 1 times [2018-01-25 05:54:36,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:36,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:36,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,467 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:36,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:36,534 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:54:36,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:36,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:54:36,535 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:36,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:54:36,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:54:36,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:54:36,536 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 4 states. [2018-01-25 05:54:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:36,581 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-25 05:54:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:54:36,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 05:54:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:36,582 INFO L225 Difference]: With dead ends: 82 [2018-01-25 05:54:36,582 INFO L226 Difference]: Without dead ends: 78 [2018-01-25 05:54:36,582 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-25 05:54:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-25 05:54:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-25 05:54:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-25 05:54:36,587 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 15 [2018-01-25 05:54:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:36,587 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-25 05:54:36,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:54:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-25 05:54:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:54:36,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:36,588 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:36,588 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:36,589 INFO L82 PathProgramCache]: Analyzing trace with hash 198602156, now seen corresponding path program 1 times [2018-01-25 05:54:36,589 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:36,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:36,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:36,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:36,692 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:54:36,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:36,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:54:36,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:36,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:54:36,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:54:36,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:54:36,693 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 8 states. [2018-01-25 05:54:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:36,877 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-01-25 05:54:36,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:54:36,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 05:54:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:36,880 INFO L225 Difference]: With dead ends: 163 [2018-01-25 05:54:36,880 INFO L226 Difference]: Without dead ends: 93 [2018-01-25 05:54:36,881 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:54:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-25 05:54:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-01-25 05:54:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-25 05:54:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-25 05:54:36,889 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 20 [2018-01-25 05:54:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:36,889 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-25 05:54:36,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:54:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-25 05:54:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:54:36,892 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:36,892 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:36,892 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash -524715473, now seen corresponding path program 1 times [2018-01-25 05:54:36,892 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:36,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:36,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:36,894 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:36,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:36,972 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:54:36,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:36,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:54:36,972 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:36,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:54:36,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:54:36,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:54:36,973 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 7 states. [2018-01-25 05:54:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:37,143 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-01-25 05:54:37,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:54:37,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-25 05:54:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:37,145 INFO L225 Difference]: With dead ends: 109 [2018-01-25 05:54:37,145 INFO L226 Difference]: Without dead ends: 108 [2018-01-25 05:54:37,146 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:54:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-25 05:54:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-25 05:54:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-25 05:54:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-01-25 05:54:37,153 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 32 [2018-01-25 05:54:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:37,153 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-01-25 05:54:37,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:54:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-01-25 05:54:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:54:37,154 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:37,155 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:37,155 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash -524715472, now seen corresponding path program 1 times [2018-01-25 05:54:37,155 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:37,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:37,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,156 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:37,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:37,357 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:54:37,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:37,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:54:37,358 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:37,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:54:37,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:54:37,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:54:37,359 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 9 states. [2018-01-25 05:54:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:37,598 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-25 05:54:37,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:54:37,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-25 05:54:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:37,599 INFO L225 Difference]: With dead ends: 106 [2018-01-25 05:54:37,599 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 05:54:37,600 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:54:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 05:54:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2018-01-25 05:54:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-25 05:54:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-25 05:54:37,604 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 32 [2018-01-25 05:54:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:37,605 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-25 05:54:37,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:54:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-25 05:54:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:54:37,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:37,606 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:37,606 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash -524727421, now seen corresponding path program 1 times [2018-01-25 05:54:37,606 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:37,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:37,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:37,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:37,640 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:54:37,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:37,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:54:37,641 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:37,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:54:37,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:54:37,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:54:37,642 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 3 states. [2018-01-25 05:54:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:37,656 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-01-25 05:54:37,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:54:37,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-25 05:54:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:37,657 INFO L225 Difference]: With dead ends: 117 [2018-01-25 05:54:37,658 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 05:54:37,658 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:54:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 05:54:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-25 05:54:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 05:54:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-25 05:54:37,664 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 32 [2018-01-25 05:54:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:37,664 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-25 05:54:37,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:54:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-25 05:54:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:54:37,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:37,666 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:37,666 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash 947709807, now seen corresponding path program 1 times [2018-01-25 05:54:37,666 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:37,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:37,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,668 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:37,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:37,718 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:54:37,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:37,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:54:37,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:37,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:54:37,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:54:37,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:54:37,720 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 3 states. [2018-01-25 05:54:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:37,734 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-25 05:54:37,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:54:37,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-25 05:54:37,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:37,735 INFO L225 Difference]: With dead ends: 99 [2018-01-25 05:54:37,735 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 05:54:37,736 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:54:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 05:54:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-25 05:54:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-25 05:54:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-25 05:54:37,740 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 33 [2018-01-25 05:54:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:37,741 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-25 05:54:37,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:54:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-25 05:54:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:54:37,742 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:37,742 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:37,742 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:37,742 INFO L82 PathProgramCache]: Analyzing trace with hash 214855819, now seen corresponding path program 1 times [2018-01-25 05:54:37,743 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:37,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:37,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,744 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:37,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:37,795 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:54:37,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:37,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:54:37,795 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:37,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:54:37,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:54:37,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:54:37,796 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 4 states. [2018-01-25 05:54:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:37,818 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-01-25 05:54:37,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:54:37,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-25 05:54:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:37,819 INFO L225 Difference]: With dead ends: 84 [2018-01-25 05:54:37,819 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 05:54:37,820 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:54:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 05:54:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-01-25 05:54:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 05:54:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-25 05:54:37,825 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 35 [2018-01-25 05:54:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:37,826 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-25 05:54:37,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:54:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-25 05:54:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:54:37,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:37,827 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:37,827 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:37,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322185, now seen corresponding path program 1 times [2018-01-25 05:54:37,827 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:37,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:37,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:37,829 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:37,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:37,950 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:54:37,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:37,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:54:37,950 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:37,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:54:37,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:54:37,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:54:37,951 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 8 states. [2018-01-25 05:54:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:38,065 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-25 05:54:38,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:54:38,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-25 05:54:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:38,066 INFO L225 Difference]: With dead ends: 76 [2018-01-25 05:54:38,066 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 05:54:38,067 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:54:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 05:54:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-25 05:54:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 05:54:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-01-25 05:54:38,070 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 35 [2018-01-25 05:54:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:38,070 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-01-25 05:54:38,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:54:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-01-25 05:54:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:54:38,071 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:38,072 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:38,072 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322186, now seen corresponding path program 1 times [2018-01-25 05:54:38,072 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:38,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:38,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:38,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:38,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:38,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:38,136 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:54:38,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:38,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:54:38,136 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:38,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:54:38,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:54:38,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:38,137 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2018-01-25 05:54:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:38,283 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-01-25 05:54:38,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:54:38,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-25 05:54:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:38,284 INFO L225 Difference]: With dead ends: 75 [2018-01-25 05:54:38,284 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 05:54:38,284 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:54:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 05:54:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-25 05:54:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 05:54:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-01-25 05:54:38,289 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 35 [2018-01-25 05:54:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:38,289 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-01-25 05:54:38,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:54:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-01-25 05:54:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:54:38,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:38,290 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:38,290 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash 730389066, now seen corresponding path program 1 times [2018-01-25 05:54:38,291 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:38,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:38,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:38,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:38,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:38,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:38,531 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:54:38,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:38,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:54:38,531 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:38,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:54:38,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:54:38,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:54:38,532 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 10 states. [2018-01-25 05:54:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:38,770 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-01-25 05:54:38,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:54:38,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-25 05:54:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:38,771 INFO L225 Difference]: With dead ends: 74 [2018-01-25 05:54:38,771 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:54:38,772 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:54:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:54:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 05:54:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 05:54:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-01-25 05:54:38,777 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 37 [2018-01-25 05:54:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:38,778 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-01-25 05:54:38,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:54:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-01-25 05:54:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 05:54:38,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:38,779 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:38,779 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:54:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324108, now seen corresponding path program 1 times [2018-01-25 05:54:38,779 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:38,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:38,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:38,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:38,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:38,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:39,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:39,322 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:54:39,323 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-01-25 05:54:39,325 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [13], [15], [17], [22], [101], [102], [103], [104], [107], [110], [111], [116], [117], [121], [125], [126], [127], [129], [132], [133], [136], [137], [138], [139], [141], [142] [2018-01-25 05:54:39,373 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:54:39,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:55:33,610 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:55:33,611 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:55:33,612 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:55:33,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:55:33,612 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:55:33,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:33,618 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:55:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:33,674 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:55:33,687 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:55:33,688 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:55:33,694 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:55:33,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:55:33 BoogieIcfgContainer [2018-01-25 05:55:33,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:55:33,699 INFO L168 Benchmark]: Toolchain (without parser) took 59449.23 ms. Allocated memory was 304.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 264.0 MB in the beginning and 609.2 MB in the end (delta: -345.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-25 05:55:33,700 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:55:33,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.80 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:55:33,701 INFO L168 Benchmark]: Boogie Preprocessor took 34.27 ms. Allocated memory is still 304.1 MB. Free memory was 252.0 MB in the beginning and 251.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 05:55:33,701 INFO L168 Benchmark]: RCFGBuilder took 427.20 ms. Allocated memory is still 304.1 MB. Free memory was 251.0 MB in the beginning and 222.7 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:55:33,701 INFO L168 Benchmark]: TraceAbstraction took 58775.53 ms. Allocated memory was 304.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 221.7 MB in the beginning and 609.2 MB in the end (delta: -387.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-25 05:55:33,704 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.17 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.80 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.27 ms. Allocated memory is still 304.1 MB. Free memory was 252.0 MB in the beginning and 251.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 427.20 ms. Allocated memory is still 304.1 MB. Free memory was 251.0 MB in the beginning and 222.7 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58775.53 ms. Allocated memory was 304.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 221.7 MB in the beginning and 609.2 MB in the end (delta: -387.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 43 error locations. TIMEOUT Result, 58.7s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 981 SDtfs, 702 SDslu, 1761 SDs, 0 SdLazy, 1373 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 54.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 54 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 50609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-55-33-716.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-55-33-716.csv Completed graceful shutdown