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_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:36:07,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:36:07,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:36:07,475 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:36:07,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:36:07,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:36:07,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:36:07,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:36:07,481 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:36:07,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:36:07,483 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:36:07,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:36:07,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:36:07,485 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:36:07,486 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:36:07,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:36:07,491 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:36:07,493 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:36:07,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:36:07,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:36:07,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:36:07,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:36:07,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:36:07,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:36:07,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:36:07,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:36:07,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:36:07,502 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:36:07,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:36:07,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:36:07,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:36:07,503 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:36:07,512 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:36:07,512 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:36:07,513 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:36:07,513 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:36:07,513 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:36:07,513 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:36:07,513 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:36:07,513 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:36:07,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:36:07,514 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:36:07,514 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:36:07,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:36:07,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:36:07,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:36:07,514 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:36:07,515 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:36:07,515 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:36:07,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:36:07,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:36:07,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:36:07,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:36:07,515 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:36:07,515 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:36:07,516 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:36:07,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:36:07,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:36:07,516 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:36:07,516 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:36:07,517 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:36:07,517 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:36:07,517 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:36:07,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:36:07,517 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:36:07,517 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:36:07,518 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:36:07,518 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:36:07,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:36:07,563 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:36:07,566 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:36:07,567 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:36:07,568 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:36:07,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i [2018-01-25 05:36:07,755 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:36:07,759 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:36:07,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:36:07,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:36:07,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:36:07,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:36:07" (1/1) ... [2018-01-25 05:36:07,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f00f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07, skipping insertion in model container [2018-01-25 05:36:07,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:36:07" (1/1) ... [2018-01-25 05:36:07,783 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:36:07,821 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:36:07,941 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:36:07,957 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:36:07,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07 WrapperNode [2018-01-25 05:36:07,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:36:07,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:36:07,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:36:07,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:36:07,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07" (1/1) ... [2018-01-25 05:36:07,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07" (1/1) ... [2018-01-25 05:36:07,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07" (1/1) ... [2018-01-25 05:36:07,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07" (1/1) ... [2018-01-25 05:36:08,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07" (1/1) ... [2018-01-25 05:36:08,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07" (1/1) ... [2018-01-25 05:36:08,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07" (1/1) ... [2018-01-25 05:36:08,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:36:08,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:36:08,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:36:08,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:36:08,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07" (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:36:08,058 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:36:08,058 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:36:08,058 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 05:36:08,058 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:36:08,058 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:36:08,058 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:36:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:36:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:36:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:36:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:36:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:36:08,060 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:36:08,060 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 05:36:08,060 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:36:08,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:36:08,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:36:08,487 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:36:08,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:36:08 BoogieIcfgContainer [2018-01-25 05:36:08,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:36:08,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:36:08,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:36:08,491 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:36:08,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:36:07" (1/3) ... [2018-01-25 05:36:08,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ece38b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:36:08, skipping insertion in model container [2018-01-25 05:36:08,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:07" (2/3) ... [2018-01-25 05:36:08,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ece38b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:36:08, skipping insertion in model container [2018-01-25 05:36:08,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:36:08" (3/3) ... [2018-01-25 05:36:08,495 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-01-25 05:36:08,502 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:36:08,508 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-01-25 05:36:08,547 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:36:08,548 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:36:08,548 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:36:08,548 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:36:08,548 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:36:08,548 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:36:08,548 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:36:08,548 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:36:08,549 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:36:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2018-01-25 05:36:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:36:08,573 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:08,574 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:08,574 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 842410072, now seen corresponding path program 1 times [2018-01-25 05:36:08,579 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:08,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:08,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:08,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:08,620 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:08,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:08,711 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:36:08,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:08,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:36:08,713 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:08,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:36:08,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:36:08,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:36:08,727 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2018-01-25 05:36:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:08,941 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-01-25 05:36:08,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:36:08,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:36:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:08,957 INFO L225 Difference]: With dead ends: 188 [2018-01-25 05:36:08,957 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 05:36:08,961 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:36:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 05:36:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-01-25 05:36:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 05:36:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-01-25 05:36:09,009 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 7 [2018-01-25 05:36:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:09,009 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-01-25 05:36:09,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:36:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-01-25 05:36:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:36:09,010 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:09,010 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:09,010 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:09,010 INFO L82 PathProgramCache]: Analyzing trace with hash 842410073, now seen corresponding path program 1 times [2018-01-25 05:36:09,011 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:09,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:09,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:09,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:09,012 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:09,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:09,068 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:36:09,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:09,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:36:09,068 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:09,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:36:09,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:36:09,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:36:09,070 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 3 states. [2018-01-25 05:36:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:09,189 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-01-25 05:36:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:36:09,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:36:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:09,191 INFO L225 Difference]: With dead ends: 111 [2018-01-25 05:36:09,191 INFO L226 Difference]: Without dead ends: 110 [2018-01-25 05:36:09,192 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:36:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-25 05:36:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-01-25 05:36:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 05:36:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-01-25 05:36:09,203 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 7 [2018-01-25 05:36:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:09,204 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-01-25 05:36:09,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:36:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-01-25 05:36:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:36:09,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:09,205 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:09,205 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643303, now seen corresponding path program 1 times [2018-01-25 05:36:09,206 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:09,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:09,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:09,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:09,207 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:09,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:09,304 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:36:09,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:09,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:36:09,305 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:09,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:36:09,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:36:09,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:36:09,306 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 5 states. [2018-01-25 05:36:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:09,555 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-01-25 05:36:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:36:09,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 05:36:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:09,557 INFO L225 Difference]: With dead ends: 109 [2018-01-25 05:36:09,557 INFO L226 Difference]: Without dead ends: 106 [2018-01-25 05:36:09,558 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:36:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-25 05:36:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-01-25 05:36:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 05:36:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-25 05:36:09,566 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 13 [2018-01-25 05:36:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:09,567 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-25 05:36:09,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:36:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-25 05:36:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:36:09,567 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:09,568 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:09,568 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643304, now seen corresponding path program 1 times [2018-01-25 05:36:09,568 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:09,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:09,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:09,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:09,570 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:09,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:09,671 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:36:09,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:09,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:36:09,672 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:09,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:36:09,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:36:09,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:36:09,673 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 7 states. [2018-01-25 05:36:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:09,902 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-25 05:36:09,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:36:09,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-01-25 05:36:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:09,904 INFO L225 Difference]: With dead ends: 105 [2018-01-25 05:36:09,904 INFO L226 Difference]: Without dead ends: 93 [2018-01-25 05:36:09,904 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:36:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-25 05:36:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-25 05:36:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 05:36:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-01-25 05:36:09,910 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 13 [2018-01-25 05:36:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:09,910 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-01-25 05:36:09,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:36:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-01-25 05:36:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:36:09,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:09,911 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:09,911 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 132204114, now seen corresponding path program 1 times [2018-01-25 05:36:09,912 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:09,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:09,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:09,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:09,913 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:09,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:09,942 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:36:09,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:09,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:36:09,943 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:09,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:36:09,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:36:09,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:36:09,944 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 4 states. [2018-01-25 05:36:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:10,019 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-01-25 05:36:10,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:36:10,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:36:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:10,020 INFO L225 Difference]: With dead ends: 93 [2018-01-25 05:36:10,020 INFO L226 Difference]: Without dead ends: 89 [2018-01-25 05:36:10,021 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:36:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-25 05:36:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-25 05:36:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-25 05:36:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-25 05:36:10,028 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 14 [2018-01-25 05:36:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:10,028 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-25 05:36:10,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:36:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-25 05:36:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:36:10,029 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:10,029 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:10,029 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash 132204115, now seen corresponding path program 1 times [2018-01-25 05:36:10,030 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:10,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:10,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:10,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:10,031 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:10,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:10,099 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:36:10,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:10,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:36:10,099 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:10,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:36:10,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:36:10,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:36:10,100 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 4 states. [2018-01-25 05:36:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:10,149 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-01-25 05:36:10,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:36:10,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:36:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:10,150 INFO L225 Difference]: With dead ends: 89 [2018-01-25 05:36:10,150 INFO L226 Difference]: Without dead ends: 85 [2018-01-25 05:36:10,150 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:36:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-25 05:36:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-25 05:36:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-25 05:36:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-25 05:36:10,155 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 14 [2018-01-25 05:36:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:10,155 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-25 05:36:10,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:36:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-25 05:36:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:36:10,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:10,156 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:36:10,157 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1054600686, now seen corresponding path program 1 times [2018-01-25 05:36:10,157 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:10,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:10,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:10,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:10,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:10,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:10,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:10,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:36:10,253 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:10,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:36:10,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:36:10,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:36:10,253 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 8 states. [2018-01-25 05:36:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:10,461 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-01-25 05:36:10,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:36:10,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 05:36:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:10,463 INFO L225 Difference]: With dead ends: 178 [2018-01-25 05:36:10,464 INFO L226 Difference]: Without dead ends: 100 [2018-01-25 05:36:10,465 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:36:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-25 05:36:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2018-01-25 05:36:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 05:36:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-25 05:36:10,476 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 19 [2018-01-25 05:36:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:10,477 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-25 05:36:10,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:36:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-25 05:36:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:36:10,479 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:10,479 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:36:10,479 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash -882655928, now seen corresponding path program 1 times [2018-01-25 05:36:10,480 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:10,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:10,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:10,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:10,481 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:10,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:10,587 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:36:10,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:10,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:36:10,587 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:10,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:36:10,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:36:10,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:36:10,589 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-01-25 05:36:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:10,804 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-25 05:36:10,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:36:10,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 05:36:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:10,805 INFO L225 Difference]: With dead ends: 117 [2018-01-25 05:36:10,805 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 05:36:10,806 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:36:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 05:36:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-01-25 05:36:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 05:36:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-25 05:36:10,812 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 30 [2018-01-25 05:36:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:10,812 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-25 05:36:10,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:36:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-25 05:36:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:36:10,813 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:10,813 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:36:10,813 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash -882655927, now seen corresponding path program 1 times [2018-01-25 05:36:10,813 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:10,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:10,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:10,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:10,814 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:10,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:11,017 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:36:11,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:11,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:36:11,017 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:11,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:36:11,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:36:11,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:36:11,018 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 9 states. [2018-01-25 05:36:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:11,196 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-01-25 05:36:11,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:36:11,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 05:36:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:11,198 INFO L225 Difference]: With dead ends: 123 [2018-01-25 05:36:11,198 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 05:36:11,199 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:36:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 05:36:11,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2018-01-25 05:36:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 05:36:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-01-25 05:36:11,204 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 30 [2018-01-25 05:36:11,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:11,204 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-01-25 05:36:11,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:36:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-01-25 05:36:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:36:11,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:11,206 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:36:11,206 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:11,206 INFO L82 PathProgramCache]: Analyzing trace with hash -552202616, now seen corresponding path program 1 times [2018-01-25 05:36:11,206 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:11,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:11,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:11,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:11,207 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:11,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:11,267 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:36:11,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:11,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:36:11,268 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:11,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:36:11,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:36:11,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:36:11,269 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 5 states. [2018-01-25 05:36:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:11,335 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-01-25 05:36:11,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:36:11,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 05:36:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:11,337 INFO L225 Difference]: With dead ends: 130 [2018-01-25 05:36:11,337 INFO L226 Difference]: Without dead ends: 99 [2018-01-25 05:36:11,337 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:36:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-25 05:36:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-01-25 05:36:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 05:36:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-25 05:36:11,342 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 33 [2018-01-25 05:36:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:11,342 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-25 05:36:11,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:36:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-25 05:36:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:36:11,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:11,344 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:36:11,344 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958943, now seen corresponding path program 1 times [2018-01-25 05:36:11,344 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:11,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:11,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:11,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:11,346 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:11,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:11,404 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:36:11,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:11,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:36:11,404 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:11,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:36:11,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:36:11,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:36:11,405 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 5 states. [2018-01-25 05:36:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:11,570 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-01-25 05:36:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:36:11,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 05:36:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:11,572 INFO L225 Difference]: With dead ends: 96 [2018-01-25 05:36:11,572 INFO L226 Difference]: Without dead ends: 95 [2018-01-25 05:36:11,572 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:36:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-25 05:36:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-25 05:36:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 05:36:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-25 05:36:11,577 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 33 [2018-01-25 05:36:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:11,577 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-25 05:36:11,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:36:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-25 05:36:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:36:11,578 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:11,578 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:36:11,578 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958942, now seen corresponding path program 1 times [2018-01-25 05:36:11,579 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:11,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:11,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:11,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:11,580 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:11,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:11,782 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:36:11,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:11,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:36:11,783 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:11,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:36:11,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:36:11,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:36:11,784 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 11 states. [2018-01-25 05:36:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:12,162 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-25 05:36:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:36:12,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-25 05:36:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:12,164 INFO L225 Difference]: With dead ends: 98 [2018-01-25 05:36:12,164 INFO L226 Difference]: Without dead ends: 97 [2018-01-25 05:36:12,164 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:36:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-25 05:36:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-01-25 05:36:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 05:36:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-25 05:36:12,169 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 33 [2018-01-25 05:36:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:12,169 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-25 05:36:12,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:36:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-25 05:36:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:36:12,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:12,171 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:36:12,171 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -852054260, now seen corresponding path program 1 times [2018-01-25 05:36:12,171 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:12,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:12,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:12,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:12,177 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:12,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:12,555 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:36:12,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:12,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:36:12,555 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:12,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:36:12,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:36:12,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:36:12,556 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 15 states. [2018-01-25 05:36:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:13,139 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-01-25 05:36:13,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 05:36:13,139 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-25 05:36:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:13,141 INFO L225 Difference]: With dead ends: 133 [2018-01-25 05:36:13,141 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 05:36:13,141 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-01-25 05:36:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 05:36:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 109. [2018-01-25 05:36:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 05:36:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-25 05:36:13,152 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 34 [2018-01-25 05:36:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:13,153 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-25 05:36:13,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:36:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-25 05:36:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:36:13,154 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:13,154 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:36:13,154 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:13,155 INFO L82 PathProgramCache]: Analyzing trace with hash -852054259, now seen corresponding path program 1 times [2018-01-25 05:36:13,155 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:13,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:13,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:13,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:13,156 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:13,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:13,494 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 20 DAG size of output 17 [2018-01-25 05:36:13,656 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:36:13,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:13,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:36:13,656 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:13,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:36:13,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:36:13,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:36:13,658 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 15 states. [2018-01-25 05:36:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:14,130 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-01-25 05:36:14,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 05:36:14,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-25 05:36:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:14,132 INFO L225 Difference]: With dead ends: 122 [2018-01-25 05:36:14,132 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 05:36:14,132 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:36:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 05:36:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-01-25 05:36:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 05:36:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-25 05:36:14,138 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 34 [2018-01-25 05:36:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:14,138 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-25 05:36:14,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:36:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-25 05:36:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:36:14,139 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:14,139 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:36:14,139 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:14,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1908491397, now seen corresponding path program 1 times [2018-01-25 05:36:14,139 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:14,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:14,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:14,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:14,140 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:14,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:14,206 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:36:14,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:14,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:36:14,206 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:14,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:36:14,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:36:14,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:36:14,207 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 8 states. [2018-01-25 05:36:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:14,347 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-25 05:36:14,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:36:14,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-25 05:36:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:14,348 INFO L225 Difference]: With dead ends: 114 [2018-01-25 05:36:14,348 INFO L226 Difference]: Without dead ends: 106 [2018-01-25 05:36:14,348 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:36:14,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-25 05:36:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-25 05:36:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 05:36:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-25 05:36:14,354 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 35 [2018-01-25 05:36:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:14,355 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-25 05:36:14,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:36:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-25 05:36:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:36:14,356 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:14,356 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:36:14,356 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1514610189, now seen corresponding path program 1 times [2018-01-25 05:36:14,356 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:14,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:14,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:14,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:14,357 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:14,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:14,707 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:36:14,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:14,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:36:14,708 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:14,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:36:14,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:36:14,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:36:14,709 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 15 states. [2018-01-25 05:36:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:15,629 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-25 05:36:15,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 05:36:15,629 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 05:36:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:15,630 INFO L225 Difference]: With dead ends: 145 [2018-01-25 05:36:15,630 INFO L226 Difference]: Without dead ends: 144 [2018-01-25 05:36:15,630 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-01-25 05:36:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-25 05:36:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2018-01-25 05:36:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 05:36:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-25 05:36:15,638 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 36 [2018-01-25 05:36:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:15,638 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-25 05:36:15,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:36:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-25 05:36:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:36:15,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:15,639 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:36:15,639 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash -291724377, now seen corresponding path program 1 times [2018-01-25 05:36:15,640 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:15,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:15,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:15,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:15,641 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:15,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:15,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:15,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:36:15,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:15,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:36:15,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:36:15,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:36:15,719 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 8 states. [2018-01-25 05:36:15,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:15,832 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-01-25 05:36:15,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:36:15,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-25 05:36:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:15,834 INFO L225 Difference]: With dead ends: 118 [2018-01-25 05:36:15,834 INFO L226 Difference]: Without dead ends: 117 [2018-01-25 05:36:15,835 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:36:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-25 05:36:15,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-25 05:36:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-25 05:36:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-01-25 05:36:15,839 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 37 [2018-01-25 05:36:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:15,839 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-01-25 05:36:15,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:36:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-01-25 05:36:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:36:15,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:15,840 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:36:15,840 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash -291724376, now seen corresponding path program 1 times [2018-01-25 05:36:15,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:15,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:15,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:15,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:15,841 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:15,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:16,233 WARN L146 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 23 DAG size of output 18 [2018-01-25 05:36:16,452 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:36:16,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:16,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 05:36:16,453 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:16,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:36:16,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:36:16,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:36:16,454 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 15 states. [2018-01-25 05:36:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:16,990 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-25 05:36:16,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:36:16,991 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-01-25 05:36:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:16,991 INFO L225 Difference]: With dead ends: 128 [2018-01-25 05:36:16,992 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 05:36:16,992 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-01-25 05:36:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 05:36:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-01-25 05:36:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 05:36:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-25 05:36:16,998 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 37 [2018-01-25 05:36:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:16,999 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-25 05:36:16,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:36:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-25 05:36:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:36:16,999 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:16,999 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:36:16,999 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:36:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1900218884, now seen corresponding path program 1 times [2018-01-25 05:36:17,000 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:17,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:17,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:17,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:17,001 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:17,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:17,149 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:36:17,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:17,150 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:17,150 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 05:36:17,152 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [12], [15], [20], [113], [114], [115], [116], [119], [122], [123], [128], [129], [133], [137], [138], [139], [141], [144], [145], [148], [149], [150], [151], [153], [154] [2018-01-25 05:36:17,201 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:36:17,201 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