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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:30:27,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:30:27,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:30:27,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:30:27,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:30:27,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:30:27,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:30:27,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:30:27,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:30:27,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:30:27,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:30:27,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:30:27,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:30:27,532 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:30:27,533 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:30:27,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:30:27,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:30:27,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:30:27,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:30:27,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:30:27,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:30:27,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:30:27,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:30:27,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:30:27,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:30:27,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:30:27,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:30:27,551 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:30:27,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:30:27,551 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:30:27,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:30:27,553 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:30:27,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:30:27,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:30:27,564 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:30:27,564 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:30:27,565 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:30:27,565 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:30:27,565 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:30:27,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:30:27,566 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:30:27,566 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:30:27,566 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:30:27,566 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:30:27,567 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:30:27,567 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:30:27,567 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:30:27,567 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:30:27,567 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:30:27,567 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:30:27,568 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:30:27,568 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:30:27,568 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:30:27,568 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:30:27,568 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:30:27,569 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:30:27,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:30:27,569 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:30:27,569 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:30:27,569 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:30:27,570 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:30:27,570 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:30:27,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:30:27,570 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:30:27,571 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:30:27,571 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:30:27,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:30:27,620 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:30:27,624 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:30:27,626 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:30:27,626 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:30:27,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-01-29 23:30:27,791 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:30:27,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:30:27,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:30:27,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:30:27,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:30:27,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:30:27" (1/1) ... [2018-01-29 23:30:27,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103b8d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:27, skipping insertion in model container [2018-01-29 23:30:27,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:30:27" (1/1) ... [2018-01-29 23:30:27,820 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:30:27,858 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:30:27,975 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:30:28,002 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:30:28,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28 WrapperNode [2018-01-29 23:30:28,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:30:28,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:30:28,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:30:28,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:30:28,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28" (1/1) ... [2018-01-29 23:30:28,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28" (1/1) ... [2018-01-29 23:30:28,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28" (1/1) ... [2018-01-29 23:30:28,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28" (1/1) ... [2018-01-29 23:30:28,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28" (1/1) ... [2018-01-29 23:30:28,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28" (1/1) ... [2018-01-29 23:30:28,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28" (1/1) ... [2018-01-29 23:30:28,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:30:28,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:30:28,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:30:28,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:30:28,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28" (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-29 23:30:28,108 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:30:28,108 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:30:28,109 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:30:28,109 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:30:28,109 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:30:28,109 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:30:28,109 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:30:28,109 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:30:28,109 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:30:28,109 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:30:28,109 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:30:28,109 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:30:28,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:30:28,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:30:28,673 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:30:28,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:30:28 BoogieIcfgContainer [2018-01-29 23:30:28,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:30:28,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:30:28,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:30:28,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:30:28,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:30:27" (1/3) ... [2018-01-29 23:30:28,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecd92a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:30:28, skipping insertion in model container [2018-01-29 23:30:28,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:30:28" (2/3) ... [2018-01-29 23:30:28,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecd92a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:30:28, skipping insertion in model container [2018-01-29 23:30:28,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:30:28" (3/3) ... [2018-01-29 23:30:28,682 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-01-29 23:30:28,689 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:30:28,696 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-01-29 23:30:28,738 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:30:28,738 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:30:28,738 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:30:28,738 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:30:28,738 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:30:28,738 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:30:28,738 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:30:28,739 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:30:28,739 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:30:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2018-01-29 23:30:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-29 23:30:28,765 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:28,766 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:28,766 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:28,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1379988686, now seen corresponding path program 1 times [2018-01-29 23:30:28,771 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:28,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:28,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:28,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:28,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:28,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:28,936 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-29 23:30:28,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:28,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:28,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:29,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:29,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:29,041 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2018-01-29 23:30:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:29,358 INFO L93 Difference]: Finished difference Result 414 states and 442 transitions. [2018-01-29 23:30:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:30:29,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-29 23:30:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:29,370 INFO L225 Difference]: With dead ends: 414 [2018-01-29 23:30:29,371 INFO L226 Difference]: Without dead ends: 219 [2018-01-29 23:30:29,375 INFO L553 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-29 23:30:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-29 23:30:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2018-01-29 23:30:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-29 23:30:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 210 transitions. [2018-01-29 23:30:29,423 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 210 transitions. Word has length 10 [2018-01-29 23:30:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:29,423 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 210 transitions. [2018-01-29 23:30:29,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 210 transitions. [2018-01-29 23:30:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-29 23:30:29,424 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:29,424 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:29,424 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1379988685, now seen corresponding path program 1 times [2018-01-29 23:30:29,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:29,425 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:29,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:29,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:29,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:29,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:29,523 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-29 23:30:29,524 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:29,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:29,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:29,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:29,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:29,527 INFO L87 Difference]: Start difference. First operand 200 states and 210 transitions. Second operand 4 states. [2018-01-29 23:30:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:29,724 INFO L93 Difference]: Finished difference Result 200 states and 210 transitions. [2018-01-29 23:30:29,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:30:29,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-29 23:30:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:29,727 INFO L225 Difference]: With dead ends: 200 [2018-01-29 23:30:29,727 INFO L226 Difference]: Without dead ends: 197 [2018-01-29 23:30:29,728 INFO L553 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-29 23:30:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-29 23:30:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-01-29 23:30:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-29 23:30:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 207 transitions. [2018-01-29 23:30:29,742 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 207 transitions. Word has length 10 [2018-01-29 23:30:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:29,742 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 207 transitions. [2018-01-29 23:30:29,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 207 transitions. [2018-01-29 23:30:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:30:29,743 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:29,743 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:29,744 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash -868488917, now seen corresponding path program 1 times [2018-01-29 23:30:29,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:29,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:29,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:29,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:29,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:29,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:29,799 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-29 23:30:29,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:29,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:29,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:29,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:29,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:29,800 INFO L87 Difference]: Start difference. First operand 197 states and 207 transitions. Second operand 4 states. [2018-01-29 23:30:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:29,969 INFO L93 Difference]: Finished difference Result 227 states and 238 transitions. [2018-01-29 23:30:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:30:29,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 23:30:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:29,971 INFO L225 Difference]: With dead ends: 227 [2018-01-29 23:30:29,971 INFO L226 Difference]: Without dead ends: 209 [2018-01-29 23:30:29,971 INFO L553 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-29 23:30:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-29 23:30:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 182. [2018-01-29 23:30:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-29 23:30:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-01-29 23:30:29,987 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 19 [2018-01-29 23:30:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:29,988 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-01-29 23:30:29,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-01-29 23:30:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:30:29,989 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:29,989 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:29,989 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:29,990 INFO L82 PathProgramCache]: Analyzing trace with hash -868488916, now seen corresponding path program 1 times [2018-01-29 23:30:29,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:29,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:29,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:29,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:29,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:30,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:30,084 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-29 23:30:30,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:30,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:30,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:30,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:30,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:30,086 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 5 states. [2018-01-29 23:30:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:30,319 INFO L93 Difference]: Finished difference Result 280 states and 298 transitions. [2018-01-29 23:30:30,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:30:30,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-29 23:30:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:30,321 INFO L225 Difference]: With dead ends: 280 [2018-01-29 23:30:30,322 INFO L226 Difference]: Without dead ends: 266 [2018-01-29 23:30:30,322 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-29 23:30:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-29 23:30:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 240. [2018-01-29 23:30:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-29 23:30:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 267 transitions. [2018-01-29 23:30:30,336 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 267 transitions. Word has length 19 [2018-01-29 23:30:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:30,337 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 267 transitions. [2018-01-29 23:30:30,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 267 transitions. [2018-01-29 23:30:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:30:30,339 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:30,339 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:30,339 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:30,339 INFO L82 PathProgramCache]: Analyzing trace with hash 299244869, now seen corresponding path program 1 times [2018-01-29 23:30:30,339 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:30,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:30,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:30,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:30,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:30,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:30,399 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-29 23:30:30,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:30,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:30,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:30,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:30,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:30,403 INFO L87 Difference]: Start difference. First operand 240 states and 267 transitions. Second operand 4 states. [2018-01-29 23:30:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:30,534 INFO L93 Difference]: Finished difference Result 259 states and 286 transitions. [2018-01-29 23:30:30,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:30:30,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-29 23:30:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:30,535 INFO L225 Difference]: With dead ends: 259 [2018-01-29 23:30:30,535 INFO L226 Difference]: Without dead ends: 256 [2018-01-29 23:30:30,536 INFO L553 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-29 23:30:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-01-29 23:30:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2018-01-29 23:30:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-29 23:30:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2018-01-29 23:30:30,544 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 21 [2018-01-29 23:30:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:30,544 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2018-01-29 23:30:30,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2018-01-29 23:30:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:30:30,545 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:30,545 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:30,545 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:30,545 INFO L82 PathProgramCache]: Analyzing trace with hash 299244870, now seen corresponding path program 1 times [2018-01-29 23:30:30,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:30,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:30,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:30,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:30,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:30,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:30,602 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-29 23:30:30,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:30,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:30,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:30,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:30,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:30,603 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand 4 states. [2018-01-29 23:30:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:30,757 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2018-01-29 23:30:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:30:30,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-29 23:30:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:30,758 INFO L225 Difference]: With dead ends: 247 [2018-01-29 23:30:30,759 INFO L226 Difference]: Without dead ends: 244 [2018-01-29 23:30:30,759 INFO L553 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-29 23:30:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-29 23:30:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2018-01-29 23:30:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-29 23:30:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 268 transitions. [2018-01-29 23:30:30,768 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 268 transitions. Word has length 21 [2018-01-29 23:30:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:30,769 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 268 transitions. [2018-01-29 23:30:30,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 268 transitions. [2018-01-29 23:30:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 23:30:30,770 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:30,770 INFO L350 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-29 23:30:30,770 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1620293662, now seen corresponding path program 1 times [2018-01-29 23:30:30,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:30,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:30,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:30,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:30,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:30,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:30,823 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-29 23:30:30,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:30,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:30,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:30,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:30,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:30,824 INFO L87 Difference]: Start difference. First operand 240 states and 268 transitions. Second operand 4 states. [2018-01-29 23:30:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:30,862 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2018-01-29 23:30:30,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:30:30,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-29 23:30:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:30,864 INFO L225 Difference]: With dead ends: 244 [2018-01-29 23:30:30,864 INFO L226 Difference]: Without dead ends: 241 [2018-01-29 23:30:30,864 INFO L553 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-29 23:30:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-01-29 23:30:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2018-01-29 23:30:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-29 23:30:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 267 transitions. [2018-01-29 23:30:30,871 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 267 transitions. Word has length 26 [2018-01-29 23:30:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:30,872 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 267 transitions. [2018-01-29 23:30:30,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 267 transitions. [2018-01-29 23:30:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-29 23:30:30,873 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:30,873 INFO L350 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-29 23:30:30,873 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:30,873 INFO L82 PathProgramCache]: Analyzing trace with hash 961565968, now seen corresponding path program 1 times [2018-01-29 23:30:30,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:30,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:30,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:30,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:30,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:30,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:30,935 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-29 23:30:30,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:30,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:30,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:30,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:30,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:30,937 INFO L87 Difference]: Start difference. First operand 240 states and 267 transitions. Second operand 5 states. [2018-01-29 23:30:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:31,112 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2018-01-29 23:30:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:31,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-29 23:30:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:31,149 INFO L225 Difference]: With dead ends: 263 [2018-01-29 23:30:31,150 INFO L226 Difference]: Without dead ends: 259 [2018-01-29 23:30:31,150 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:30:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-29 23:30:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 240. [2018-01-29 23:30:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-29 23:30:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 268 transitions. [2018-01-29 23:30:31,158 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 268 transitions. Word has length 29 [2018-01-29 23:30:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:31,159 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 268 transitions. [2018-01-29 23:30:31,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 268 transitions. [2018-01-29 23:30:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-29 23:30:31,160 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:31,160 INFO L350 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-29 23:30:31,161 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:31,161 INFO L82 PathProgramCache]: Analyzing trace with hash 961565969, now seen corresponding path program 1 times [2018-01-29 23:30:31,161 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:31,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:31,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:31,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:31,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:31,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:31,266 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-29 23:30:31,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:31,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:31,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:31,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:31,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:31,267 INFO L87 Difference]: Start difference. First operand 240 states and 268 transitions. Second operand 5 states. [2018-01-29 23:30:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:31,509 INFO L93 Difference]: Finished difference Result 268 states and 297 transitions. [2018-01-29 23:30:31,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:31,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-29 23:30:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:31,510 INFO L225 Difference]: With dead ends: 268 [2018-01-29 23:30:31,510 INFO L226 Difference]: Without dead ends: 266 [2018-01-29 23:30:31,511 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:30:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-29 23:30:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 243. [2018-01-29 23:30:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-29 23:30:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 270 transitions. [2018-01-29 23:30:31,518 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 270 transitions. Word has length 29 [2018-01-29 23:30:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:31,519 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 270 transitions. [2018-01-29 23:30:31,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 270 transitions. [2018-01-29 23:30:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 23:30:31,520 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:31,521 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:31,521 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:31,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1068122348, now seen corresponding path program 1 times [2018-01-29 23:30:31,521 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:31,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:31,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:31,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:31,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:31,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:31,879 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-29 23:30:31,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:31,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-29 23:30:31,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:30:31,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:30:31,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:30:31,880 INFO L87 Difference]: Start difference. First operand 243 states and 270 transitions. Second operand 12 states. [2018-01-29 23:30:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:32,530 INFO L93 Difference]: Finished difference Result 267 states and 297 transitions. [2018-01-29 23:30:32,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:30:32,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-01-29 23:30:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:32,532 INFO L225 Difference]: With dead ends: 267 [2018-01-29 23:30:32,532 INFO L226 Difference]: Without dead ends: 266 [2018-01-29 23:30:32,533 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:30:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-29 23:30:32,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 244. [2018-01-29 23:30:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-29 23:30:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 272 transitions. [2018-01-29 23:30:32,543 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 272 transitions. Word has length 33 [2018-01-29 23:30:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:32,543 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 272 transitions. [2018-01-29 23:30:32,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:30:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 272 transitions. [2018-01-29 23:30:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 23:30:32,545 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:32,545 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:32,545 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:32,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1068122347, now seen corresponding path program 1 times [2018-01-29 23:30:32,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:32,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:32,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:32,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:32,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:32,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:32,917 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-29 23:30:32,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:32,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-29 23:30:32,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:30:32,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:30:32,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:30:32,918 INFO L87 Difference]: Start difference. First operand 244 states and 272 transitions. Second operand 13 states. [2018-01-29 23:30:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:33,651 INFO L93 Difference]: Finished difference Result 331 states and 353 transitions. [2018-01-29 23:30:33,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 23:30:33,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-29 23:30:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:33,653 INFO L225 Difference]: With dead ends: 331 [2018-01-29 23:30:33,653 INFO L226 Difference]: Without dead ends: 328 [2018-01-29 23:30:33,654 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:30:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-01-29 23:30:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 250. [2018-01-29 23:30:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-29 23:30:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 279 transitions. [2018-01-29 23:30:33,662 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 279 transitions. Word has length 33 [2018-01-29 23:30:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:33,662 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 279 transitions. [2018-01-29 23:30:33,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:30:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 279 transitions. [2018-01-29 23:30:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 23:30:33,664 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:33,664 INFO L350 BasicCegarLoop]: trace histogram [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, 1] [2018-01-29 23:30:33,664 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1548992989, now seen corresponding path program 1 times [2018-01-29 23:30:33,664 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:33,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:33,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:33,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:33,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:33,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:33,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:33,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:33,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:30:33,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:30:33,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:30:33,690 INFO L87 Difference]: Start difference. First operand 250 states and 279 transitions. Second operand 3 states. [2018-01-29 23:30:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:33,705 INFO L93 Difference]: Finished difference Result 490 states and 550 transitions. [2018-01-29 23:30:33,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:30:33,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-29 23:30:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:33,707 INFO L225 Difference]: With dead ends: 490 [2018-01-29 23:30:33,707 INFO L226 Difference]: Without dead ends: 252 [2018-01-29 23:30:33,709 INFO L553 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-29 23:30:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-29 23:30:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-01-29 23:30:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-29 23:30:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2018-01-29 23:30:33,721 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 33 [2018-01-29 23:30:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:33,722 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2018-01-29 23:30:33,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:30:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2018-01-29 23:30:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-29 23:30:33,725 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:33,725 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-01-29 23:30:33,725 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1877154970, now seen corresponding path program 1 times [2018-01-29 23:30:33,725 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:33,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:33,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:33,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:33,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:33,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:33,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:33,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:30:33,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:30:33,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:30:33,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:30:33,834 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand 6 states. [2018-01-29 23:30:34,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:34,218 INFO L93 Difference]: Finished difference Result 561 states and 626 transitions. [2018-01-29 23:30:34,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:30:34,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-29 23:30:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:34,220 INFO L225 Difference]: With dead ends: 561 [2018-01-29 23:30:34,220 INFO L226 Difference]: Without dead ends: 321 [2018-01-29 23:30:34,221 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:30:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-29 23:30:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 283. [2018-01-29 23:30:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 23:30:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 317 transitions. [2018-01-29 23:30:34,228 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 317 transitions. Word has length 35 [2018-01-29 23:30:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:34,229 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 317 transitions. [2018-01-29 23:30:34,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:30:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 317 transitions. [2018-01-29 23:30:34,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 23:30:34,229 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:34,230 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:34,230 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash 105993709, now seen corresponding path program 1 times [2018-01-29 23:30:34,230 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:34,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:34,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:34,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:34,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:34,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:34,255 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-29 23:30:34,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:34,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:34,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:30:34,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:30:34,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:30:34,256 INFO L87 Difference]: Start difference. First operand 283 states and 317 transitions. Second operand 3 states. [2018-01-29 23:30:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:34,305 INFO L93 Difference]: Finished difference Result 526 states and 592 transitions. [2018-01-29 23:30:34,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:30:34,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-01-29 23:30:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:34,306 INFO L225 Difference]: With dead ends: 526 [2018-01-29 23:30:34,306 INFO L226 Difference]: Without dead ends: 286 [2018-01-29 23:30:34,307 INFO L553 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-29 23:30:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-29 23:30:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-01-29 23:30:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-01-29 23:30:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 320 transitions. [2018-01-29 23:30:34,324 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 320 transitions. Word has length 36 [2018-01-29 23:30:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:34,325 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 320 transitions. [2018-01-29 23:30:34,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:30:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 320 transitions. [2018-01-29 23:30:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 23:30:34,325 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:34,326 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:34,326 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:34,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1200880112, now seen corresponding path program 1 times [2018-01-29 23:30:34,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:34,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:34,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:34,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:34,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:34,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:34,368 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-29 23:30:34,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:34,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:34,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:34,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:34,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:34,369 INFO L87 Difference]: Start difference. First operand 286 states and 320 transitions. Second operand 4 states. [2018-01-29 23:30:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:34,692 INFO L93 Difference]: Finished difference Result 306 states and 341 transitions. [2018-01-29 23:30:34,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:30:34,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-29 23:30:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:34,697 INFO L225 Difference]: With dead ends: 306 [2018-01-29 23:30:34,697 INFO L226 Difference]: Without dead ends: 305 [2018-01-29 23:30:34,697 INFO L553 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-29 23:30:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-29 23:30:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2018-01-29 23:30:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-29 23:30:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 319 transitions. [2018-01-29 23:30:34,709 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 319 transitions. Word has length 38 [2018-01-29 23:30:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:34,709 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 319 transitions. [2018-01-29 23:30:34,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 319 transitions. [2018-01-29 23:30:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 23:30:34,710 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:34,710 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:34,710 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1200880113, now seen corresponding path program 1 times [2018-01-29 23:30:34,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:34,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:34,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:34,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:34,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:34,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:34,796 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-29 23:30:34,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:34,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:34,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:34,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:34,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:34,797 INFO L87 Difference]: Start difference. First operand 285 states and 319 transitions. Second operand 4 states. [2018-01-29 23:30:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:35,006 INFO L93 Difference]: Finished difference Result 343 states and 380 transitions. [2018-01-29 23:30:35,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:30:35,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-29 23:30:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:35,009 INFO L225 Difference]: With dead ends: 343 [2018-01-29 23:30:35,009 INFO L226 Difference]: Without dead ends: 341 [2018-01-29 23:30:35,010 INFO L553 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-29 23:30:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-01-29 23:30:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 283. [2018-01-29 23:30:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 23:30:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 317 transitions. [2018-01-29 23:30:35,021 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 317 transitions. Word has length 38 [2018-01-29 23:30:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:35,021 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 317 transitions. [2018-01-29 23:30:35,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 317 transitions. [2018-01-29 23:30:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 23:30:35,022 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:35,022 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:35,022 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:35,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1791562698, now seen corresponding path program 1 times [2018-01-29 23:30:35,022 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:35,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:35,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:35,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:35,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:35,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:35,095 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-29 23:30:35,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:35,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:35,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:35,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:35,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:35,096 INFO L87 Difference]: Start difference. First operand 283 states and 317 transitions. Second operand 5 states. [2018-01-29 23:30:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:35,411 INFO L93 Difference]: Finished difference Result 435 states and 488 transitions. [2018-01-29 23:30:35,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:35,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-29 23:30:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:35,414 INFO L225 Difference]: With dead ends: 435 [2018-01-29 23:30:35,414 INFO L226 Difference]: Without dead ends: 434 [2018-01-29 23:30:35,415 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:30:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-01-29 23:30:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 282. [2018-01-29 23:30:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-01-29 23:30:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 315 transitions. [2018-01-29 23:30:35,427 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 315 transitions. Word has length 38 [2018-01-29 23:30:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:35,428 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 315 transitions. [2018-01-29 23:30:35,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 315 transitions. [2018-01-29 23:30:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 23:30:35,428 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:35,429 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:35,429 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1791562699, now seen corresponding path program 1 times [2018-01-29 23:30:35,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:35,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:35,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:35,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:35,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:35,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:35,506 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-29 23:30:35,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:35,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:35,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:35,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:35,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:35,507 INFO L87 Difference]: Start difference. First operand 282 states and 315 transitions. Second operand 5 states. [2018-01-29 23:30:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:36,121 INFO L93 Difference]: Finished difference Result 420 states and 472 transitions. [2018-01-29 23:30:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:36,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-29 23:30:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:36,138 INFO L225 Difference]: With dead ends: 420 [2018-01-29 23:30:36,138 INFO L226 Difference]: Without dead ends: 419 [2018-01-29 23:30:36,139 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:30:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-01-29 23:30:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 281. [2018-01-29 23:30:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-29 23:30:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 313 transitions. [2018-01-29 23:30:36,150 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 313 transitions. Word has length 38 [2018-01-29 23:30:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:36,151 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 313 transitions. [2018-01-29 23:30:36,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 313 transitions. [2018-01-29 23:30:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 23:30:36,152 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:36,152 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:36,152 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1427421990, now seen corresponding path program 1 times [2018-01-29 23:30:36,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:36,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:36,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:36,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:36,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:36,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:36,245 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-29 23:30:36,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:36,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:36,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:36,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:36,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:36,247 INFO L87 Difference]: Start difference. First operand 281 states and 313 transitions. Second operand 5 states. [2018-01-29 23:30:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:36,430 INFO L93 Difference]: Finished difference Result 321 states and 355 transitions. [2018-01-29 23:30:36,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:36,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-29 23:30:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:36,432 INFO L225 Difference]: With dead ends: 321 [2018-01-29 23:30:36,432 INFO L226 Difference]: Without dead ends: 314 [2018-01-29 23:30:36,433 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:30:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-01-29 23:30:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 272. [2018-01-29 23:30:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-29 23:30:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 304 transitions. [2018-01-29 23:30:36,444 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 304 transitions. Word has length 39 [2018-01-29 23:30:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:36,444 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 304 transitions. [2018-01-29 23:30:36,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 304 transitions. [2018-01-29 23:30:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 23:30:36,445 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:36,445 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:36,445 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:36,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2015874180, now seen corresponding path program 1 times [2018-01-29 23:30:36,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:36,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:36,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:36,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:36,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:36,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:36,487 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-29 23:30:36,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:36,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:36,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:36,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:36,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:36,488 INFO L87 Difference]: Start difference. First operand 272 states and 304 transitions. Second operand 4 states. [2018-01-29 23:30:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:36,596 INFO L93 Difference]: Finished difference Result 283 states and 316 transitions. [2018-01-29 23:30:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:30:36,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-01-29 23:30:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:36,597 INFO L225 Difference]: With dead ends: 283 [2018-01-29 23:30:36,597 INFO L226 Difference]: Without dead ends: 282 [2018-01-29 23:30:36,598 INFO L553 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-29 23:30:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-01-29 23:30:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 271. [2018-01-29 23:30:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-29 23:30:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 303 transitions. [2018-01-29 23:30:36,604 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 303 transitions. Word has length 41 [2018-01-29 23:30:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:36,604 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 303 transitions. [2018-01-29 23:30:36,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 303 transitions. [2018-01-29 23:30:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 23:30:36,605 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:36,605 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:36,605 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:36,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2015874179, now seen corresponding path program 1 times [2018-01-29 23:30:36,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:36,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:36,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:36,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:36,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:36,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:36,650 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-29 23:30:36,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:36,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:36,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:30:36,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:30:36,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:30:36,651 INFO L87 Difference]: Start difference. First operand 271 states and 303 transitions. Second operand 4 states. [2018-01-29 23:30:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:36,932 INFO L93 Difference]: Finished difference Result 318 states and 352 transitions. [2018-01-29 23:30:36,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:30:36,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-01-29 23:30:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:36,934 INFO L225 Difference]: With dead ends: 318 [2018-01-29 23:30:36,934 INFO L226 Difference]: Without dead ends: 316 [2018-01-29 23:30:36,934 INFO L553 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-29 23:30:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-01-29 23:30:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 269. [2018-01-29 23:30:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-29 23:30:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 301 transitions. [2018-01-29 23:30:36,941 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 301 transitions. Word has length 41 [2018-01-29 23:30:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:36,941 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 301 transitions. [2018-01-29 23:30:36,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:30:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 301 transitions. [2018-01-29 23:30:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 23:30:36,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:36,942 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:36,942 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1114169813, now seen corresponding path program 1 times [2018-01-29 23:30:36,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:36,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:36,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:36,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:36,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:36,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:37,053 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-29 23:30:37,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:37,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:30:37,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:30:37,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:30:37,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:30:37,053 INFO L87 Difference]: Start difference. First operand 269 states and 301 transitions. Second operand 9 states. [2018-01-29 23:30:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:37,399 INFO L93 Difference]: Finished difference Result 335 states and 377 transitions. [2018-01-29 23:30:37,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:30:37,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-29 23:30:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:37,400 INFO L225 Difference]: With dead ends: 335 [2018-01-29 23:30:37,400 INFO L226 Difference]: Without dead ends: 334 [2018-01-29 23:30:37,401 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:30:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-29 23:30:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 268. [2018-01-29 23:30:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-01-29 23:30:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 299 transitions. [2018-01-29 23:30:37,410 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 299 transitions. Word has length 41 [2018-01-29 23:30:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:37,410 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 299 transitions. [2018-01-29 23:30:37,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:30:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 299 transitions. [2018-01-29 23:30:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 23:30:37,411 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:37,411 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:37,411 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:37,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1114169812, now seen corresponding path program 1 times [2018-01-29 23:30:37,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:37,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:37,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:37,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:37,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:37,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:37,549 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-29 23:30:37,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:37,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:30:37,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:30:37,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:30:37,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:30:37,550 INFO L87 Difference]: Start difference. First operand 268 states and 299 transitions. Second operand 9 states. [2018-01-29 23:30:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:37,972 INFO L93 Difference]: Finished difference Result 334 states and 375 transitions. [2018-01-29 23:30:37,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:30:37,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-29 23:30:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:37,974 INFO L225 Difference]: With dead ends: 334 [2018-01-29 23:30:37,974 INFO L226 Difference]: Without dead ends: 333 [2018-01-29 23:30:37,975 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:30:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-29 23:30:37,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 267. [2018-01-29 23:30:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-01-29 23:30:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2018-01-29 23:30:37,984 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 41 [2018-01-29 23:30:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:37,984 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2018-01-29 23:30:37,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:30:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2018-01-29 23:30:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-29 23:30:37,985 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:37,985 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:37,985 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:37,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1932410086, now seen corresponding path program 1 times [2018-01-29 23:30:37,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:37,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:37,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:37,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:37,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:37,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:38,104 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-29 23:30:38,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:38,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:30:38,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:30:38,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:30:38,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:30:38,105 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand 6 states. [2018-01-29 23:30:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:38,440 INFO L93 Difference]: Finished difference Result 350 states and 387 transitions. [2018-01-29 23:30:38,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:30:38,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-29 23:30:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:38,441 INFO L225 Difference]: With dead ends: 350 [2018-01-29 23:30:38,441 INFO L226 Difference]: Without dead ends: 343 [2018-01-29 23:30:38,442 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:30:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-29 23:30:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 235. [2018-01-29 23:30:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-01-29 23:30:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 257 transitions. [2018-01-29 23:30:38,447 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 257 transitions. Word has length 42 [2018-01-29 23:30:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:38,447 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 257 transitions. [2018-01-29 23:30:38,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:30:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 257 transitions. [2018-01-29 23:30:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:30:38,448 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:38,448 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:38,448 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:38,448 INFO L82 PathProgramCache]: Analyzing trace with hash 133893922, now seen corresponding path program 1 times [2018-01-29 23:30:38,448 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:38,448 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:38,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:38,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:38,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:38,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:39,001 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-29 23:30:39,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:39,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-29 23:30:39,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:30:39,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:30:39,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:30:39,002 INFO L87 Difference]: Start difference. First operand 235 states and 257 transitions. Second operand 15 states. [2018-01-29 23:30:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:40,398 INFO L93 Difference]: Finished difference Result 427 states and 461 transitions. [2018-01-29 23:30:40,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:30:40,398 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-01-29 23:30:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:40,399 INFO L225 Difference]: With dead ends: 427 [2018-01-29 23:30:40,399 INFO L226 Difference]: Without dead ends: 425 [2018-01-29 23:30:40,400 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:30:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-01-29 23:30:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 251. [2018-01-29 23:30:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-29 23:30:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 273 transitions. [2018-01-29 23:30:40,406 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 273 transitions. Word has length 43 [2018-01-29 23:30:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:40,406 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 273 transitions. [2018-01-29 23:30:40,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:30:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 273 transitions. [2018-01-29 23:30:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:30:40,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:40,407 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:40,407 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:40,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1562467601, now seen corresponding path program 1 times [2018-01-29 23:30:40,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:40,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:40,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:40,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:40,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:40,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:41,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:41,219 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:30:41,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:41,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:41,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:30:41,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:30:41,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:41,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:41,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:41,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-01-29 23:30:41,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-01-29 23:30:41,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2018-01-29 23:30:41,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:30:41,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:30:41,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:30:41,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:72 [2018-01-29 23:30:42,271 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int) (main_~st~4.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~4.base 1))) (and (= 0 (select .cse0 main_~st~4.base)) (not (= 0 main_~n~4.base)) (= |c_#valid| (store (store .cse0 main_~st~4.base 0) main_~n~4.base 0)) (not (= main_~st~4.base 0)) (= 0 (select |c_old(#valid)| main_~n~4.base))))) is different from true [2018-01-29 23:30:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-29 23:30:42,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:42,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-01-29 23:30:42,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:30:42,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:30:42,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=4, NotChecked=46, Total=650 [2018-01-29 23:30:42,316 INFO L87 Difference]: Start difference. First operand 251 states and 273 transitions. Second operand 26 states. [2018-01-29 23:30:43,928 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 142 DAG size of output 46 [2018-01-29 23:30:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:45,876 INFO L93 Difference]: Finished difference Result 312 states and 337 transitions. [2018-01-29 23:30:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:30:45,876 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2018-01-29 23:30:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:45,877 INFO L225 Difference]: With dead ends: 312 [2018-01-29 23:30:45,877 INFO L226 Difference]: Without dead ends: 309 [2018-01-29 23:30:45,878 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=215, Invalid=1495, Unknown=16, NotChecked=80, Total=1806 [2018-01-29 23:30:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-29 23:30:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 277. [2018-01-29 23:30:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-01-29 23:30:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 301 transitions. [2018-01-29 23:30:45,891 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 301 transitions. Word has length 43 [2018-01-29 23:30:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:45,891 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 301 transitions. [2018-01-29 23:30:45,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:30:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 301 transitions. [2018-01-29 23:30:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:30:45,892 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:45,892 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:45,892 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:45,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1562467348, now seen corresponding path program 1 times [2018-01-29 23:30:45,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:45,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:45,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:45,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:45,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:45,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:46,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:46,060 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:30:46,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:46,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:46,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:30:46,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:30:46,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:30:46,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:30:46,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-01-29 23:30:46,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-29 23:30:46,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:46,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-29 23:30:46,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-29 23:30:46,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:46,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-29 23:30:46,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,314 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-01-29 23:30:46,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 23:30:46,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:30:46,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 23:30:46,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:30:46,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:46,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-01-29 23:30:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:46,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:30:46,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:30:46,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:46,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:46,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:46,405 INFO L87 Difference]: Start difference. First operand 277 states and 301 transitions. Second operand 5 states. [2018-01-29 23:30:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:46,491 INFO L93 Difference]: Finished difference Result 336 states and 364 transitions. [2018-01-29 23:30:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:46,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-29 23:30:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:46,492 INFO L225 Difference]: With dead ends: 336 [2018-01-29 23:30:46,492 INFO L226 Difference]: Without dead ends: 287 [2018-01-29 23:30:46,493 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:30:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-29 23:30:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2018-01-29 23:30:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-29 23:30:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 303 transitions. [2018-01-29 23:30:46,506 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 303 transitions. Word has length 43 [2018-01-29 23:30:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:46,506 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 303 transitions. [2018-01-29 23:30:46,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 303 transitions. [2018-01-29 23:30:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:30:46,507 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:46,507 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:46,508 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash -934699668, now seen corresponding path program 1 times [2018-01-29 23:30:46,508 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:46,508 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:46,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:46,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:46,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:46,539 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-29 23:30:46,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:46,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:30:46,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:30:46,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:30:46,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:30:46,540 INFO L87 Difference]: Start difference. First operand 279 states and 303 transitions. Second operand 3 states. [2018-01-29 23:30:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:46,558 INFO L93 Difference]: Finished difference Result 494 states and 538 transitions. [2018-01-29 23:30:46,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:30:46,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-29 23:30:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:46,559 INFO L225 Difference]: With dead ends: 494 [2018-01-29 23:30:46,560 INFO L226 Difference]: Without dead ends: 281 [2018-01-29 23:30:46,560 INFO L553 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-29 23:30:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-01-29 23:30:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-01-29 23:30:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-29 23:30:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-01-29 23:30:46,573 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 43 [2018-01-29 23:30:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:46,573 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-01-29 23:30:46,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:30:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-01-29 23:30:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 23:30:46,574 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:46,574 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:46,574 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:46,574 INFO L82 PathProgramCache]: Analyzing trace with hash -725547183, now seen corresponding path program 1 times [2018-01-29 23:30:46,574 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:46,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:46,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:46,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:46,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:46,784 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-29 23:30:46,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:46,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:30:46,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:30:46,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:30:46,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:30:46,785 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 10 states. [2018-01-29 23:30:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:47,149 INFO L93 Difference]: Finished difference Result 334 states and 363 transitions. [2018-01-29 23:30:47,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:30:47,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-01-29 23:30:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:47,151 INFO L225 Difference]: With dead ends: 334 [2018-01-29 23:30:47,151 INFO L226 Difference]: Without dead ends: 333 [2018-01-29 23:30:47,151 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:30:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-29 23:30:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 280. [2018-01-29 23:30:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-29 23:30:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-01-29 23:30:47,161 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 44 [2018-01-29 23:30:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:47,161 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-01-29 23:30:47,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:30:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-01-29 23:30:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 23:30:47,162 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:47,162 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:47,163 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash -725547182, now seen corresponding path program 1 times [2018-01-29 23:30:47,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:47,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:47,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:47,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:47,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:47,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:47,444 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-29 23:30:47,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:47,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:30:47,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:30:47,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:30:47,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:30:47,445 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 10 states. [2018-01-29 23:30:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:47,955 INFO L93 Difference]: Finished difference Result 326 states and 353 transitions. [2018-01-29 23:30:47,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:30:47,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-01-29 23:30:47,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:47,957 INFO L225 Difference]: With dead ends: 326 [2018-01-29 23:30:47,957 INFO L226 Difference]: Without dead ends: 325 [2018-01-29 23:30:47,957 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:30:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-01-29 23:30:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 279. [2018-01-29 23:30:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-29 23:30:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 301 transitions. [2018-01-29 23:30:47,970 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 301 transitions. Word has length 44 [2018-01-29 23:30:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:47,970 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 301 transitions. [2018-01-29 23:30:47,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:30:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 301 transitions. [2018-01-29 23:30:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 23:30:47,971 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:47,971 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:47,971 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1882359319, now seen corresponding path program 1 times [2018-01-29 23:30:47,971 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:47,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:47,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:47,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:47,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:47,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:48,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:48,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:30:48,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:30:48,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:30:48,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:30:48,070 INFO L87 Difference]: Start difference. First operand 279 states and 301 transitions. Second operand 7 states. [2018-01-29 23:30:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:48,275 INFO L93 Difference]: Finished difference Result 606 states and 656 transitions. [2018-01-29 23:30:48,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:30:48,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-01-29 23:30:48,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:48,277 INFO L225 Difference]: With dead ends: 606 [2018-01-29 23:30:48,277 INFO L226 Difference]: Without dead ends: 339 [2018-01-29 23:30:48,278 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:30:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-29 23:30:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 283. [2018-01-29 23:30:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 23:30:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 303 transitions. [2018-01-29 23:30:48,286 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 303 transitions. Word has length 45 [2018-01-29 23:30:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:48,286 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 303 transitions. [2018-01-29 23:30:48,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:30:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 303 transitions. [2018-01-29 23:30:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 23:30:48,286 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:48,286 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:48,287 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1562444972, now seen corresponding path program 1 times [2018-01-29 23:30:48,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:48,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:48,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:48,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:48,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:48,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:48,387 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-29 23:30:48,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:48,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:48,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:48,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:48,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:48,388 INFO L87 Difference]: Start difference. First operand 283 states and 303 transitions. Second operand 5 states. [2018-01-29 23:30:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:48,548 INFO L93 Difference]: Finished difference Result 396 states and 426 transitions. [2018-01-29 23:30:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:48,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-01-29 23:30:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:48,550 INFO L225 Difference]: With dead ends: 396 [2018-01-29 23:30:48,550 INFO L226 Difference]: Without dead ends: 395 [2018-01-29 23:30:48,550 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:30:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-01-29 23:30:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 282. [2018-01-29 23:30:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-01-29 23:30:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 302 transitions. [2018-01-29 23:30:48,562 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 302 transitions. Word has length 47 [2018-01-29 23:30:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:48,563 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 302 transitions. [2018-01-29 23:30:48,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 302 transitions. [2018-01-29 23:30:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 23:30:48,564 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:48,564 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:48,564 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:48,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1562444971, now seen corresponding path program 1 times [2018-01-29 23:30:48,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:48,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:48,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:48,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:48,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:48,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:48,620 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-29 23:30:48,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:48,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:48,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:48,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:48,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:48,622 INFO L87 Difference]: Start difference. First operand 282 states and 302 transitions. Second operand 5 states. [2018-01-29 23:30:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:48,834 INFO L93 Difference]: Finished difference Result 409 states and 439 transitions. [2018-01-29 23:30:48,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:48,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-01-29 23:30:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:48,836 INFO L225 Difference]: With dead ends: 409 [2018-01-29 23:30:48,836 INFO L226 Difference]: Without dead ends: 408 [2018-01-29 23:30:48,837 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:30:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-01-29 23:30:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 281. [2018-01-29 23:30:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-29 23:30:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 301 transitions. [2018-01-29 23:30:48,849 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 301 transitions. Word has length 47 [2018-01-29 23:30:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:48,850 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 301 transitions. [2018-01-29 23:30:48,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 301 transitions. [2018-01-29 23:30:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:30:48,851 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:48,851 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:48,851 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:48,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1508072976, now seen corresponding path program 1 times [2018-01-29 23:30:48,851 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:48,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:48,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:48,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:48,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:48,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:48,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:48,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:30:48,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:48,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:48,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:48,915 INFO L87 Difference]: Start difference. First operand 281 states and 301 transitions. Second operand 5 states. [2018-01-29 23:30:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:49,050 INFO L93 Difference]: Finished difference Result 385 states and 410 transitions. [2018-01-29 23:30:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:49,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-29 23:30:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:49,053 INFO L225 Difference]: With dead ends: 385 [2018-01-29 23:30:49,053 INFO L226 Difference]: Without dead ends: 382 [2018-01-29 23:30:49,053 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:30:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-01-29 23:30:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 288. [2018-01-29 23:30:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-01-29 23:30:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 311 transitions. [2018-01-29 23:30:49,066 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 311 transitions. Word has length 50 [2018-01-29 23:30:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:49,066 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 311 transitions. [2018-01-29 23:30:49,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 311 transitions. [2018-01-29 23:30:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:30:49,067 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:49,067 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:49,067 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1508073229, now seen corresponding path program 1 times [2018-01-29 23:30:49,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:49,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:49,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:49,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:49,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:49,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:49,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:49,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:49,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:49,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:49,160 INFO L87 Difference]: Start difference. First operand 288 states and 311 transitions. Second operand 5 states. [2018-01-29 23:30:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:49,340 INFO L93 Difference]: Finished difference Result 382 states and 407 transitions. [2018-01-29 23:30:49,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:30:49,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-29 23:30:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:49,342 INFO L225 Difference]: With dead ends: 382 [2018-01-29 23:30:49,342 INFO L226 Difference]: Without dead ends: 379 [2018-01-29 23:30:49,342 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:30:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-01-29 23:30:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 296. [2018-01-29 23:30:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-29 23:30:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 321 transitions. [2018-01-29 23:30:49,350 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 321 transitions. Word has length 50 [2018-01-29 23:30:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:49,350 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 321 transitions. [2018-01-29 23:30:49,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 321 transitions. [2018-01-29 23:30:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:30:49,351 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:49,351 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:49,351 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1508073230, now seen corresponding path program 1 times [2018-01-29 23:30:49,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:49,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:49,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:49,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:49,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:49,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:49,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:30:49,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:30:49,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:30:49,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:30:49,565 INFO L87 Difference]: Start difference. First operand 296 states and 321 transitions. Second operand 7 states. [2018-01-29 23:30:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:49,840 INFO L93 Difference]: Finished difference Result 341 states and 363 transitions. [2018-01-29 23:30:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:30:49,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-29 23:30:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:49,841 INFO L225 Difference]: With dead ends: 341 [2018-01-29 23:30:49,841 INFO L226 Difference]: Without dead ends: 339 [2018-01-29 23:30:49,841 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:30:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-29 23:30:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 296. [2018-01-29 23:30:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-29 23:30:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 319 transitions. [2018-01-29 23:30:49,851 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 319 transitions. Word has length 50 [2018-01-29 23:30:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:49,851 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 319 transitions. [2018-01-29 23:30:49,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:30:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 319 transitions. [2018-01-29 23:30:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:30:49,852 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:49,852 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:49,852 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash -369882350, now seen corresponding path program 1 times [2018-01-29 23:30:49,852 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:49,852 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:49,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,853 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:49,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:49,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:49,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:49,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:30:49,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:49,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:49,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:49,916 INFO L87 Difference]: Start difference. First operand 296 states and 319 transitions. Second operand 5 states. [2018-01-29 23:30:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:50,040 INFO L93 Difference]: Finished difference Result 392 states and 422 transitions. [2018-01-29 23:30:50,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:30:50,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-29 23:30:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:50,041 INFO L225 Difference]: With dead ends: 392 [2018-01-29 23:30:50,041 INFO L226 Difference]: Without dead ends: 389 [2018-01-29 23:30:50,042 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-29 23:30:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-29 23:30:50,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 299. [2018-01-29 23:30:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-01-29 23:30:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 323 transitions. [2018-01-29 23:30:50,050 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 323 transitions. Word has length 50 [2018-01-29 23:30:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:50,051 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 323 transitions. [2018-01-29 23:30:50,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 323 transitions. [2018-01-29 23:30:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:30:50,052 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:50,052 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:50,052 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:50,052 INFO L82 PathProgramCache]: Analyzing trace with hash -369882603, now seen corresponding path program 1 times [2018-01-29 23:30:50,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:50,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:50,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:50,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:50,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:50,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:50,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:50,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:30:50,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:30:50,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:30:50,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:30:50,160 INFO L87 Difference]: Start difference. First operand 299 states and 323 transitions. Second operand 5 states. [2018-01-29 23:30:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:50,313 INFO L93 Difference]: Finished difference Result 389 states and 419 transitions. [2018-01-29 23:30:50,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:30:50,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-29 23:30:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:50,315 INFO L225 Difference]: With dead ends: 389 [2018-01-29 23:30:50,315 INFO L226 Difference]: Without dead ends: 386 [2018-01-29 23:30:50,315 INFO L553 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-29 23:30:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-29 23:30:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 304. [2018-01-29 23:30:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-01-29 23:30:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 330 transitions. [2018-01-29 23:30:50,327 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 330 transitions. Word has length 50 [2018-01-29 23:30:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:50,328 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 330 transitions. [2018-01-29 23:30:50,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:30:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 330 transitions. [2018-01-29 23:30:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:30:50,328 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:50,328 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:50,328 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:50,328 INFO L82 PathProgramCache]: Analyzing trace with hash -369882604, now seen corresponding path program 1 times [2018-01-29 23:30:50,329 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:50,329 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:50,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:50,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:50,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:50,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:50,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:50,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:30:50,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:30:50,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:30:50,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:30:50,391 INFO L87 Difference]: Start difference. First operand 304 states and 330 transitions. Second operand 7 states. [2018-01-29 23:30:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:50,593 INFO L93 Difference]: Finished difference Result 315 states and 339 transitions. [2018-01-29 23:30:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:30:50,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-29 23:30:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:50,594 INFO L225 Difference]: With dead ends: 315 [2018-01-29 23:30:50,594 INFO L226 Difference]: Without dead ends: 313 [2018-01-29 23:30:50,595 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:30:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-29 23:30:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2018-01-29 23:30:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-01-29 23:30:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 318 transitions. [2018-01-29 23:30:50,603 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 318 transitions. Word has length 50 [2018-01-29 23:30:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:50,603 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 318 transitions. [2018-01-29 23:30:50,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:30:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 318 transitions. [2018-01-29 23:30:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:30:50,604 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:50,604 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:50,604 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2057292869, now seen corresponding path program 1 times [2018-01-29 23:30:50,604 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:50,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:50,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:50,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:50,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:50,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:50,734 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-29 23:30:50,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:50,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:30:50,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:30:50,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:30:50,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:30:50,735 INFO L87 Difference]: Start difference. First operand 295 states and 318 transitions. Second operand 9 states. [2018-01-29 23:30:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:50,988 INFO L93 Difference]: Finished difference Result 309 states and 334 transitions. [2018-01-29 23:30:50,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:30:50,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-01-29 23:30:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:50,990 INFO L225 Difference]: With dead ends: 309 [2018-01-29 23:30:50,990 INFO L226 Difference]: Without dead ends: 308 [2018-01-29 23:30:50,990 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:30:50,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-01-29 23:30:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 294. [2018-01-29 23:30:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-01-29 23:30:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 317 transitions. [2018-01-29 23:30:50,998 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 317 transitions. Word has length 50 [2018-01-29 23:30:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:50,998 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 317 transitions. [2018-01-29 23:30:50,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:30:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 317 transitions. [2018-01-29 23:30:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:30:50,999 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:50,999 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:50,999 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2057292868, now seen corresponding path program 1 times [2018-01-29 23:30:50,999 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:50,999 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:51,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:51,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:51,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:51,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:51,212 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-29 23:30:51,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:51,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:30:51,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:30:51,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:30:51,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:30:51,213 INFO L87 Difference]: Start difference. First operand 294 states and 317 transitions. Second operand 9 states. [2018-01-29 23:30:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:51,510 INFO L93 Difference]: Finished difference Result 308 states and 333 transitions. [2018-01-29 23:30:51,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:30:51,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-01-29 23:30:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:51,549 INFO L225 Difference]: With dead ends: 308 [2018-01-29 23:30:51,549 INFO L226 Difference]: Without dead ends: 307 [2018-01-29 23:30:51,549 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:30:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-29 23:30:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 293. [2018-01-29 23:30:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-29 23:30:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 316 transitions. [2018-01-29 23:30:51,557 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 316 transitions. Word has length 50 [2018-01-29 23:30:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:51,557 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 316 transitions. [2018-01-29 23:30:51,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:30:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 316 transitions. [2018-01-29 23:30:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 23:30:51,557 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:51,558 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:51,558 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash 371590610, now seen corresponding path program 1 times [2018-01-29 23:30:51,558 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:51,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:51,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:51,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:51,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:51,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:51,686 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-29 23:30:51,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:51,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:30:51,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:30:51,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:30:51,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:30:51,687 INFO L87 Difference]: Start difference. First operand 293 states and 316 transitions. Second operand 10 states. [2018-01-29 23:30:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:52,040 INFO L93 Difference]: Finished difference Result 307 states and 332 transitions. [2018-01-29 23:30:52,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:30:52,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-01-29 23:30:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:52,042 INFO L225 Difference]: With dead ends: 307 [2018-01-29 23:30:52,042 INFO L226 Difference]: Without dead ends: 306 [2018-01-29 23:30:52,042 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:30:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-29 23:30:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 292. [2018-01-29 23:30:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-29 23:30:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 315 transitions. [2018-01-29 23:30:52,051 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 315 transitions. Word has length 53 [2018-01-29 23:30:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:52,051 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 315 transitions. [2018-01-29 23:30:52,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:30:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 315 transitions. [2018-01-29 23:30:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 23:30:52,052 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:52,052 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:52,052 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:52,052 INFO L82 PathProgramCache]: Analyzing trace with hash 371590611, now seen corresponding path program 1 times [2018-01-29 23:30:52,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:52,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:52,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:52,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:52,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:52,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:52,236 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-29 23:30:52,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:52,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:30:52,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:30:52,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:30:52,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:30:52,237 INFO L87 Difference]: Start difference. First operand 292 states and 315 transitions. Second operand 10 states. [2018-01-29 23:30:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:52,531 INFO L93 Difference]: Finished difference Result 306 states and 331 transitions. [2018-01-29 23:30:52,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:30:52,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-01-29 23:30:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:52,532 INFO L225 Difference]: With dead ends: 306 [2018-01-29 23:30:52,532 INFO L226 Difference]: Without dead ends: 305 [2018-01-29 23:30:52,532 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:30:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-29 23:30:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 291. [2018-01-29 23:30:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-29 23:30:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 314 transitions. [2018-01-29 23:30:52,541 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 314 transitions. Word has length 53 [2018-01-29 23:30:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:52,542 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 314 transitions. [2018-01-29 23:30:52,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:30:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2018-01-29 23:30:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-29 23:30:52,542 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:52,542 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:52,542 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:52,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1413703354, now seen corresponding path program 1 times [2018-01-29 23:30:52,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:52,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:52,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:52,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:52,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:52,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:53,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:53,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-29 23:30:53,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:30:53,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:30:53,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:30:53,260 INFO L87 Difference]: Start difference. First operand 291 states and 314 transitions. Second operand 17 states. [2018-01-29 23:30:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:54,447 INFO L93 Difference]: Finished difference Result 391 states and 421 transitions. [2018-01-29 23:30:54,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:30:54,447 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-01-29 23:30:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:54,448 INFO L225 Difference]: With dead ends: 391 [2018-01-29 23:30:54,448 INFO L226 Difference]: Without dead ends: 312 [2018-01-29 23:30:54,449 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 23:30:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-29 23:30:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 291. [2018-01-29 23:30:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-29 23:30:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 313 transitions. [2018-01-29 23:30:54,457 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 313 transitions. Word has length 57 [2018-01-29 23:30:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:54,457 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 313 transitions. [2018-01-29 23:30:54,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:30:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 313 transitions. [2018-01-29 23:30:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-29 23:30:54,458 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:54,458 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:30:54,458 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash -548076060, now seen corresponding path program 1 times [2018-01-29 23:30:54,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:54,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:54,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:54,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:54,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:54,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:54,994 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 42 DAG size of output 32 [2018-01-29 23:30:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:55,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:30:55,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-01-29 23:30:55,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:30:55,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:30:55,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:30:55,626 INFO L87 Difference]: Start difference. First operand 291 states and 313 transitions. Second operand 18 states. [2018-01-29 23:30:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:30:56,712 INFO L93 Difference]: Finished difference Result 384 states and 412 transitions. [2018-01-29 23:30:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:30:56,748 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-01-29 23:30:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:30:56,749 INFO L225 Difference]: With dead ends: 384 [2018-01-29 23:30:56,749 INFO L226 Difference]: Without dead ends: 292 [2018-01-29 23:30:56,750 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=1224, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 23:30:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-01-29 23:30:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2018-01-29 23:30:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-29 23:30:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 290 transitions. [2018-01-29 23:30:56,757 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 290 transitions. Word has length 57 [2018-01-29 23:30:56,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:30:56,757 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 290 transitions. [2018-01-29 23:30:56,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:30:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 290 transitions. [2018-01-29 23:30:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-29 23:30:56,758 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:30:56,758 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:30:56,758 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:30:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash 699456494, now seen corresponding path program 1 times [2018-01-29 23:30:56,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:30:56,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:30:56,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:56,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:56,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:30:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:56,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:30:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:30:57,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:30:57,003 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:30:57,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:30:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:30:57,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:30:57,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:57,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:30:57,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:30:57,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:57,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:57,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-29 23:30:57,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:30:57,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:30:57,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:57,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:57,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:57,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-29 23:30:57,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-29 23:30:57,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-29 23:30:57,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:57,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:57,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:30:57,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-29 23:30:57,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-01-29 23:30:57,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-29 23:30:57,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:30:57,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:30:57,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:30:57,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-01-29 23:31:01,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-01-29 23:31:01,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-01-29 23:31:01,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:31:01,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:31:01,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-29 23:31:01,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:76 [2018-01-29 23:31:13,506 WARN L143 SmtUtils]: Spent 12018ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-29 23:31:13,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-01-29 23:31:13,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-29 23:31:13,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:31:13,631 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:31:13,639 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2018-01-29 23:31:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:31:13,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:31:13,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-01-29 23:31:13,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-29 23:31:13,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-29 23:31:13,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=475, Unknown=2, NotChecked=0, Total=552 [2018-01-29 23:31:13,701 INFO L87 Difference]: Start difference. First operand 269 states and 290 transitions. Second operand 24 states. [2018-01-29 23:31:56,573 WARN L146 SmtUtils]: Spent 22064ms on a formula simplification. DAG size of input: 59 DAG size of output 50 [2018-01-29 23:32:10,778 WARN L143 SmtUtils]: Spent 12030ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-29 23:32:23,038 WARN L143 SmtUtils]: Spent 12029ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-29 23:32:35,098 WARN L143 SmtUtils]: Spent 12029ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-29 23:32:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:32:37,542 INFO L93 Difference]: Finished difference Result 643 states and 704 transitions. [2018-01-29 23:32:37,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 23:32:37,543 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-01-29 23:32:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:32:37,544 INFO L225 Difference]: With dead ends: 643 [2018-01-29 23:32:37,545 INFO L226 Difference]: Without dead ends: 642 [2018-01-29 23:32:37,545 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 93.4s TimeCoverageRelationStatistics Valid=369, Invalid=1342, Unknown=11, NotChecked=0, Total=1722 [2018-01-29 23:32:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-01-29 23:32:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 390. [2018-01-29 23:32:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-01-29 23:32:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 433 transitions. [2018-01-29 23:32:37,556 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 433 transitions. Word has length 75 [2018-01-29 23:32:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:32:37,556 INFO L432 AbstractCegarLoop]: Abstraction has 390 states and 433 transitions. [2018-01-29 23:32:37,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-29 23:32:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 433 transitions. [2018-01-29 23:32:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-29 23:32:37,557 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:32:37,557 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:32:37,557 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-29 23:32:37,557 INFO L82 PathProgramCache]: Analyzing trace with hash 699456495, now seen corresponding path program 1 times [2018-01-29 23:32:37,557 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:32:37,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:32:37,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:32:37,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:32:37,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:32:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:32:37,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:32:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:32:38,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:32:38,051 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:32:38,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:32:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:32:38,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:32:38,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:32:38,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:32:38,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:32:38,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:32:38,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-29 23:32:38,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:32:38,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:32:38,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:32:38,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:32:38,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-01-29 23:32:38,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-29 23:32:38,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-29 23:32:38,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-01-29 23:32:38,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-29 23:32:38,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:32:38,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-01-29 23:32:38,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-01-29 23:32:38,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-29 23:32:38,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-01-29 23:32:38,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-29 23:32:38,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:32:38,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:32:38,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:79 Received shutdown request... [2018-01-29 23:32:44,422 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 23:32:44,423 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:32:44,428 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:32:44,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:32:44 BoogieIcfgContainer [2018-01-29 23:32:44,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:32:44,429 INFO L168 Benchmark]: Toolchain (without parser) took 136637.63 ms. Allocated memory was 305.7 MB in the beginning and 747.6 MB in the end (delta: 442.0 MB). Free memory was 264.5 MB in the beginning and 536.0 MB in the end (delta: -271.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:32:44,430 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:32:44,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.31 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 252.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:32:44,430 INFO L168 Benchmark]: Boogie Preprocessor took 38.56 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:32:44,430 INFO L168 Benchmark]: RCFGBuilder took 622.78 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 205.4 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. [2018-01-29 23:32:44,430 INFO L168 Benchmark]: TraceAbstraction took 135752.82 ms. Allocated memory was 305.7 MB in the beginning and 747.6 MB in the end (delta: 442.0 MB). Free memory was 205.4 MB in the beginning and 536.0 MB in the end (delta: -330.6 MB). Peak memory consumption was 111.4 MB. Max. memory is 5.3 GB. [2018-01-29 23:32:44,432 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.31 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 252.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.56 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 622.78 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 205.4 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 135752.82 ms. Allocated memory was 305.7 MB in the beginning and 747.6 MB in the end (delta: 442.0 MB). Free memory was 205.4 MB in the beginning and 536.0 MB in the end (delta: -330.6 MB). Peak memory consumption was 111.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 206 locations, 75 error locations. TIMEOUT Result, 135.6s OverallTime, 47 OverallIterations, 3 TraceHistogramMax, 101.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7292 SDtfs, 10929 SDslu, 23302 SDs, 0 SdLazy, 15076 SolverSat, 730 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 745 GetRequests, 220 SyntacticMatches, 28 SemanticMatches, 497 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 105.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 46 MinimizatonAttempts, 2350 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 2006 NumberOfCodeBlocks, 2006 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1957 ConstructedInterpolants, 52 QuantifiedInterpolants, 757229 SizeOfPredicates, 44 NumberOfNonLiveVariables, 561 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 49 InterpolantComputations, 43 PerfectInterpolantSequences, 55/86 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-32-44-439.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-32-44-439.csv Completed graceful shutdown