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_precise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:29:00,790 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:29:00,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:29:00,807 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:29:00,807 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:29:00,809 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:29:00,810 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:29:00,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:29:00,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:29:00,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:29:00,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:29:00,817 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:29:00,818 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:29:00,819 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:29:00,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:29:00,823 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:29:00,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:29:00,827 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:29:00,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:29:00,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:29:00,831 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:29:00,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:29:00,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:29:00,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:29:00,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:29:00,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:29:00,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:29:00,835 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:29:00,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:29:00,835 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:29:00,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:29:00,836 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_precise.epf [2018-01-24 23:29:00,845 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:29:00,846 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:29:00,846 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:29:00,847 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:29:00,847 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:29:00,847 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:29:00,847 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:29:00,847 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:29:00,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:29:00,848 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:29:00,848 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:29:00,848 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:29:00,849 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:29:00,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:29:00,849 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:29:00,849 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:29:00,849 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:29:00,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:29:00,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:29:00,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:29:00,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:29:00,850 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:29:00,850 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:29:00,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:29:00,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:29:00,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:29:00,851 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:29:00,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:29:00,852 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:29:00,852 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:29:00,852 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:29:00,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:29:00,852 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:29:00,852 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:29:00,853 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:29:00,853 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:29:00,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:29:00,901 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:29:00,905 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:29:00,907 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:29:00,907 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:29:00,908 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-24 23:29:01,091 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:29:01,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:29:01,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:29:01,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:29:01,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:29:01,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:29:01" (1/1) ... [2018-01-24 23:29:01,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1e8e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01, skipping insertion in model container [2018-01-24 23:29:01,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:29:01" (1/1) ... [2018-01-24 23:29:01,127 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:29:01,169 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:29:01,293 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:29:01,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:29:01,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01 WrapperNode [2018-01-24 23:29:01,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:29:01,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:29:01,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:29:01,318 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:29:01,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01" (1/1) ... [2018-01-24 23:29:01,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01" (1/1) ... [2018-01-24 23:29:01,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01" (1/1) ... [2018-01-24 23:29:01,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01" (1/1) ... [2018-01-24 23:29:01,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01" (1/1) ... [2018-01-24 23:29:01,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01" (1/1) ... [2018-01-24 23:29:01,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01" (1/1) ... [2018-01-24 23:29:01,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:29:01,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:29:01,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:29:01,362 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:29:01,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01" (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-24 23:29:01,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:29:01,423 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:29:01,423 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 23:29:01,423 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:29:01,423 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 23:29:01,423 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 23:29:01,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:29:01,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:29:01,424 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:29:01,424 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 23:29:01,424 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 23:29:01,424 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:29:01,424 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 23:29:01,425 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:29:01,425 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:29:01,425 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:29:01,884 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:29:01,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:29:01 BoogieIcfgContainer [2018-01-24 23:29:01,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:29:01,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:29:01,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:29:01,888 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:29:01,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:29:01" (1/3) ... [2018-01-24 23:29:01,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5041d557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:29:01, skipping insertion in model container [2018-01-24 23:29:01,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:29:01" (2/3) ... [2018-01-24 23:29:01,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5041d557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:29:01, skipping insertion in model container [2018-01-24 23:29:01,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:29:01" (3/3) ... [2018-01-24 23:29:01,892 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-01-24 23:29:01,900 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:29:01,907 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-01-24 23:29:01,949 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:29:01,950 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:29:01,950 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:29:01,950 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:29:01,950 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:29:01,950 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:29:01,950 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:29:01,950 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:29:01,951 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:29:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2018-01-24 23:29:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 23:29:01,978 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:01,979 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:29:01,979 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-24 23:29:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash 842410072, now seen corresponding path program 1 times [2018-01-24 23:29:01,985 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:02,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:02,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:02,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:02,030 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:02,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:02,127 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-24 23:29:02,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:02,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:29:02,130 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:02,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:29:02,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:29:02,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:29:02,146 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2018-01-24 23:29:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:02,446 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-01-24 23:29:02,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:29:02,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 23:29:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:02,457 INFO L225 Difference]: With dead ends: 188 [2018-01-24 23:29:02,457 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 23:29:02,460 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-24 23:29:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 23:29:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-01-24 23:29:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 23:29:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-01-24 23:29:02,506 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 7 [2018-01-24 23:29:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:02,507 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-01-24 23:29:02,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:29:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-01-24 23:29:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 23:29:02,507 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:02,507 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:29:02,508 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-24 23:29:02,508 INFO L82 PathProgramCache]: Analyzing trace with hash 842410073, now seen corresponding path program 1 times [2018-01-24 23:29:02,508 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:02,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:02,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:02,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:02,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:02,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:02,574 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-24 23:29:02,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:02,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:29:02,575 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:02,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:29:02,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:29:02,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:29:02,577 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 3 states. [2018-01-24 23:29:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:02,688 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-01-24 23:29:02,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:29:02,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 23:29:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:02,690 INFO L225 Difference]: With dead ends: 111 [2018-01-24 23:29:02,691 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 23:29:02,692 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-24 23:29:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 23:29:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-01-24 23:29:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 23:29:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-01-24 23:29:02,701 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 7 [2018-01-24 23:29:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:02,702 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-01-24 23:29:02,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:29:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-01-24 23:29:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:29:02,702 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:02,702 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:29:02,703 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-24 23:29:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643303, now seen corresponding path program 1 times [2018-01-24 23:29:02,703 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:02,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:02,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:02,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:02,705 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:02,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:02,815 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-24 23:29:02,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:02,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:29:02,815 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:02,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:29:02,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:29:02,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:29:02,816 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 5 states. [2018-01-24 23:29:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:03,057 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-01-24 23:29:03,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:29:03,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 23:29:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:03,059 INFO L225 Difference]: With dead ends: 109 [2018-01-24 23:29:03,059 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 23:29:03,060 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-24 23:29:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 23:29:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-01-24 23:29:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 23:29:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-24 23:29:03,069 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 13 [2018-01-24 23:29:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:03,070 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-24 23:29:03,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:29:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-24 23:29:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:29:03,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:03,071 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:29:03,071 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-24 23:29:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643304, now seen corresponding path program 1 times [2018-01-24 23:29:03,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:03,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:03,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:03,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:03,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:03,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:03,179 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-24 23:29:03,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:03,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:29:03,180 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:03,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:29:03,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:29:03,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:29:03,181 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 7 states. [2018-01-24 23:29:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:03,418 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-24 23:29:03,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:29:03,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-01-24 23:29:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:03,420 INFO L225 Difference]: With dead ends: 105 [2018-01-24 23:29:03,420 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 23:29:03,420 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-24 23:29:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 23:29:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-24 23:29:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 23:29:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-01-24 23:29:03,426 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 13 [2018-01-24 23:29:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:03,426 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-01-24 23:29:03,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:29:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-01-24 23:29:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:29:03,427 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:03,427 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:29:03,427 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-24 23:29:03,428 INFO L82 PathProgramCache]: Analyzing trace with hash 132204114, now seen corresponding path program 1 times [2018-01-24 23:29:03,428 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:03,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:03,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:03,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:03,429 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:03,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:03,460 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-24 23:29:03,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:03,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:29:03,461 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:03,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:29:03,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:29:03,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:29:03,462 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 4 states. [2018-01-24 23:29:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:03,541 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-01-24 23:29:03,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:29:03,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:29:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:03,543 INFO L225 Difference]: With dead ends: 93 [2018-01-24 23:29:03,543 INFO L226 Difference]: Without dead ends: 89 [2018-01-24 23:29:03,543 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-24 23:29:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-24 23:29:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-24 23:29:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 23:29:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-24 23:29:03,550 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 14 [2018-01-24 23:29:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:03,550 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-24 23:29:03,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:29:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-24 23:29:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:29:03,551 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:03,551 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:29:03,551 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-24 23:29:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash 132204115, now seen corresponding path program 1 times [2018-01-24 23:29:03,552 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:03,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:03,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:03,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:03,553 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:03,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:03,626 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-24 23:29:03,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:03,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:29:03,626 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:03,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:29:03,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:29:03,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:29:03,627 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 4 states. [2018-01-24 23:29:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:03,675 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-01-24 23:29:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:29:03,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:29:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:03,676 INFO L225 Difference]: With dead ends: 89 [2018-01-24 23:29:03,676 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 23:29:03,676 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-24 23:29:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 23:29:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-24 23:29:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 23:29:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-24 23:29:03,684 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 14 [2018-01-24 23:29:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:03,684 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-24 23:29:03,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:29:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-24 23:29:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:29:03,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:03,685 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-24 23:29:03,685 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-24 23:29:03,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1054600686, now seen corresponding path program 1 times [2018-01-24 23:29:03,686 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:03,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:03,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:03,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:03,687 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:03,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:03,793 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-24 23:29:03,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:03,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:29:03,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:03,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:29:03,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:29:03,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:29:03,794 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 8 states. [2018-01-24 23:29:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:04,025 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-01-24 23:29:04,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:29:04,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 23:29:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:04,026 INFO L225 Difference]: With dead ends: 178 [2018-01-24 23:29:04,027 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 23:29:04,028 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-24 23:29:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 23:29:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2018-01-24 23:29:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 23:29:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-24 23:29:04,036 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 19 [2018-01-24 23:29:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:04,036 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-24 23:29:04,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:29:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-24 23:29:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 23:29:04,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:04,039 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:29:04,039 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-24 23:29:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash -882655928, now seen corresponding path program 1 times [2018-01-24 23:29:04,039 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:04,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:04,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:04,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:04,040 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:04,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:04,143 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-24 23:29:04,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:04,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:29:04,144 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:04,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:29:04,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:29:04,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:29:04,145 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-01-24 23:29:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:04,329 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-24 23:29:04,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:29:04,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 23:29:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:04,330 INFO L225 Difference]: With dead ends: 117 [2018-01-24 23:29:04,330 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 23:29:04,331 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-24 23:29:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 23:29:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-01-24 23:29:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 23:29:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-24 23:29:04,337 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 30 [2018-01-24 23:29:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:04,337 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-24 23:29:04,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:29:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-24 23:29:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 23:29:04,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:04,339 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-24 23:29:04,339 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-24 23:29:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash -882655927, now seen corresponding path program 1 times [2018-01-24 23:29:04,340 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:04,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:04,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:04,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:04,341 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:04,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:04,519 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-24 23:29:04,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:04,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:29:04,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:04,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:29:04,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:29:04,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:29:04,520 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 9 states. [2018-01-24 23:29:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:04,709 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-01-24 23:29:04,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 23:29:04,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 23:29:04,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:04,710 INFO L225 Difference]: With dead ends: 123 [2018-01-24 23:29:04,710 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 23:29:04,710 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-24 23:29:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 23:29:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2018-01-24 23:29:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 23:29:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-01-24 23:29:04,717 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 30 [2018-01-24 23:29:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:04,717 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-01-24 23:29:04,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:29:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-01-24 23:29:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:29:04,718 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:04,718 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-24 23:29:04,718 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-24 23:29:04,719 INFO L82 PathProgramCache]: Analyzing trace with hash -552202616, now seen corresponding path program 1 times [2018-01-24 23:29:04,719 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:04,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:04,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:04,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:04,720 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:04,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:04,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-24 23:29:04,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:04,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:29:04,783 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:04,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:29:04,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:29:04,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:29:04,784 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 5 states. [2018-01-24 23:29:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:04,898 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-01-24 23:29:04,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:29:04,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 23:29:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:04,899 INFO L225 Difference]: With dead ends: 130 [2018-01-24 23:29:04,899 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 23:29:04,900 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-24 23:29:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 23:29:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-01-24 23:29:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 23:29:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-24 23:29:04,905 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 33 [2018-01-24 23:29:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:04,906 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-24 23:29:04,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:29:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-24 23:29:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:29:04,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:04,908 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:29:04,908 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-24 23:29:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958943, now seen corresponding path program 1 times [2018-01-24 23:29:04,908 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:04,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:04,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:04,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:04,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:04,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:04,980 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-24 23:29:04,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:04,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:29:04,981 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:04,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:29:04,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:29:04,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:29:04,981 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 5 states. [2018-01-24 23:29:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:05,174 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-01-24 23:29:05,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:29:05,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 23:29:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:05,175 INFO L225 Difference]: With dead ends: 96 [2018-01-24 23:29:05,175 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 23:29:05,175 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-24 23:29:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 23:29:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-24 23:29:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 23:29:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-24 23:29:05,180 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 33 [2018-01-24 23:29:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:05,181 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-24 23:29:05,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:29:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-24 23:29:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:29:05,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:05,182 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-24 23:29:05,183 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-24 23:29:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958942, now seen corresponding path program 1 times [2018-01-24 23:29:05,183 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:05,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:05,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:05,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:05,184 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:05,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:05,424 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-24 23:29:05,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:05,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 23:29:05,424 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:05,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 23:29:05,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 23:29:05,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:29:05,426 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 11 states. [2018-01-24 23:29:05,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:05,699 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-24 23:29:05,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 23:29:05,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-24 23:29:05,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:05,701 INFO L225 Difference]: With dead ends: 98 [2018-01-24 23:29:05,701 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 23:29:05,702 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-24 23:29:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 23:29:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-01-24 23:29:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 23:29:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-24 23:29:05,708 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 33 [2018-01-24 23:29:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:05,708 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-24 23:29:05,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 23:29:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-24 23:29:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 23:29:05,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:05,710 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-24 23:29:05,710 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-24 23:29:05,710 INFO L82 PathProgramCache]: Analyzing trace with hash -852054260, now seen corresponding path program 1 times [2018-01-24 23:29:05,710 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:05,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:05,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:05,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:05,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:05,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:06,150 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 29 DAG size of output 27 [2018-01-24 23:29:06,301 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-24 23:29:06,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:06,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:29:06,301 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:06,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:29:06,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:29:06,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:29:06,302 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 15 states. [2018-01-24 23:29:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:06,922 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-01-24 23:29:06,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 23:29:06,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 23:29:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:06,924 INFO L225 Difference]: With dead ends: 133 [2018-01-24 23:29:06,924 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 23:29:06,925 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-01-24 23:29:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 23:29:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 109. [2018-01-24 23:29:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 23:29:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-24 23:29:06,930 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 34 [2018-01-24 23:29:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:06,930 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-24 23:29:06,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:29:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-24 23:29:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 23:29:06,931 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:06,931 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-24 23:29:06,932 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-24 23:29:06,932 INFO L82 PathProgramCache]: Analyzing trace with hash -852054259, now seen corresponding path program 1 times [2018-01-24 23:29:06,932 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:06,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:06,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:06,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:06,933 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:06,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:07,220 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-24 23:29:07,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:07,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:29:07,220 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:07,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:29:07,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:29:07,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:29:07,221 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 15 states. [2018-01-24 23:29:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:07,724 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-01-24 23:29:07,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 23:29:07,724 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 23:29:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:07,725 INFO L225 Difference]: With dead ends: 122 [2018-01-24 23:29:07,725 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 23:29:07,726 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-24 23:29:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 23:29:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-01-24 23:29:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 23:29:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-24 23:29:07,731 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 34 [2018-01-24 23:29:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:07,731 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-24 23:29:07,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:29:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-24 23:29:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 23:29:07,732 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:07,732 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-24 23:29:07,738 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-24 23:29:07,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1908491397, now seen corresponding path program 1 times [2018-01-24 23:29:07,738 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:07,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:07,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:07,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:07,739 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:07,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:07,830 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-24 23:29:07,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:07,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:29:07,831 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:07,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:29:07,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:29:07,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:29:07,831 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 8 states. [2018-01-24 23:29:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:08,012 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-24 23:29:08,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:29:08,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-24 23:29:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:08,013 INFO L225 Difference]: With dead ends: 114 [2018-01-24 23:29:08,013 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 23:29:08,013 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-24 23:29:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 23:29:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-24 23:29:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 23:29:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-24 23:29:08,057 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 35 [2018-01-24 23:29:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:08,058 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-24 23:29:08,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:29:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-24 23:29:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 23:29:08,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:08,059 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-24 23:29:08,059 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-24 23:29:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1514610189, now seen corresponding path program 1 times [2018-01-24 23:29:08,060 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:08,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:08,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:08,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:08,061 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:08,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:08,412 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-24 23:29:08,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:08,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:29:08,412 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:08,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:29:08,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:29:08,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:29:08,413 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 15 states. [2018-01-24 23:29:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:09,396 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-24 23:29:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 23:29:09,396 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 23:29:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:09,397 INFO L225 Difference]: With dead ends: 145 [2018-01-24 23:29:09,397 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 23:29:09,398 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-01-24 23:29:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 23:29:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2018-01-24 23:29:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 23:29:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-24 23:29:09,406 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 36 [2018-01-24 23:29:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:09,406 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-24 23:29:09,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:29:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-24 23:29:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 23:29:09,407 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:09,408 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-24 23:29:09,408 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-24 23:29:09,408 INFO L82 PathProgramCache]: Analyzing trace with hash -291724377, now seen corresponding path program 1 times [2018-01-24 23:29:09,408 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:09,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:09,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:09,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:09,409 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:09,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:09,491 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-24 23:29:09,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:09,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:29:09,492 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:09,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:29:09,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:29:09,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:29:09,493 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 8 states. [2018-01-24 23:29:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:09,728 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-01-24 23:29:09,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:29:09,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-24 23:29:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:09,730 INFO L225 Difference]: With dead ends: 118 [2018-01-24 23:29:09,730 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 23:29:09,731 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-24 23:29:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 23:29:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-24 23:29:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 23:29:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-01-24 23:29:09,736 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 37 [2018-01-24 23:29:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:09,736 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-01-24 23:29:09,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:29:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-01-24 23:29:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 23:29:09,737 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:09,737 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-24 23:29:09,737 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-24 23:29:09,737 INFO L82 PathProgramCache]: Analyzing trace with hash -291724376, now seen corresponding path program 1 times [2018-01-24 23:29:09,737 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:09,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:09,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:09,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:09,739 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:09,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:10,076 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 19 DAG size of output 13 [2018-01-24 23:29:10,295 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 23 DAG size of output 18 [2018-01-24 23:29:10,526 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 22 DAG size of output 17 [2018-01-24 23:29:10,741 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 22 DAG size of output 17 [2018-01-24 23:29:10,905 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-24 23:29:10,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:29:10,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:29:10,905 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:29:10,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:29:10,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:29:10,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:29:10,906 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 15 states. [2018-01-24 23:29:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:29:11,526 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-24 23:29:11,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 23:29:11,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-01-24 23:29:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:29:11,527 INFO L225 Difference]: With dead ends: 128 [2018-01-24 23:29:11,527 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 23:29:11,534 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-01-24 23:29:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 23:29:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-01-24 23:29:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 23:29:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-24 23:29:11,540 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 37 [2018-01-24 23:29:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:29:11,540 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-24 23:29:11,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:29:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-24 23:29:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 23:29:11,541 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:29:11,541 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-24 23:29:11,541 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-24 23:29:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1900218884, now seen corresponding path program 1 times [2018-01-24 23:29:11,541 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:29:11,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:11,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:29:11,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:29:11,542 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:29:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:29:11,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:29:11,693 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-24 23:29:11,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:29:11,694 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:29:11,694 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 23:29:11,696 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-24 23:29:11,740 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:29:11,740 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