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_preciseopt.epf -i ../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:04:03,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:04:03,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:04:03,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:04:03,247 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:04:03,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:04:03,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:04:03,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:04:03,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:04:03,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:04:03,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:04:03,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:04:03,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:04:03,256 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:04:03,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:04:03,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:04:03,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:04:03,264 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:04:03,265 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:04:03,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:04:03,269 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:04:03,270 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:04:03,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:04:03,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:04:03,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:04:03,273 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:04:03,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:04:03,274 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:04:03,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:04:03,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:04:03,276 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:04:03,276 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_preciseopt.epf [2018-01-25 03:04:03,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:04:03,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:04:03,287 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:04:03,288 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:04:03,288 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:04:03,288 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:04:03,288 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:04:03,288 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:04:03,288 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:04:03,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:04:03,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:04:03,290 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:04:03,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:04:03,290 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:04:03,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:04:03,290 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:04:03,291 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:04:03,291 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:04:03,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:04:03,291 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:04:03,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:04:03,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:04:03,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:04:03,292 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:04:03,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:04:03,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:04:03,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:04:03,293 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:04:03,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:04:03,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:04:03,293 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:04:03,293 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:04:03,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:04:03,294 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:04:03,294 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:04:03,295 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:04:03,295 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:04:03,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:04:03,343 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:04:03,348 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:04:03,350 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:04:03,350 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:04:03,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-01-25 03:04:03,541 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:04:03,548 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:04:03,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:04:03,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:04:03,555 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:04:03,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:04:03" (1/1) ... [2018-01-25 03:04:03,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eaa2765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03, skipping insertion in model container [2018-01-25 03:04:03,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:04:03" (1/1) ... [2018-01-25 03:04:03,579 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:04:03,622 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:04:03,751 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:04:03,769 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:04:03,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03 WrapperNode [2018-01-25 03:04:03,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:04:03,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:04:03,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:04:03,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:04:03,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03" (1/1) ... [2018-01-25 03:04:03,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03" (1/1) ... [2018-01-25 03:04:03,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03" (1/1) ... [2018-01-25 03:04:03,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03" (1/1) ... [2018-01-25 03:04:03,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03" (1/1) ... [2018-01-25 03:04:03,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03" (1/1) ... [2018-01-25 03:04:03,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03" (1/1) ... [2018-01-25 03:04:03,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:04:03,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:04:03,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:04:03,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:04:03,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:04:03,863 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:04:03,863 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:04:03,863 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:04:03,863 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 03:04:03,864 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:04:03,865 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:04:03,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:04:03,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:04:04,338 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:04:04,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:04:04 BoogieIcfgContainer [2018-01-25 03:04:04,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:04:04,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:04:04,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:04:04,342 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:04:04,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:04:03" (1/3) ... [2018-01-25 03:04:04,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6037b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:04:04, skipping insertion in model container [2018-01-25 03:04:04,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:04:03" (2/3) ... [2018-01-25 03:04:04,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6037b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:04:04, skipping insertion in model container [2018-01-25 03:04:04,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:04:04" (3/3) ... [2018-01-25 03:04:04,347 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-01-25 03:04:04,356 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:04:04,363 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-01-25 03:04:04,414 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:04:04,415 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:04:04,415 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:04:04,415 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:04:04,415 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:04:04,415 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:04:04,415 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:04:04,416 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:04:04,417 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:04:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-25 03:04:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 03:04:04,448 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:04,449 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:04,449 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]=== [2018-01-25 03:04:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash 23857872, now seen corresponding path program 1 times [2018-01-25 03:04:04,458 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:04,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:04,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:04,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:04,520 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:04,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:04,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:04,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:04:04,660 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:04,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 03:04:04,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 03:04:04,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:04:04,681 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-01-25 03:04:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:04,858 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-01-25 03:04:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 03:04:04,865 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-25 03:04:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:04,875 INFO L225 Difference]: With dead ends: 182 [2018-01-25 03:04:04,876 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 03:04:04,880 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:04:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 03:04:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-25 03:04:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-25 03:04:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-01-25 03:04:04,941 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 10 [2018-01-25 03:04:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:04,942 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-01-25 03:04:04,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 03:04:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-01-25 03:04:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 03:04:04,943 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:04,943 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:04,944 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]=== [2018-01-25 03:04:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1271008375, now seen corresponding path program 1 times [2018-01-25 03:04:04,944 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:04,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:04,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:04,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:04,946 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:04,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:05,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:05,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:04:05,041 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:05,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:04:05,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:04:05,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:04:05,044 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 3 states. [2018-01-25 03:04:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:05,093 INFO L93 Difference]: Finished difference Result 231 states and 243 transitions. [2018-01-25 03:04:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:04:05,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 03:04:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:05,095 INFO L225 Difference]: With dead ends: 231 [2018-01-25 03:04:05,095 INFO L226 Difference]: Without dead ends: 146 [2018-01-25 03:04:05,097 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:04:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-25 03:04:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-01-25 03:04:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:04:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2018-01-25 03:04:05,112 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 12 [2018-01-25 03:04:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:05,113 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2018-01-25 03:04:05,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:04:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2018-01-25 03:04:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:04:05,113 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:05,114 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:05,114 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]=== [2018-01-25 03:04:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash -746554717, now seen corresponding path program 1 times [2018-01-25 03:04:05,114 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:05,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:05,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:05,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:05,116 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:05,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:05,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:05,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:04:05,162 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:05,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:04:05,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:04:05,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:04:05,163 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand 3 states. [2018-01-25 03:04:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:05,448 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-25 03:04:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:04:05,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-25 03:04:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:05,450 INFO L225 Difference]: With dead ends: 125 [2018-01-25 03:04:05,451 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 03:04:05,451 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:04:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 03:04:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-25 03:04:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 03:04:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2018-01-25 03:04:05,462 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 13 [2018-01-25 03:04:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:05,463 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2018-01-25 03:04:05,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:04:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2018-01-25 03:04:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:04:05,463 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:05,464 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:05,464 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]=== [2018-01-25 03:04:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash -747420669, now seen corresponding path program 1 times [2018-01-25 03:04:05,465 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:05,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:05,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:05,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:05,467 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:05,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:05,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:05,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:04:05,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:05,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:04:05,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:04:05,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:04:05,520 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 4 states. [2018-01-25 03:04:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:05,703 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2018-01-25 03:04:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:04:05,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 03:04:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:05,704 INFO L225 Difference]: With dead ends: 145 [2018-01-25 03:04:05,705 INFO L226 Difference]: Without dead ends: 137 [2018-01-25 03:04:05,705 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:04:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-25 03:04:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-01-25 03:04:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 03:04:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-01-25 03:04:05,715 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 13 [2018-01-25 03:04:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:05,715 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-01-25 03:04:05,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:04:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-01-25 03:04:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:04:05,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:05,717 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:05,718 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]=== [2018-01-25 03:04:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash -747420668, now seen corresponding path program 1 times [2018-01-25 03:04:05,718 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:05,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:05,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:05,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:05,720 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:05,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:05,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:05,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:04:05,828 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:05,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:04:05,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:04:05,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:04:05,829 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 4 states. [2018-01-25 03:04:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:06,070 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2018-01-25 03:04:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:04:06,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 03:04:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:06,072 INFO L225 Difference]: With dead ends: 158 [2018-01-25 03:04:06,072 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 03:04:06,073 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:04:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 03:04:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-01-25 03:04:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 03:04:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-01-25 03:04:06,086 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 13 [2018-01-25 03:04:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:06,086 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-01-25 03:04:06,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:04:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-01-25 03:04:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:04:06,087 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:06,087 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] [2018-01-25 03:04:06,087 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]=== [2018-01-25 03:04:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2050240790, now seen corresponding path program 1 times [2018-01-25 03:04:06,088 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:06,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:06,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:06,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:06,089 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:06,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:06,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:06,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:04:06,287 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:06,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:04:06,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:04:06,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:04:06,292 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 5 states. [2018-01-25 03:04:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:06,463 INFO L93 Difference]: Finished difference Result 201 states and 225 transitions. [2018-01-25 03:04:06,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:04:06,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-25 03:04:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:06,465 INFO L225 Difference]: With dead ends: 201 [2018-01-25 03:04:06,465 INFO L226 Difference]: Without dead ends: 198 [2018-01-25 03:04:06,465 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:04:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-25 03:04:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 104. [2018-01-25 03:04:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-25 03:04:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2018-01-25 03:04:06,477 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 25 [2018-01-25 03:04:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:06,477 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-01-25 03:04:06,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:04:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-01-25 03:04:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:04:06,478 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:06,479 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:06,479 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]=== [2018-01-25 03:04:06,479 INFO L82 PathProgramCache]: Analyzing trace with hash -867044953, now seen corresponding path program 1 times [2018-01-25 03:04:06,479 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:06,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:06,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:06,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:06,480 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:06,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:06,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:06,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:04:06,560 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:06,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:04:06,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:04:06,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:04:06,561 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 4 states. [2018-01-25 03:04:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:06,728 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-01-25 03:04:06,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:04:06,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-25 03:04:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:06,730 INFO L225 Difference]: With dead ends: 156 [2018-01-25 03:04:06,730 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 03:04:06,730 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:04:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 03:04:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2018-01-25 03:04:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-25 03:04:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-01-25 03:04:06,739 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 26 [2018-01-25 03:04:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:06,740 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-01-25 03:04:06,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:04:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-01-25 03:04:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:04:06,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:06,741 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] [2018-01-25 03:04:06,741 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]=== [2018-01-25 03:04:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash -867044952, now seen corresponding path program 1 times [2018-01-25 03:04:06,742 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:06,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:06,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:06,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:06,743 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:06,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:06,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:06,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:04:06,851 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:06,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:04:06,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:04:06,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:04:06,851 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2018-01-25 03:04:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:06,947 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-25 03:04:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:04:06,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-25 03:04:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:06,949 INFO L225 Difference]: With dead ends: 144 [2018-01-25 03:04:06,949 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 03:04:06,949 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:04:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 03:04:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-01-25 03:04:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 03:04:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-25 03:04:06,957 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2018-01-25 03:04:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:06,958 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-25 03:04:06,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:04:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-25 03:04:06,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:04:06,958 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:06,959 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:06,959 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]=== [2018-01-25 03:04:06,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715676, now seen corresponding path program 1 times [2018-01-25 03:04:06,959 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:06,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:06,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:06,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:06,960 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:06,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:07,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:07,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:04:07,009 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:07,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:04:07,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:04:07,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:04:07,010 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 4 states. [2018-01-25 03:04:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:07,127 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-01-25 03:04:07,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:04:07,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-25 03:04:07,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:07,128 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:04:07,128 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 03:04:07,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:04:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 03:04:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2018-01-25 03:04:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 03:04:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-01-25 03:04:07,136 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 28 [2018-01-25 03:04:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:07,136 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-01-25 03:04:07,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:04:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-01-25 03:04:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:04:07,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:07,138 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:07,138 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]=== [2018-01-25 03:04:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715675, now seen corresponding path program 1 times [2018-01-25 03:04:07,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:07,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:07,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:07,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:07,140 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:07,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:07,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:07,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:04:07,279 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:07,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:04:07,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:04:07,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:04:07,280 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 5 states. [2018-01-25 03:04:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:07,418 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2018-01-25 03:04:07,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:04:07,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-25 03:04:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:07,421 INFO L225 Difference]: With dead ends: 177 [2018-01-25 03:04:07,422 INFO L226 Difference]: Without dead ends: 176 [2018-01-25 03:04:07,422 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:04:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-25 03:04:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-01-25 03:04:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 03:04:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2018-01-25 03:04:07,434 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 28 [2018-01-25 03:04:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:07,434 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2018-01-25 03:04:07,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:04:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2018-01-25 03:04:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:04:07,435 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:07,435 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:07,435 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]=== [2018-01-25 03:04:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1689322728, now seen corresponding path program 1 times [2018-01-25 03:04:07,436 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:07,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:07,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:07,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:07,437 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:07,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:07,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:07,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:04:07,487 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:07,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:04:07,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:04:07,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:04:07,488 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 5 states. [2018-01-25 03:04:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:07,584 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2018-01-25 03:04:07,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:04:07,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-25 03:04:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:07,586 INFO L225 Difference]: With dead ends: 223 [2018-01-25 03:04:07,586 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 03:04:07,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:04:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 03:04:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-01-25 03:04:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 03:04:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-25 03:04:07,597 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 29 [2018-01-25 03:04:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:07,597 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-25 03:04:07,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:04:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-25 03:04:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:04:07,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:07,599 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] [2018-01-25 03:04:07,599 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]=== [2018-01-25 03:04:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash -202845861, now seen corresponding path program 1 times [2018-01-25 03:04:07,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:07,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:07,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:07,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:07,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:07,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:07,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:07,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:04:07,695 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:07,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:04:07,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:04:07,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:04:07,710 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 6 states. [2018-01-25 03:04:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:07,892 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-01-25 03:04:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:04:07,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-25 03:04:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:07,894 INFO L225 Difference]: With dead ends: 195 [2018-01-25 03:04:07,894 INFO L226 Difference]: Without dead ends: 194 [2018-01-25 03:04:07,895 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:04:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-25 03:04:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2018-01-25 03:04:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 03:04:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-01-25 03:04:07,907 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 29 [2018-01-25 03:04:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:07,907 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-01-25 03:04:07,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:04:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-01-25 03:04:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:04:07,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:07,909 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] [2018-01-25 03:04:07,909 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]=== [2018-01-25 03:04:07,909 INFO L82 PathProgramCache]: Analyzing trace with hash -202845860, now seen corresponding path program 1 times [2018-01-25 03:04:07,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:07,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:07,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:07,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:07,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:07,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:08,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-25 03:04:08,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:08,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:04:08,221 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:08,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:04:08,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:04:08,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:04:08,222 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 10 states. [2018-01-25 03:04:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:08,647 INFO L93 Difference]: Finished difference Result 222 states and 239 transitions. [2018-01-25 03:04:08,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 03:04:08,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-01-25 03:04:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:08,651 INFO L225 Difference]: With dead ends: 222 [2018-01-25 03:04:08,651 INFO L226 Difference]: Without dead ends: 221 [2018-01-25 03:04:08,652 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:04:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-25 03:04:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 144. [2018-01-25 03:04:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 03:04:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2018-01-25 03:04:08,665 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 29 [2018-01-25 03:04:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:08,666 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2018-01-25 03:04:08,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:04:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2018-01-25 03:04:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:04:08,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:08,667 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:08,667 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]=== [2018-01-25 03:04:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash 829423013, now seen corresponding path program 1 times [2018-01-25 03:04:08,668 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:08,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:08,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:08,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:08,669 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:08,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 03:04:08,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:08,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:04:08,711 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:08,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:04:08,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:04:08,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:04:08,712 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand 4 states. [2018-01-25 03:04:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:08,813 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2018-01-25 03:04:08,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:04:08,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-25 03:04:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:08,816 INFO L225 Difference]: With dead ends: 156 [2018-01-25 03:04:08,816 INFO L226 Difference]: Without dead ends: 154 [2018-01-25 03:04:08,816 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:04:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-25 03:04:08,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2018-01-25 03:04:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-25 03:04:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-01-25 03:04:08,830 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 30 [2018-01-25 03:04:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:08,831 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-01-25 03:04:08,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:04:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-01-25 03:04:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:04:08,832 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:08,832 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:08,832 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]=== [2018-01-25 03:04:08,833 INFO L82 PathProgramCache]: Analyzing trace with hash 829423014, now seen corresponding path program 1 times [2018-01-25 03:04:08,833 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:08,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:08,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:08,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:08,834 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:08,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:08,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:08,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:04:08,986 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:08,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:04:08,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:04:08,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:04:08,986 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 6 states. [2018-01-25 03:04:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:09,229 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2018-01-25 03:04:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:04:09,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 03:04:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:09,231 INFO L225 Difference]: With dead ends: 214 [2018-01-25 03:04:09,231 INFO L226 Difference]: Without dead ends: 212 [2018-01-25 03:04:09,232 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:04:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-25 03:04:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2018-01-25 03:04:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-25 03:04:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-01-25 03:04:09,250 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 30 [2018-01-25 03:04:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:09,251 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-01-25 03:04:09,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:04:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-01-25 03:04:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:04:09,252 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:09,252 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:09,252 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]=== [2018-01-25 03:04:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash -664393622, now seen corresponding path program 1 times [2018-01-25 03:04:09,252 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:09,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:09,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:09,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:09,258 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:09,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:09,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:04:09,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:04:09,385 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:04:09,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:04:09,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:04:09,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:04:09,386 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 7 states. [2018-01-25 03:04:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:04:09,722 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2018-01-25 03:04:09,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:04:09,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-25 03:04:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:04:09,724 INFO L225 Difference]: With dead ends: 253 [2018-01-25 03:04:09,724 INFO L226 Difference]: Without dead ends: 220 [2018-01-25 03:04:09,724 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:04:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-25 03:04:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 169. [2018-01-25 03:04:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-25 03:04:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-01-25 03:04:09,733 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 34 [2018-01-25 03:04:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:04:09,734 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-01-25 03:04:09,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:04:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-01-25 03:04:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 03:04:09,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:04:09,735 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:04:09,735 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]=== [2018-01-25 03:04:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1742572463, now seen corresponding path program 1 times [2018-01-25 03:04:09,735 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:04:09,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:09,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:04:09,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:04:09,736 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:04:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:04:09,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:04:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:04:09,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:04:09,853 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:04:09,854 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-25 03:04:09,856 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [44], [84], [100], [106], [107], [108], [110], [111], [114], [118], [122], [135], [144], [145], [149], [150], [151] [2018-01-25 03:04:09,900 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:04:09,900 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