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/memsafety/test-0232_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:42:14,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:42:14,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:42:14,236 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:42:14,237 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:42:14,238 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:42:14,239 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:42:14,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:42:14,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:42:14,244 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:42:14,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:42:14,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:42:14,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:42:14,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:42:14,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:42:14,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:42:14,253 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:42:14,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:42:14,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:42:14,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:42:14,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:42:14,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:42:14,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:42:14,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:42:14,263 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:42:14,264 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:42:14,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:42:14,265 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:42:14,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:42:14,266 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:42:14,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:42:14,267 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:42:14,276 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:42:14,277 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:42:14,277 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:42:14,278 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:42:14,278 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:42:14,278 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:42:14,278 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:42:14,278 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:42:14,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:42:14,279 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:42:14,279 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:42:14,279 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:42:14,279 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:42:14,279 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:42:14,280 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:42:14,280 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:42:14,280 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:42:14,280 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:42:14,280 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:42:14,280 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:42:14,280 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:42:14,281 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:42:14,281 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:42:14,281 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:42:14,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:42:14,281 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:42:14,282 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:42:14,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:42:14,282 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:42:14,282 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:42:14,282 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:42:14,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:42:14,282 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:42:14,282 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:42:14,283 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:42:14,283 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:42:14,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:42:14,328 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:42:14,332 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:42:14,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:42:14,333 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:42:14,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_true-valid-memsafety.i [2018-01-25 05:42:14,494 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:42:14,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:42:14,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:42:14,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:42:14,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:42:14,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:42:14" (1/1) ... [2018-01-25 05:42:14,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d17d7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14, skipping insertion in model container [2018-01-25 05:42:14,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:42:14" (1/1) ... [2018-01-25 05:42:14,533 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:42:14,573 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:42:14,681 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:42:14,695 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:42:14,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14 WrapperNode [2018-01-25 05:42:14,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:42:14,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:42:14,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:42:14,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:42:14,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14" (1/1) ... [2018-01-25 05:42:14,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14" (1/1) ... [2018-01-25 05:42:14,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14" (1/1) ... [2018-01-25 05:42:14,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14" (1/1) ... [2018-01-25 05:42:14,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14" (1/1) ... [2018-01-25 05:42:14,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14" (1/1) ... [2018-01-25 05:42:14,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14" (1/1) ... [2018-01-25 05:42:14,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:42:14,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:42:14,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:42:14,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:42:14,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14" (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:42:14,778 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:42:14,778 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:42:14,778 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 05:42:14,778 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:42:14,778 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:42:14,778 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:42:14,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:42:14,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:42:14,779 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:42:14,779 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:42:14,779 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:42:14,779 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:42:14,779 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 05:42:14,779 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:42:14,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:42:14,780 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:42:15,194 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:42:15,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:42:15 BoogieIcfgContainer [2018-01-25 05:42:15,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:42:15,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:42:15,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:42:15,197 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:42:15,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:42:14" (1/3) ... [2018-01-25 05:42:15,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e69e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:42:15, skipping insertion in model container [2018-01-25 05:42:15,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:42:14" (2/3) ... [2018-01-25 05:42:15,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e69e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:42:15, skipping insertion in model container [2018-01-25 05:42:15,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:42:15" (3/3) ... [2018-01-25 05:42:15,201 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_true-valid-memsafety.i [2018-01-25 05:42:15,207 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:42:15,213 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-01-25 05:42:15,257 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:42:15,257 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:42:15,257 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:42:15,257 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:42:15,257 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:42:15,258 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:42:15,258 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:42:15,258 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:42:15,258 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:42:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2018-01-25 05:42:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:42:15,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:15,285 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:42:15,285 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:15,289 INFO L82 PathProgramCache]: Analyzing trace with hash -473238968, now seen corresponding path program 1 times [2018-01-25 05:42:15,291 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:15,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:15,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:15,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:15,333 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:15,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:15,431 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:42:15,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:15,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:42:15,433 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:15,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:42:15,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:42:15,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:42:15,449 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 3 states. [2018-01-25 05:42:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:15,755 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2018-01-25 05:42:15,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:42:15,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:42:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:15,766 INFO L225 Difference]: With dead ends: 164 [2018-01-25 05:42:15,766 INFO L226 Difference]: Without dead ends: 99 [2018-01-25 05:42:15,770 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:42:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-25 05:42:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-01-25 05:42:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 05:42:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-01-25 05:42:15,814 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 7 [2018-01-25 05:42:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:15,815 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-01-25 05:42:15,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:42:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-01-25 05:42:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:42:15,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:15,816 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:42:15,816 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:15,816 INFO L82 PathProgramCache]: Analyzing trace with hash -473238967, now seen corresponding path program 1 times [2018-01-25 05:42:15,817 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:15,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:15,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:15,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:15,818 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:15,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:15,886 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:42:15,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:15,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:42:15,887 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:15,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:42:15,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:42:15,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:42:15,889 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 3 states. [2018-01-25 05:42:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:16,002 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-01-25 05:42:16,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:42:16,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:42:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:16,004 INFO L225 Difference]: With dead ends: 99 [2018-01-25 05:42:16,004 INFO L226 Difference]: Without dead ends: 98 [2018-01-25 05:42:16,005 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:42:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-25 05:42:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-01-25 05:42:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 05:42:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2018-01-25 05:42:16,015 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 7 [2018-01-25 05:42:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:16,015 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2018-01-25 05:42:16,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:42:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-01-25 05:42:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:42:16,016 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:16,016 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:42:16,017 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:16,017 INFO L82 PathProgramCache]: Analyzing trace with hash -799395641, now seen corresponding path program 1 times [2018-01-25 05:42:16,017 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:16,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:16,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:16,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:16,117 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:42:16,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:16,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:42:16,117 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:16,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:42:16,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:42:16,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:42:16,118 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 5 states. [2018-01-25 05:42:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:16,389 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-01-25 05:42:16,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:42:16,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 05:42:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:16,391 INFO L225 Difference]: With dead ends: 96 [2018-01-25 05:42:16,391 INFO L226 Difference]: Without dead ends: 93 [2018-01-25 05:42:16,391 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:42:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-25 05:42:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-25 05:42:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 05:42:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-25 05:42:16,400 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 13 [2018-01-25 05:42:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:16,401 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-25 05:42:16,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:42:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-25 05:42:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:42:16,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:16,402 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:42:16,402 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash -799395640, now seen corresponding path program 1 times [2018-01-25 05:42:16,402 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:16,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:16,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:16,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:16,518 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:42:16,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:16,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:42:16,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:16,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:42:16,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:42:16,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:42:16,520 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 7 states. [2018-01-25 05:42:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:16,700 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-01-25 05:42:16,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:42:16,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-01-25 05:42:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:16,702 INFO L225 Difference]: With dead ends: 93 [2018-01-25 05:42:16,702 INFO L226 Difference]: Without dead ends: 82 [2018-01-25 05:42:16,702 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:42:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-25 05:42:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-25 05:42:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 05:42:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-01-25 05:42:16,709 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 13 [2018-01-25 05:42:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:16,710 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-01-25 05:42:16,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:42:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-01-25 05:42:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:42:16,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:16,711 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:42:16,711 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash 988538978, now seen corresponding path program 1 times [2018-01-25 05:42:16,711 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:16,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:16,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,713 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:16,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:16,759 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:42:16,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:16,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:42:16,760 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:16,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:42:16,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:42:16,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:42:16,761 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 4 states. [2018-01-25 05:42:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:16,863 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-01-25 05:42:16,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:42:16,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:42:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:16,864 INFO L225 Difference]: With dead ends: 82 [2018-01-25 05:42:16,864 INFO L226 Difference]: Without dead ends: 78 [2018-01-25 05:42:16,864 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:42:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-25 05:42:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-25 05:42:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-25 05:42:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-25 05:42:16,872 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 14 [2018-01-25 05:42:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:16,872 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-25 05:42:16,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:42:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-25 05:42:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:42:16,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:16,873 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:42:16,874 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash 988538979, now seen corresponding path program 1 times [2018-01-25 05:42:16,874 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:16,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:16,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:16,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:16,924 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:42:16,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:16,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:42:16,925 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:16,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:42:16,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:42:16,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:42:16,925 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2018-01-25 05:42:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:16,982 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-01-25 05:42:16,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:42:16,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:42:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:16,983 INFO L225 Difference]: With dead ends: 78 [2018-01-25 05:42:16,983 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 05:42:16,983 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:42:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 05:42:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-25 05:42:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 05:42:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-01-25 05:42:16,989 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 14 [2018-01-25 05:42:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:16,990 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-01-25 05:42:16,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:42:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-01-25 05:42:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:42:16,991 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:16,991 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:42:16,991 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1876114930, now seen corresponding path program 1 times [2018-01-25 05:42:16,991 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:16,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:16,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:16,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:17,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:17,096 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:42:17,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:17,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:42:17,097 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:17,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:42:17,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:42:17,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:42:17,098 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 8 states. [2018-01-25 05:42:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:17,280 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-01-25 05:42:17,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:42:17,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 05:42:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:17,283 INFO L225 Difference]: With dead ends: 156 [2018-01-25 05:42:17,283 INFO L226 Difference]: Without dead ends: 89 [2018-01-25 05:42:17,284 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:42:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-25 05:42:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-01-25 05:42:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 05:42:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-25 05:42:17,293 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 19 [2018-01-25 05:42:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:17,293 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-25 05:42:17,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:42:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-25 05:42:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:42:17,295 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:17,295 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] [2018-01-25 05:42:17,295 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130712, now seen corresponding path program 1 times [2018-01-25 05:42:17,296 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:17,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:17,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:17,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:17,326 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:17,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:17,427 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:42:17,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:17,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:42:17,427 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:17,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:42:17,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:42:17,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:42:17,428 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 7 states. [2018-01-25 05:42:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:17,614 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-25 05:42:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:42:17,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 05:42:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:17,615 INFO L225 Difference]: With dead ends: 98 [2018-01-25 05:42:17,616 INFO L226 Difference]: Without dead ends: 97 [2018-01-25 05:42:17,616 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:42:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-25 05:42:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2018-01-25 05:42:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-25 05:42:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-25 05:42:17,622 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 30 [2018-01-25 05:42:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:17,622 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-25 05:42:17,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:42:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-25 05:42:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:42:17,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:17,624 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] [2018-01-25 05:42:17,624 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130713, now seen corresponding path program 1 times [2018-01-25 05:42:17,624 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:17,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:17,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:17,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:17,625 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:17,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:17,832 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:42:17,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:17,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:42:17,832 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:17,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:42:17,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:42:17,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:42:17,833 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 9 states. [2018-01-25 05:42:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:18,031 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-01-25 05:42:18,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:42:18,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 05:42:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:18,033 INFO L225 Difference]: With dead ends: 101 [2018-01-25 05:42:18,033 INFO L226 Difference]: Without dead ends: 100 [2018-01-25 05:42:18,033 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:42:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-25 05:42:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-01-25 05:42:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 05:42:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-25 05:42:18,038 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 30 [2018-01-25 05:42:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:18,038 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-25 05:42:18,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:42:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-25 05:42:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:42:18,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:18,039 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:42:18,039 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash 374430840, now seen corresponding path program 1 times [2018-01-25 05:42:18,040 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:18,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:18,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:18,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:18,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:18,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:18,100 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:42:18,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:18,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:42:18,101 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:18,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:42:18,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:42:18,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:42:18,102 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2018-01-25 05:42:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:18,165 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-25 05:42:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:42:18,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 05:42:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:18,166 INFO L225 Difference]: With dead ends: 108 [2018-01-25 05:42:18,166 INFO L226 Difference]: Without dead ends: 88 [2018-01-25 05:42:18,167 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:42:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-25 05:42:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-01-25 05:42:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-25 05:42:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-25 05:42:18,171 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 33 [2018-01-25 05:42:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:18,171 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-25 05:42:18,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:42:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-25 05:42:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:42:18,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:18,172 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:42:18,172 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash -486325487, now seen corresponding path program 1 times [2018-01-25 05:42:18,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:18,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:18,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:18,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:18,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:18,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:18,229 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:42:18,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:18,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:42:18,230 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:18,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:42:18,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:42:18,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:42:18,231 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 5 states. [2018-01-25 05:42:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:18,376 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-01-25 05:42:18,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:42:18,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 05:42:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:18,378 INFO L225 Difference]: With dead ends: 85 [2018-01-25 05:42:18,378 INFO L226 Difference]: Without dead ends: 84 [2018-01-25 05:42:18,378 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:42:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-25 05:42:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-25 05:42:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 05:42:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-25 05:42:18,384 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 33 [2018-01-25 05:42:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:18,384 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-25 05:42:18,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:42:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-25 05:42:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:42:18,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:18,386 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:42:18,386 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:18,386 INFO L82 PathProgramCache]: Analyzing trace with hash -486325486, now seen corresponding path program 1 times [2018-01-25 05:42:18,386 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:18,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:18,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:18,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:18,388 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:18,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:18,639 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:42:18,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:18,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:42:18,640 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:18,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:42:18,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:42:18,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:42:18,641 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 11 states. [2018-01-25 05:42:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:18,883 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-01-25 05:42:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:42:18,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-25 05:42:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:18,884 INFO L225 Difference]: With dead ends: 87 [2018-01-25 05:42:18,884 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 05:42:18,885 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-01-25 05:42:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 05:42:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-01-25 05:42:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-25 05:42:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-25 05:42:18,889 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 33 [2018-01-25 05:42:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:18,890 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-25 05:42:18,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:42:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-25 05:42:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:42:18,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:18,891 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] [2018-01-25 05:42:18,892 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779100, now seen corresponding path program 1 times [2018-01-25 05:42:18,892 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:18,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:18,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:18,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:18,893 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:18,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:19,225 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:42:19,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:19,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:42:19,226 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:19,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:42:19,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:42:19,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:42:19,227 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 15 states. [2018-01-25 05:42:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:19,997 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-25 05:42:19,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 05:42:19,998 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-25 05:42:19,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:19,999 INFO L225 Difference]: With dead ends: 122 [2018-01-25 05:42:19,999 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 05:42:20,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-01-25 05:42:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 05:42:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-01-25 05:42:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-25 05:42:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-25 05:42:20,005 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 34 [2018-01-25 05:42:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:20,006 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-25 05:42:20,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:42:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-25 05:42:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:42:20,007 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:20,007 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] [2018-01-25 05:42:20,007 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:20,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779101, now seen corresponding path program 1 times [2018-01-25 05:42:20,008 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:20,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:20,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:20,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:20,009 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:20,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:20,379 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:42:20,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:20,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:42:20,379 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:20,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:42:20,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:42:20,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:42:20,380 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 15 states. [2018-01-25 05:42:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:20,897 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-01-25 05:42:20,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 05:42:20,898 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-25 05:42:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:20,898 INFO L225 Difference]: With dead ends: 111 [2018-01-25 05:42:20,899 INFO L226 Difference]: Without dead ends: 110 [2018-01-25 05:42:20,899 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:42:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-25 05:42:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2018-01-25 05:42:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-25 05:42:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-25 05:42:20,906 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 34 [2018-01-25 05:42:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:20,906 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-25 05:42:20,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:42:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-25 05:42:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:42:20,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:20,908 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:42:20,908 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:20,908 INFO L82 PathProgramCache]: Analyzing trace with hash -950447499, now seen corresponding path program 1 times [2018-01-25 05:42:20,908 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:20,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:20,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:20,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:20,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:20,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:21,004 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:42:21,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:21,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:42:21,005 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:21,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:42:21,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:42:21,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:42:21,006 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 8 states. [2018-01-25 05:42:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:21,124 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-01-25 05:42:21,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:42:21,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-25 05:42:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:21,125 INFO L225 Difference]: With dead ends: 103 [2018-01-25 05:42:21,125 INFO L226 Difference]: Without dead ends: 95 [2018-01-25 05:42:21,125 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:42:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-25 05:42:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-25 05:42:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 05:42:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-01-25 05:42:21,133 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 35 [2018-01-25 05:42:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:21,133 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-01-25 05:42:21,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:42:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-01-25 05:42:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:42:21,134 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:21,134 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] [2018-01-25 05:42:21,135 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1197880803, now seen corresponding path program 1 times [2018-01-25 05:42:21,135 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:21,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:21,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:21,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:21,136 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:21,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:21,498 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:42:21,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:21,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:42:21,499 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:21,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:42:21,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:42:21,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:42:21,499 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 15 states. [2018-01-25 05:42:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:22,681 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-01-25 05:42:22,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 05:42:22,725 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 05:42:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:22,726 INFO L225 Difference]: With dead ends: 134 [2018-01-25 05:42:22,726 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 05:42:22,726 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-01-25 05:42:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 05:42:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 107. [2018-01-25 05:42:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-25 05:42:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-25 05:42:22,732 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 36 [2018-01-25 05:42:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:22,733 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-25 05:42:22,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:42:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-25 05:42:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:42:22,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:22,734 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:42:22,734 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400791, now seen corresponding path program 1 times [2018-01-25 05:42:22,734 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:22,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:22,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:22,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:22,735 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:22,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:22,832 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:42:22,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:22,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:42:22,832 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:22,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:42:22,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:42:22,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:42:22,833 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 8 states. [2018-01-25 05:42:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:22,971 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-01-25 05:42:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:42:22,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-25 05:42:22,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:22,972 INFO L225 Difference]: With dead ends: 107 [2018-01-25 05:42:22,972 INFO L226 Difference]: Without dead ends: 106 [2018-01-25 05:42:22,973 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:42:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-25 05:42:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-25 05:42:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 05:42:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-01-25 05:42:22,980 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 37 [2018-01-25 05:42:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:22,980 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-01-25 05:42:22,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:42:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-01-25 05:42:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:42:22,981 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:22,982 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:42:22,982 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400792, now seen corresponding path program 1 times [2018-01-25 05:42:22,982 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:22,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:22,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:22,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:22,983 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:23,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:23,583 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:42:23,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:42:23,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:42:23,584 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:42:23,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:42:23,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:42:23,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:42:23,584 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 15 states. [2018-01-25 05:42:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:42:24,023 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-25 05:42:24,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:42:24,023 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-01-25 05:42:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:42:24,024 INFO L225 Difference]: With dead ends: 117 [2018-01-25 05:42:24,024 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 05:42:24,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-01-25 05:42:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 05:42:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-01-25 05:42:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-25 05:42:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-25 05:42:24,031 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 37 [2018-01-25 05:42:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:42:24,031 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-25 05:42:24,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:42:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-25 05:42:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:42:24,032 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:42:24,032 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] [2018-01-25 05:42:24,033 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, 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:42:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash -482433028, now seen corresponding path program 1 times [2018-01-25 05:42:24,033 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:42:24,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:24,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:42:24,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:42:24,034 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:42:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:42:24,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:42:24,202 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:42:24,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:42:24,202 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:42:24,203 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 05:42:24,204 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [12], [15], [20], [97], [98], [99], [100], [103], [106], [107], [112], [113], [117], [121], [122], [123], [125], [128], [129], [132], [133], [134], [135], [137], [138] [2018-01-25 05:42:24,252 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:42:24,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown